Abstract
In this paper we present a parallel algorithm for the solution of discrete optimization problems, which is a typical example of highly irregularly structured problems.
The Processor Farm model, well suited for this class of problems, has been modified to eliminate the presence of the coordinator, which represents a bottleneck for the parallel computation.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Di Martino, B., Mazzeo, A., Mazzocca, N., Russo, S. (1997). Distributed coordination in optimization algorithms. In: Hertzberger, B., Sloot, P. (eds) High-Performance Computing and Networking. HPCN-Europe 1997. Lecture Notes in Computer Science, vol 1225. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0031692
Download citation
DOI: https://doi.org/10.1007/BFb0031692
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62898-9
Online ISBN: 978-3-540-69041-2
eBook Packages: Springer Book Archive