DocumentCode
3025447
Title
A trace-driven analysis of the `wrap-around´ network
Author
Benveniste, Caroline ; Hsu, Yarsun
Author_Institution
Dept. of Electr. Eng., Columbia Univ., New York, NY, USA
fYear
1990
fDate
17-19 Sep 1990
Firstpage
82
Lastpage
85
Abstract
Performance of the wraparound network through trace-driven simulation is examined. This network has a processor attached to each node, but the links in the network are unidirectional, and the two ends of the network are joined together. Traces of three representative parallel engineering/scientific programs are used as input to the simulator, and the performance of this network is compared to that of an omega network under the same inputs. The wraparound network and the omega network are found to perform similarly, while the size and cost of the wraparound network are smaller than those of the omega
Keywords
multiprocessor interconnection networks; performance evaluation; network performance; node; omega network; trace-driven analysis; trace-driven simulation; unidirectional links; wraparound network; Bandwidth; Board of Directors; Delay; Logic; Network topology; Packet switching; Routing; Shape; Switches; Wiring;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Design: VLSI in Computers and Processors, 1990. ICCD '90. Proceedings, 1990 IEEE International Conference on
Conference_Location
Cambridge, MA
Print_ISBN
0-8186-2079-X
Type
conf
DOI
10.1109/ICCD.1990.130167
Filename
130167
Link To Document