loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
41st Annual Simulation Symposium (anss-41 2008)
An Efficient Weighted-Round-Robin Algorithm for Multiprocessor Architectures
April 13-April 16
ISBN: 978-0-7695-3143-4
Complex System-on-Chip (SoC) architectures comprise multiple master and slave modules. Master modules such as processors and hardware accelerators send requests or data to slave modules, e.g. memories and register banks. Efficient communication among master and slave modules requires adequate on-chip interconnect architectures with arbitration that features contention resolution, prioritization, and fairness. In this paper we present a new arbitration method with a parameterizable algorithm, such that the arbitration for each shared resource can be optimized to the traffic patterns, target characteristics, and quality-of-service requirements. We use a weighted-round-robin algorithm that takes these properties into account. As our simulations show we can improve the overall system performance of a multi-processor SoC by up to 41 %.
Index Terms:
Algorithm, Arbitration, Weighted Round Robin, System on Chip, SystemQ, Multiprocessor
Citation:
S?ren Sonntag, Helmut Reinig, "An Efficient Weighted-Round-Robin Algorithm for Multiprocessor Architectures," anss-41, pp.193-199, 41st Annual Simulation Symposium (anss-41 2008), 2008
Usage of this product signifies your acceptance of the Terms of Use.