DocumentCode :
405821
Title :
New HRRN in the bus arbitration of SoC design
Author :
Liu Hong ; Xu Ningyi ; Zhou Zucheng
Author_Institution :
Dept. of Electron. Eng., Tsinghua Univ., Beijing, China
Volume :
1
fYear :
2003
fDate :
21-24 Oct. 2003
Firstpage :
405
Abstract :
With the development of SoC technology, bus arbitration has become the core issue in computing systems. This paper discusses four scheduling algorithms having existed, which are FCFS (First Come First Served), SF (Shortest Job/Process First), HRRN (Highest Response Ratio Next) and HPF (Highest Priority First), compares their performance in runtime and latency, and points out their limitations in application. Then new algorithm for arbitration as New HRRN is proposed, which is designed to overcome the shortcomings of the former algorithms. Through experiments, the scheduling algorithm is tested, and proved to be successful, because it could perform well not only in latency, but also in bandwidth.
Keywords :
asynchronous circuits; bandwidth allocation; scheduling; system buses; system-on-chip; FCFS; HPF; HRRN; SF; SoC design; bandwidth allocation; bus arbitration; computing systems; first come first served; highest priority first; highest response ratio next; scheduling algorithms; shortest job/process first; system-on-chip;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
ASIC, 2003. Proceedings. 5th International Conference on
ISSN :
1523-553X
Print_ISBN :
0-7803-7889-X
Type :
conf
DOI :
10.1109/ICASIC.2003.1277573
Filename :
1277573
Link To Document :
بازگشت