Abstract
This simulation-based study examines the behavior of a realistic shared-memory multiprocessor system that utilizes Omega networks. A unique aspect is the presence of bursts of requests, such as processors with associated vector units or caches would generate. It is demonstrated that the forward network, the memory modules, and the reverse network of such a system interact and affect each other’s performance such that good performance depends less on the speed of any one component than on the interaction between them. Cost-effective modifications for improving this balance are evaluated. Within the range of system sizes studied (32 to 512 processors), results show that MIN-based systems that operate close to their peak memory bandwidth can indeed be constructed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
G. H. Barnes and S. F. Lundstrom. Design and Validation of a Connection Network for Multiprocessor Systems. IEEE Computer, pages 31–41, Dec 1981.
Eugene D. Brooks III. A butterfly processor-memory interconnection for a vector processing environment. Parallel Computing, 4:103–110, 1987.
Daniel M. Dias and J. Robert Jump. Analysis and Simulation of Buffered Delta Networks. IEEE Transactions on Computers, C-30(4):273–282, April 1981.
[Gajski et al., 1983] Daniel Gajski, David Kuck, Duncan Lawrie, and Ahmed Sameh. Cedar—a Large Scale Multiprocessor. In Proceedings of the International Conference on Parallel Processing, pages 524–529, Aug 1983.
[Gornish et al., 1990] Edward H. Gornish, Elana D. Granston, and Alexander V. Veidenbaum. Compiler-directed Data Prefetching in Multiprocessors with Memory Hierarchies. In Proceedings of the International Conference on Supercomputing, pages 354–368, June 1990.
[Gottlieb et al., 1983] Allan Gottlieb, Ralph Grishman, Clyde P. Kruskal, Kevin P. McAuliffe, Larry Rudolph, and Marc Snir. The NYU Ultracomputer—Designing an MIMD Shared Memory Parallel Computer. IEEE Transactions on Computers, C-32(2):176–189, February 1983.
[Granston et al., 1991] Elana D. Granston, Stephen W. Turner, and Alexander V. Veidenbaum. Designing a Scalable Shared-memory System with Support for Burst Traffic. Technical Report 1084, Center for Supercomputing Research and Development, University of Illinois at Urbana-Champaign, 1991.
[Hiraki et al., 1984] Kei Hiraki, Toshio Shimada, and Kenji Nishida. A Hardware Design of the Sigma-1, A Data Flow Computer for Scientific Computations. In Proceedings of the International Conference on Parallel Processing, pages 61–68, August 1984.
Clyde P. Kruskal and Marc Snir. The Performance of Multistage Interconnection Networks for Multiprocessors. IEEE Transactions on Computers, C-32(12):1091–1098, December 1983.
[Kruskal et al., 1988] Clyde P. Kruskal, Marc Snir, and Alan Weiss. The Distribution of Waiting Times in Clocked Multistage Interconnection Networks. IEEE Transactions on Computers, 37(11):1337–1352, November 1988.
Duncan H. Lawrie. Access and Alignment of Data in an Array Processor. IEEE Transactions on Computers, C-24(12):173–183, December 1975.
Kevin McAuliffe. Analysis of Cache Memories in Highly Parallel Systems. PhD thesis, Dept. of Computer Science, New York University, May 1986.
Janak H. Patel. Performance of Processor-Memory Interconnections for Multiprocessors. IEEE Transactions on Computers, C-30(10):771–780, October 1981.
[Pfister et al., 1985] Gregory F. Pfister, W. C. Brantley, D. A. George, S. L. Harvey, W. J. Kleinfeider, K. P. McAuliffe, E. A. Melton, V. A. Norton, and J. Weiss. The IBM Research Parallel Processor Prototype (RP3): Introduction and Architecture. In Proceedings of the International Conference on Parallel Processing, pages 764–771, August 1985.
[Siegel et al., 1989] Howard Jay Siegel, Wayne G. Nation, Clyde P. Kruskal, and Jr.Leonard M. Napolitano. Using the Multistage Cube Network Topology in Parallel Supercomputers. Proceedings of the IEEE, 77(12):1932–1953, December 1989.
Stephen W. Turner and Alexander V. Veiden-baum. Performance of a Shared Memory System for Vector Multiprocessrs. In Proceedings of the International Conference on Supercomputing, pages 315–325, July 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer Science+Business Media New York
About this chapter
Cite this chapter
Granston, E.D., Turner, S.W., Veidenbaum, A.V. (1992). Design and Analysis of a Scalable, Shared-memory System with Support for Burst Traffic. In: Dubois, M., Thakkar, S. (eds) Scalable Shared Memory Multiprocessors. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-3604-8_7
Download citation
DOI: https://doi.org/10.1007/978-1-4615-3604-8_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6601-0
Online ISBN: 978-1-4615-3604-8
eBook Packages: Springer Book Archive