ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
A real-time and bandwidth guaranteed arbitration algorithm for SoC bus communication
Full text PdfPdf (277 KB)
Source Asia and South Pacific Design Automation Conference archive
Proceedings of the 2006 Asia and South Pacific Design Automation Conference table of contents
Yokohama, Japan
SESSION: Advanced memory and processor architectures for MPSoC table of contents
Pages: 600 - 605  
Year of Publication: 2006
ISBN:0-7803-9451-8
Authors
Chien-Hua Chen  National Chiao Tung University, Hsinchu, Taiwan
Geeng-Wei Lee  National Chiao Tung University, Hsinchu, Taiwan
Juinn-Dar Huang  National Chiao Tung University, Hsinchu, Taiwan
Jing-Yang Jou  National Chiao Tung University, Hsinchu, Taiwan
Sponsors
: IEEE Circuits and Systems Society
SIGDA: ACM Special Interest Group on Design Automation
IEICE ESS : Institute of Electronics, Information and Communication Engineers, Engineering Sciences Society
IPSJ SIG-SLDM : Information Processing Society of Japan, SIG System LSI Design Methodology
Publisher
IEEE Press  Piscataway, NJ, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 19,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1118299.1118441
What is a DOI?

ABSTRACT

In shared SoC bus systems, arbiters are usually adopted to solve bus contentions with various kinds of arbitration algorithms. We propose an arbitration algorithm, RT_lottery, which is designed to meet both hard real-time and bandwidth requirements. For fast evaluation and exploration, we use high abstract-level models in our system simulation environment to generate parameters for our configurable arbiter. The experimental results show that RT_lottery can meet all hard real-time requirements and perform very well in bandwidth allocation. The results also show that RT_lottery outperforms several commonly-used arbitration algorithms today.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
C. H. Pyoun, C. H. Lin, H. S. Kim, and J. W. Chong, "The Efficient Bus Arbitration Scheme In Soc Environment," International Workshop on System-on-Chip for Real-Time Applications, 2003, Page(s):311 -- 315.
 
2
M. Yang, S. Q. Zheng, Bhagyavati, and S. Kurkovsky, "Programmable Weighted Arbiters for Constructing Switch Schedulers," Workshop on High Performance Switching and Routing, 2004, Page(s):203 -- 206.
3
 
4
F. Poletti, D. Bertozzi, L. Benini, and A. Bogliolo, "Performance Analysis of Arbitration Policies for SoC Communication Architectures," Journal of Design Automation for Embedded Systems, 2003, Page(s):618 -- 621.
5
 
6
A. C. Waldspurger and W. E. Weih., "Lottery Scheduling: Flexible Proportional Share Resource Management," Symp. on Operating Systems Design and Implementation, 1994.
 
7

Collaborative Colleagues:
Chien-Hua Chen: colleagues
Geeng-Wei Lee: colleagues
Juinn-Dar Huang: colleagues
Jing-Yang Jou: colleagues