The Community for Technology Leaders
2013 IEEE 19th International Symposium on High Performance Computer Architecture (HPCA) (2000)
Toulouse, France
Jan. 8, 2000 to Jan. 12, 2000
ISBN: 0-7695-0550-3
pp: 97
Aniruddha Vaidya , Pennsylvania State University
Ki Hwan Yum , Pennsylvania State University
Chita R. Das , Pennsylvania State University
Anand Sivasubramaniam , Pennsylvania State University
ABSTRACT
With the increasing use of clusters in real-time applications, it has become essential to design high performance networks with quality of service (QoS) guarantees. In this paper, we explore the feasibility of providing QoS in wormhole switched routers, which are otherwise well known for designing high performance interconnects. In particular, we are interested in supporting multimedia video streams, in addition to the conventional best-effort traffic.The proposed MediaWorm router uses a rate-based bandwidth allocation mechanism, called Virtual Clock, to schedule network resources for different traffic classes. Our simulation results on an 8-port router indicate that it is possible to provide jitter-free delivery to VBR/CBR traffic up to an input load of 70-80% of link bandwidth, and the presence of best-effort traffic has no adverse effect on the real-time traffic.Although the MediaWorm router shows a slightly lower performance than a pipelined circuit switched (PCS) router, commercial success of wormhole switching coupled with the simpler and cheaper design makes it an attractive alternative. Simulation of a (2 x 2) fat-mesh using this router suggests that clusters designed with appropriate bandwidth balance between links can provide good performance for different types of traffic.
INDEX TERMS
Cluster Network, Pipelined Circuit Switching, Quality of Service, Router Architecture, Virtual Clock, Wormhole Router
CITATION
Aniruddha Vaidya, Ki Hwan Yum, Chita R. Das, Anand Sivasubramaniam, "Investigating QoS Support for Traffic Mixes with the MediaWorm Router", 2013 IEEE 19th International Symposium on High Performance Computer Architecture (HPCA), vol. 00, no. , pp. 97, 2000, doi:10.1109/HPCA.2000.824342
96 ms
(Ver 3.3 (11022016))