Abstract
This paper describes a cluster structure to reduce the amount of network hardware in distributed memory parallel processors. The expected reduction in the data transfer rate as the number of nodes is reduced is avoided by raising the transfer rate of each path. Calculations for typical application programs show that clustering can reduce the hardware quantity by 40% provided that inner-cluster parallel processing efficiency is sufficiently high.
Preview
Unable to display preview. Download preview PDF.
References
Tanaka, T., Hamanaka, N. and Muramatsu, A., “The MIMD Type Parallel Processing Architecture based on Tagged Data Transfer”, Proceedings of the Parallel Processing Symposium, 1989 (in Japanese).
Hanawa, M., Nishimukai, T., Nishii, O., Suzuki, M., Yano, K., Hiraki, M., Shukuri, S. and Nishida, T., “On-Chip Multiple Superscalar Processors with Secondary Cache Memories”, Proceedings 1991 IEEE International Conference on Computer Design: VLSI in Computers & Processors, 1991.
Hamanaka, N., Tanaka, T. and Muramatsu, A., “Performance Evaluation of a Numerical Calculation Oriented Macro Dataflow Computer”, Dataflow Workshop, 1987 (in Japanese).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hamanaka, N., Nakagoshi, J., Tanaka, T. (1992). Reducing network hardware quantity by employing multi-processor cluster structure in distributed memory parallel processors. In: Bougé, L., Cosnard, M., Robert, Y., Trystram, D. (eds) Parallel Processing: CONPAR 92—VAPP V. VAPP CONPAR 1992 1992. Lecture Notes in Computer Science, vol 634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55895-0_393
Download citation
DOI: https://doi.org/10.1007/3-540-55895-0_393
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55895-8
Online ISBN: 978-3-540-47306-0
eBook Packages: Springer Book Archive