Computational Optimization and Applications

, Volume 40, Issue 2, pp 217–245

Design and implementation of a massively parallel version of DIRECT


  • Jian He
    • Department of Computer ScienceVirginia Polytechnic Institute and State University
  • Alex Verstak
    • Department of Computer ScienceVirginia Polytechnic Institute and State University
    • Departments of Computer Science and MathematicsVirginia Polytechnic Institute and State University
  • Masha Sosonkina
    • Ames LaboratoryIowa State University

DOI: 10.1007/s10589-007-9092-2

Cite this article as:
He, J., Verstak, A., Watson, L.T. et al. Comput Optim Appl (2008) 40: 217. doi:10.1007/s10589-007-9092-2


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.


Data structuresDIRECTGlobal searchLoad balancingTask allocation
Download to read the full article text

Copyright information

© Springer Science+Business Media, LLC 2007