On the limited memory BFGS method for large scale optimization
Mathematical Programming: Series A and B
The PMESC programming library for distributed-memory MIMD computers
Journal of Parallel and Distributed Computing
Task Parallelism: What a Tool Can Provide and What Should Be Left to the User
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing - Volume I
IBM Journal of Research and Development
Hi-index | 0.00 |
We discuss the parallelization of our protein structure prediction algorithm on distributed-memory computers. Because the computation can be represented as a search through a vast tree of possible solutions, a hierarchical approach that assigns subtrees to different groups of processors allows us to partition the work efficiently and maintain information updated without incurring significant communication overhead. Our results show that a dynamic strategy for load balancing outperforms the static one.