Abstract
Frequently, algorithms for a given multicomputer architecture cannot be used (or are not efficient) for a different architecture. The proposed method allows the systematic design of complete exchange algorithms for meshes and tori and it can be extended to some other architectures that may be interesting in the future.
Chapter PDF
References
L. Díaz de Cerio, A. Gonzĺlez and M. Valero-García, Communication Pipelining in Hypercubes, Parallel Processing Letters, Vol. 6, No. 4, December 1996.
L. Díaz de Cerio, M. Valero-García and A. González, A Systematic Approach to Develop Efficient Complete Exchange Algorithms for Meshes and Tori, Research Report UPC-DAC-97-29, http://www.ac.upc.es/recerca/reports/INDEX1997DAC.html
A. González, M. Valero-García and L. Díaz de Cerio, Executing Algorithms with Hypercube Topology on Torus Multicomputers, IEEE Trans. on Parallel and Distributed Systems, Vol. 6, No. 8, August 1995, pp. 803–814.
S.L. Jonhnsson and C.-T. Ho, Optimal All-to-All Personalized Communication with Minimum Span on Boolean Cubes, in proceedings of the6th Distributed Memory Computing Conf., 1991, pp. 299–304.
S. Matic, Emulation of Hypercube Architecture on Nearest-Neighbor Mesh-Connectec Processing Elements, IEEE Trans. on Computers, vol. 39, No. 5, May 1990, pp. 698–700.
J.G. Peters and M. Syska, Circuit-Switched Broadcasting in Torus Networks, IEEE Trans, on Parallel and Distributed Systems, Vol. 7, No. 3, March 1996, pp. 246–255.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Cerio, L.D., Valero-García, M., González, A. (2000). Complete Exchange Algorithms for Meshes and Tori Using a Systematic Approach. In: Bode, A., Ludwig, T., Karl, W., Wismüller, R. (eds) Euro-Par 2000 Parallel Processing. Euro-Par 2000. Lecture Notes in Computer Science, vol 1900. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44520-X_81
Download citation
DOI: https://doi.org/10.1007/3-540-44520-X_81
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67956-1
Online ISBN: 978-3-540-44520-3
eBook Packages: Springer Book Archive