DocumentCode
2483457
Title
High throughput networks for petaflops computing
Author
Wittie, Larry ; Sazaklis, George ; Zhou, Yaping ; Zinoviev, Dmitry
Author_Institution
Dept. of Comput. Sci. & Phys., State Univ. of New York, Stony Brook, NY, USA
fYear
1998
fDate
20-23 Oct 1998
Firstpage
312
Lastpage
317
Abstract
The smallest networks that can connect eight thousand processing elements and memory interfaces in a petaflops cryocomputer contain hundreds of thousands of 2×2 switching nodes. We have determined circuit costs, maximal throughput and average latency for feasible multistage banyan and multidimensional pruned ring mesh networks. Each can deliver 20000 single-word packets every 30 picoseconds, more than eight million gigabytes per second. Switching delays one-way through each network total 1 to 2 nanoseconds. Banyans have 2/3 the switching delays of the smallest meshes. However, banyan signal propagation delays are larger. The only candidate network needing less than 100 square meters in four connection layers is a pruned mesh of shape 18×18×55×55 with nearly one million nodes. The smallest banyan has one quarter as many nodes, but needs nearly twice the wiring area
Keywords
delays; multiprocessing systems; multiprocessor interconnection networks; multistage interconnection networks; performance evaluation; average latency; circuit costs; high throughput networks; maximal throughput; memory interfaces; multidimensional pruned ring mesh networks; multistage banyan networks; petaflops computing; single-word packets; switching delays; switching nodes; Circuits; Computer networks; Computer science; Delay; Josephson junctions; Prototypes; Random access memory; Superconductivity; Switches; Throughput;
fLanguage
English
Publisher
ieee
Conference_Titel
Reliable Distributed Systems, 1998. Proceedings. Seventeenth IEEE Symposium on
Conference_Location
West Lafayette, IN
ISSN
1060-9857
Print_ISBN
0-8186-9218-9
Type
conf
DOI
10.1109/RELDIS.1998.740515
Filename
740515
Link To Document