Home » Node » Design and implementation of a massively parallel version of DIRECT

Design and implementation of a massively parallel version of DIRECT

TitleDesign and implementation of a massively parallel version of DIRECT
Publication TypeJournal Article
Year of Publication2008
AuthorsHe J, Verstak A, Watson LT, Sosonkina M
Journal TitleComputational Optimization and Applications
Volume40
Pages217-245
Date PublishedJun
Type of ArticleArticle
ISBN Number0926-6003
Accession NumberISI:000254848000004
Keywordsdata structures, direct, global optimization, global search, load balancing, PARAMETER-ESTIMATION, search algorithm, task allocation
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.
DOI10.1007/s10589-007-9092-2
Alternate JournalComput. Optim. Appl.