BROWSE
Detail
Conference Paper
An Implementation and Performance Analysis of Slave-Side Arbitration Schemes for the ML-AHB BusMatrix
Cited 1 time in 
Share 
Share
- Authors
- Soo Yun Hwang, Hyeong Jun Park, Kyoung Son Jhang
- Issue Date
- 2007-03
- Citation
- Symposium on Applied Computing (SAC) 2007, pp.1545-1551
- Language
- English
- Type
- Conference Paper
- Abstract
- The slave-side arbitration is different from the master-side arbitration based on the request and grant signals. The slave-side arbitration uses the response signals of slave for arbitration. Also, the arbitration overhead of the slave-side arbitration is 10% smaller than that of the master-side arbitration. In this paper, we implement and analyze the slave-side arbitration schemes for the ML-AHB busmatrix. We implemented the ML-AHB busmatrixes with fixed priority, round robin and dynamic priority arbitration schemes. Our busmatrix implementation particularly reduces area and clock period by 17% and 19% respectively, compared with those of busmatrix of ARM by virtue of the masking mechanism. With the performance simulations, we observed that when there are few masters with long job length in a bus system, the dynamic priority based arbitration shows the maximum performance and in other cases the arbitration based on round robin shows the highest performance. In addition, the arbitration scheme with transaction based multiplexing shows higher performance than the same arbitration scheme with single transfer based switching in an application with frequent accesses to the long latency devices or memories such as SDRAM. The improvements of the arbitration scheme with transaction based multiplexing are 26%, 42% and 51%, respectively when the latency times of SDRAM are 1, 2 and 3 clock cycles. Copyright 2007 ACM.
- KSP Keywords
- AHB busmatrix, Bus system, Clock Period, Dynamic Priority, Higher performance, Performance analysis, Priority-Based, fixed priority, round robin