Title :
Scalability of the Cedar system
Author :
Turner, Stephen W. ; Veidenbaum, Alexander V.
Author_Institution :
Center for Supercomput. Res. & Dev., Illinois Univ., Urbana, IL, USA
Abstract :
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
Keywords :
hypercube networks; performance evaluation; telecommunication traffic; vector processor systems; Cedar system; brute force approach; clock speed; hierarchical shared-memory multiprocessor; interconnection networks; memory modules; memory subsystem; network traffic limiting; performance scalability; simulation methodology; unidirectional multistage shuffle-exchange networks; vector processors; word-interleaved shared memory; Clocks; Costs; Hardware; Kernel; Monitoring; Probes; Prototypes; Research and development; Scalability; Vector processors;
Conference_Titel :
Supercomputing '94., Proceedings
Conference_Location :
Washington, DC
Print_ISBN :
0-8186-6605-6
DOI :
10.1109/SUPERC.1994.344284