Design and implementation of a massively parallel version of DIRECT

Authors:
Jian He;Alex Verstak;Layne T. Watson;Masha Sosonkina
Affiliations:
Department of Computer Science, Virginia Polytechnic Institute and State University, Blacksburg, USA 24061;Department of Computer Science, Virginia Polytechnic Institute and State University, Blacksburg, USA 24061;Departments of Computer Science and Mathematics, Virginia Polytechnic Institute and State University, Blacksburg, USA 24061;Ames Laboratory, Iowa State University, Ames, USA 50011
Venue:
Computational Optimization and Applications
Year:
2008

Citing 10
Cited 6

Min-max heaps and generalized priority queues

Communications of the ACM
Lipschitzian optimization without the Lipschitz constant

Journal of Optimization Theory and Applications
Global arrays: a nonuniform memory access programming model for high-performance computers

The Journal of Supercomputing
Parallel programming in OpenMP

Parallel programming in OpenMP
A 2-D parallel convex hull algorithm with optimal communication phases

Parallel Computing
Using MPI-2: Advanced Features of the Message Passing Interface

Using MPI-2: Advanced Features of the Message Passing Interface
Dynamic Data Structures for a Direct Search Algorithm

Computational Optimization and Applications
ARMCI: A Portable Remote Memory Copy Libray for Ditributed Array Libraries and Compiler Run-Time Systems

Proceedings of the 11 IPPS/SPDP'99 Workshops Held in Conjunction with the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing
Modifications of the direct algorithm

Modifications of the direct algorithm
Deterministic parallel global parameter estimation for a model of the budding yeast cell cycle

Journal of Global Optimization

Performance Modeling and Analysis of a Massively Parallel Direct - Part 1

International Journal of High Performance Computing Applications
Performance Modeling and Analysis of a Massively Parallel Direct - Part 2

International Journal of High Performance Computing Applications
Algorithm 897: VTDIRECT95: Serial and parallel codes for the global optimization algorithm direct

ACM Transactions on Mathematical Software (TOMS)
Direct search versus simulated annealing on two high dimensional problems

Proceedings of the 19th High Performance Computing Symposia
Direct search and stochastic optimization applied to two nonconvex nonsmooth problems

Proceedings of the 2012 Symposium on High Performance Computing
Parallel deterministic and stochastic global minimization of functions with very many minima

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

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.