Cart (Loading....) | Create Account
Close category search window
 

Implementation and characterization of protein folding on a desktop computational grid. Is CHARMM a suitable candidate for the United Devices MetaProcessor?

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Uk, B. ; Dept. of Comput. Sci., Eidgenossische Tech. Hochschule, Zurich, Switzerland ; Taufer, M. ; Stricker, T. ; Settanni, G.
more authors

CHARMM is a popular molecular dynamics code for computational biology. For many CHARMM applications such as protein folding, desktop grids could become viable alternatives to clusters of PCs. We present a prototype and discuss the viability of a protein folding application with CHARMM on the United Devices MetaProcessor, a platform for widely distributed computing. We identify the algorithmic approach of protein folding as a hybrid search algorithm with best-first, depth-first and breadth-first components and address the issues of task scheduling and fault tolerance. The performance evaluation of our system indicates that the calculation is robust against the heterogeneity of compute nodes and limited communication capabilities typically found in desktop grids. We show that there is an interesting tradeoff between accuracy and task parallelism resulting in optimal work-pool size for a given platform and a given simulation. Surprisingly the platform heterogeneity of a desktop grid positively affects the quality of protein folding simulations. Protein folding calculations with CHARMM turn out to be well suitable for desktop grids like e.g. the United Devices MetaProcessor. Our software system can make a large amount of nearly free compute cycles available to computational biologists.

Published in:

Parallel and Distributed Processing Symposium, 2003. Proceedings. International

Date of Conference:

22-26 April 2003

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.