Presentation
Window Feedback Based Multi-Master Arbiter IP for Efficient Hardware Resource Sharing
SessionLeading edge digital IP
DescriptionIn most complex digital architectures multiple Masters may compete for access to shared hardware resources (e.g., buses, memories, CPUs).
Arbitration algorithms are used to determine which Master takes over control of them at any time.
Fixed priority and Round-Robin are the most widespread algorithms used to face this kind of challenge. While those are effective in some cases, they may not be optimal for systems with varying traffic patterns.
This paper proposes a novel digital IP which implements a new starvation-free multi-master arbitration algorithm based on feedback considering the "history" of previous requests and grants within a given timeframe. This allows an efficient access to the shared resource and outperforming conventional approaches.
The proposed algorithm not only ensures a starvation-free feature, thus confirming that no Master is unfairly blocked from gaining access to the shared resource indefinitely, but also can guarantee a maximum granting time for every Master involved.
The verification of the IP was conducted through formal analysis to guarantee its starvation-free feature, while UVM dynamic simulations showed a significant reduction (from 30 % up to 64 %, in relation to dissimilar scenarios) of the average waiting time of every involved Master, compared to RR algorithm.
Arbitration algorithms are used to determine which Master takes over control of them at any time.
Fixed priority and Round-Robin are the most widespread algorithms used to face this kind of challenge. While those are effective in some cases, they may not be optimal for systems with varying traffic patterns.
This paper proposes a novel digital IP which implements a new starvation-free multi-master arbitration algorithm based on feedback considering the "history" of previous requests and grants within a given timeframe. This allows an efficient access to the shared resource and outperforming conventional approaches.
The proposed algorithm not only ensures a starvation-free feature, thus confirming that no Master is unfairly blocked from gaining access to the shared resource indefinitely, but also can guarantee a maximum granting time for every Master involved.
The verification of the IP was conducted through formal analysis to guarantee its starvation-free feature, while UVM dynamic simulations showed a significant reduction (from 30 % up to 64 %, in relation to dissimilar scenarios) of the average waiting time of every involved Master, compared to RR algorithm.
Presenter
Event Type
IP
TimeMonday, June 242:15pm - 2:30pm PDT
Location2012, 2nd Floor
Engineering Tracks
IP