Communication with spawned processes

Authors:
N. Radcliffe;M. Sosonkina;L. T. Watson
Affiliations:
Virginia Polytechnic Institute and State University Blacksburg, Virginia;Iowa State University, Wilhelm Hall Ames, Iowa;Virginia Polytechnic Institute and State University Blacksburg, Virginia
Venue:
Proceedings of the 19th High Performance Computing Symposia
Year:
2011

Citing 3
Cited 0

Lipschitzian optimization without the Lipschitz constant

Journal of Optimization Theory and Applications
MPI: The Complete Reference

MPI: The Complete Reference
Algorithm 897: VTDIRECT95: Serial and parallel codes for the global optimization algorithm direct

ACM Transactions on Mathematical Software (TOMS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Motivated by prior work with the global optimization algorithm pVTDIRECT95 [2], this paper considers two methods for simplifying communication with spawned processes. Tests are performed for each method, and runtimes for the two methods are compared. In general, the performance of the two methods is quite similar, although other aspects of each method set the methods apart. In particular, restrictions on how the spawning has to be done determines the practicality of the method.