Position-based weighted round-robin arbitration for equality of service in many-core network-on-chips

Authors:
Hanmin Park;Kiyoung Choi
Affiliations:
Seoul National University, Seoul, Korea;Seoul National University, Seoul, Korea
Venue:
Proceedings of the Fifth International Workshop on Network on Chip Architectures
Year:
2012

Citing 9
Cited 0

Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

IEEE Transactions on Computers
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
The turn model for adaptive routing

Journal of the ACM (JACM)
Designing and Implementing a Fast Crossbar Scheduler

IEEE Micro
Principles and Practices of Interconnection Networks

Principles and Practices of Interconnection Networks
Age-based packet arbitration in large-radix k-ary n-cubes

Proceedings of the 2007 ACM/IEEE conference on Supercomputing
Probabilistic Distance-Based Arbitration: Providing Equality of Service for Many-Core CMPs

MICRO '43 Proceedings of the 2010 43rd Annual IEEE/ACM International Symposium on Microarchitecture
Computer Architecture, Fifth Edition: A Quantitative Approach

Computer Architecture, Fifth Edition: A Quantitative Approach
Computer Networks, Fifth Edition: A Systems Approach

Computer Networks, Fifth Edition: A Systems Approach

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents the position-based weighted round-robin arbitration for equality of service in many-core network-on-chips employing a deterministic routing algorithm. We concentrate on the network saturation induced by the hot-spot traffic that occurs when the threads running on the system simultaneously access shared data, global shared locks, etc. It exploits the deterministic properties of the interconnect network---the topology and the routing algorithm. This leads to the omission of additional information in packet headers, compared to the previous approaches. The hardware overhead is minimal, requiring only the weight counters in addition to a typical round-robin arbiter. Compared with the previous work, the proposed algorithm also reduces the critical path delay due to its simplicity. Although designed against the hot-spot traffic, the proposed arbitration scheme shows little performance degradation under other traffic patterns in terms of the average latency and the saturation throughput.