Design and implementation of a massively parallel version of DIRECT |
| |
| Authors: | Jian He Alex Verstak Layne T. Watson Masha Sosonkina |
| |
| Affiliation: | (1) Department of Computer Science, Virginia Polytechnic Institute and State University, Blacksburg, VA 24061, USA;(2) Departments of Computer Science and Mathematics, Virginia Polytechnic Institute and State University, Blacksburg, VA 24061, USA;(3) Ames Laboratory, Iowa State University, Ames, IA 50011, USA |
| |
| Abstract: | This paper describes several massively parallel implementations for a global search algorithm DIRECT. Two parallel schemes take different approaches to address DIRECT’s design challenges imposed by memory requirements and data dependency. Three design aspects in topology, data structures, and task allocation are compared in detail. The goal is to analytically investigate the strengths and weaknesses of these parallel schemes, identify several key sources of inefficiency, and experimentally evaluate a number of improvements in the latest parallel DIRECT implementation. The performance studies demonstrate improved data structure efficiency and load balancing on a 2200 processor cluster. |
| |
| Keywords: | Data structures DIRECT Global search Load balancing Task allocation |
| 本文献已被 SpringerLink 等数据库收录！ |
|
