Abstract
The paper presents a parallel algorithm for computation of solvent accessible surface area of a molecule according to the Lee and Richards's (1971) algorithm. The efficient parallelization of this process is crucial in dynamic simulations of protein molecules and protein folding studies. The solvent accessible surface area (ASA) problem exhibits inherent parallelism that is exploited in the design of a parallel program which is implemented on an Intel iPSC machine. The performance of the parallel algorithm is enhanced by a dynamic load balancing scheme. The authors report on experiments performed on a set of protein structures.
Original language | English (US) |
---|---|
Title of host publication | Proceedings of 7th International Parallel Processing Symposium, IPPS 1993 |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 685-689 |
Number of pages | 5 |
ISBN (Electronic) | 0818634421, 9780818634420 |
DOIs | |
State | Published - 1993 |
Event | 7th International Parallel Processing Symposium, IPPS 1993 - Newport, United States Duration: Apr 13 1993 → Apr 16 1993 |
Publication series
Name | Proceedings of 7th International Parallel Processing Symposium, IPPS 1993 |
---|
Conference
Conference | 7th International Parallel Processing Symposium, IPPS 1993 |
---|---|
Country/Territory | United States |
City | Newport |
Period | 4/13/93 → 4/16/93 |
Funding
*This work supported in part by NSF grant CCR-9209345. This work supported in part by NSF grant CCR-9209345
ASJC Scopus subject areas
- Computer Science Applications
- Hardware and Architecture
- Software
- Computational Theory and Mathematics
- Computer Networks and Communications