Cedar is a hierarchical shared-memory multiprocessor consisting of four clusters of vector processors connected to a 32-bank word-interleaved shared memory via two unidirectional multistage shuffle-exchange networks. Cedar scalability is studied via simulation and measurement. The simulation methodology is verified by comparing simulated performance with that of the real machine. The performance scalability of the interconnection networks and memory modules which compose Cedar's shared memory system is then examined in detail. The system is shown to be basically scalable in performance, but not perfectly so. A "brute force" approach to increasing scalability, doubling the clock speed of the memory subsystem, is shown to be only moderately effective at improving scalability. Finally, by limiting traffic in the network, the scalability of the system is increased significantly at very little cost.<<ETX>>
[1]
Allison Woodruff,et al.
Alleviation of tree saturation in multistage interconnection networks
,
1991,
Proceedings of the 1991 ACM/IEEE Conference on Supercomputing (Supercomputing '91).
[2]
Gurindar S. Sohi,et al.
The Use of Feedback in Multiprocessors and Its Application to Tree Saturation Control
,
1990,
IEEE Trans. Parallel Distributed Syst..
[3]
Alexander V. Veidenbaum,et al.
Performance of a shared memory system for vector multiprocessors
,
1988,
ICS '88.
[4]
William J. Dally,et al.
Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels
,
1993,
IEEE Trans. Parallel Distributed Syst..
[5]
Alexander V. Veidenbaum,et al.
The Organization of the Cedar System
,
1991,
ICPP.