Abstract
The Reflecting and Growing mappings have been proposed to map parallel divide-and-conquer algorithms onto two — dimensional meshes. The performance of these mappings has been previously analyzed under the assumption that the parallel algorithm is initiated always at the same fixed node of the mesh. In such scenario, the Reflecting mapping is optimal for meshes with wormhole routing and the Growing mapping is very close to the optimal for meshes with store-and-forward routing. In this paper we consider a more general scenario in which the parallel divide-and-conquer algorithm can be started at an arbitrary node of the mesh. We propose and approach that is simpler than both the Reflecting and Growing mappings, is optimal for wormhole meshes and better than the Growing mapping for store-and-forward meshes.
This work was supported by the Ministry of Education and Science of Spain (CICYT TIC-429/95).
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
González, A., Valero-García, M., Díaz de Cerio L.: Executing Algorithms with Hypercube Topology on Torus Multicomputers. IEEE Transactions on Parallel and Distributed Systems 8 (1995) 803–814
Lo, V., Rajopadhye, S., Telle, J.A.: Parallel Divide and Conquer on Meshes. IEEE Transactions on Parallel and Distributed Systems 10 (1996) 1049–1057
Matic, S.: Emulation of Hypercube Architecture on Nearest-Neighbor Mesh-Connected Processing Elements. IEEE Transactions on Computers 5 (1990) 698–700
Valero-García, M., González, A., Díaz de Cerio, L., Royo, D.: Divide-and-Conquer Algorithms on Two-Dimensional Meshes. Research Report UPC-DAC-1997-30, http://www.ac.upc.es/recerca/reports/INDEX1997DAC.html
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Valero-García, M., González, A., de Cerio, L.D., Royo, D. (1998). Divide-and-conquer algorithms on two-dimensional meshes. In: Pritchard, D., Reeve, J. (eds) Euro-Par’98 Parallel Processing. Euro-Par 1998. Lecture Notes in Computer Science, vol 1470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0057966
Download citation
DOI: https://doi.org/10.1007/BFb0057966
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64952-6
Online ISBN: 978-3-540-49920-6
eBook Packages: Springer Book Archive