Paper Info
Title
Age-based packet arbitration in large-radix k-ary n-cubes
Abstract
As applications scale to increasingly large processor counts, the interconnection network is frequently the limiting factor in application performance. In order to achieve application scalability, the interconnect must maintain high bandwidth while minimizing variation in packet latency. As the offered load in the network increases with growing problem sizes and processor counts, so does the expected maximum packet latency in the network, directly impacting performance of applications with any synchronized communication. Age-based packet arbitration reduces the variance in packet latency as well as average latency. This paper describes the Cray XT router packet aging algorithm which allows globally fair arbitration by incorporating "age" in the packet output arbitration. We describe the parameters of the aging algorithm and how to arrive at appropriate settings. We show that an efficient aging algorithm reduces both the average packet latency and the variance in packet latency on communication-intensive benchmarks.
Year
DOI
Venue
2007
10.1145/1362622.1362630
SC
Keywords
Field
DocType
average latency,fair arbitration,interconnection network,packet latency,age-based packet arbitration,expected maximum packet latency,packet output arbitration,large-radix k-ary n-cubes,efficient aging algorithm,average packet latency,cray xt router packet,history,architecture,radiation detectors,torus,arbitration,limiting factor,multiprocessor,government,cache memory,data mining,aging,packet switching,synchronous communication,computer science,routing,bandwidth,sun
End-to-end delay,Packet analyzer,Computer science,Network packet,Transmission delay,Parallel computing,Burst switching,Computer network,Link state packet,Fast packet switching,Processing delay
Conference
Citations 
PageRank 
References 
30
1.63
6
Authors
2
Name
Order
Citations
PageRank
Dennis Abts134925.10
Deborah Weisser2301.63