Abstract
We present a bus arbitration scheme for soft real-time constrained embedded systems. Some masters in such systems are required to complete their work for given timing constraints, resulting in the satisfaction of system-level timing constraints. The computation time of each master is predictable, but it is not easy to predict its data transfer time since the communication architecture is mostly shared by several masters. Previous works solved this issue by minimizing the latencies of several latency-critical masters, but the side effect of these methods is that it can increase the latencies of other masters, hence they may violate the given timing constraints. Unlike previous works, our method uses the concept of "slack" in order to make the latency as close as its given constraint, resulting in the reduction of the side effect. The proposed arbitration scheme consists of bandwidth-conscious arbiter and scheduler. The arbiter can be any existing bandwidth-conscious arbiter and the scheduler implements the latency-awareness proposed in this paper. The scheduler is involved in the arbitration only when it observes a request whose slack is not sufficient for the given timing constraint. The experimental results show that our method outperforms the conventional round-robin arbiter by more than 100% in the best case in terms of the longest violated cycles.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the ASP-DAC 2007 - Asia and South Pacific Design Automation Conference 2007 |
| Pages | 159-164 |
| Number of pages | 6 |
| DOIs | |
| Publication status | Published - 2007 Dec 1 |
| Event | ASP-DAC 2007 - Asia and South Pacific Design Automation Conference 2007 - Yokohama, Japan Duration: 2007 Jan 23 → 2007 Jan 27 |
Publication series
| Name | Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC |
|---|
Other
| Other | ASP-DAC 2007 - Asia and South Pacific Design Automation Conference 2007 |
|---|---|
| Country | Japan |
| City | Yokohama |
| Period | 07/1/23 → 07/1/27 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Science Applications
- Computer Graphics and Computer-Aided Design
- Electrical and Electronic Engineering
Cite this
}
Slack-based bus arbitration scheme for soft real-time constrained embedded systems. / Jun, Minje; Bang, Kwanhu; Lee, Hyuk Jun; Chang, Naehyuck; Chung, Eui Young.
Proceedings of the ASP-DAC 2007 - Asia and South Pacific Design Automation Conference 2007. 2007. p. 159-164 4196025 (Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
TY - GEN
T1 - Slack-based bus arbitration scheme for soft real-time constrained embedded systems
AU - Jun, Minje
AU - Bang, Kwanhu
AU - Lee, Hyuk Jun
AU - Chang, Naehyuck
AU - Chung, Eui Young
PY - 2007/12/1
Y1 - 2007/12/1
N2 - We present a bus arbitration scheme for soft real-time constrained embedded systems. Some masters in such systems are required to complete their work for given timing constraints, resulting in the satisfaction of system-level timing constraints. The computation time of each master is predictable, but it is not easy to predict its data transfer time since the communication architecture is mostly shared by several masters. Previous works solved this issue by minimizing the latencies of several latency-critical masters, but the side effect of these methods is that it can increase the latencies of other masters, hence they may violate the given timing constraints. Unlike previous works, our method uses the concept of "slack" in order to make the latency as close as its given constraint, resulting in the reduction of the side effect. The proposed arbitration scheme consists of bandwidth-conscious arbiter and scheduler. The arbiter can be any existing bandwidth-conscious arbiter and the scheduler implements the latency-awareness proposed in this paper. The scheduler is involved in the arbitration only when it observes a request whose slack is not sufficient for the given timing constraint. The experimental results show that our method outperforms the conventional round-robin arbiter by more than 100% in the best case in terms of the longest violated cycles.
AB - We present a bus arbitration scheme for soft real-time constrained embedded systems. Some masters in such systems are required to complete their work for given timing constraints, resulting in the satisfaction of system-level timing constraints. The computation time of each master is predictable, but it is not easy to predict its data transfer time since the communication architecture is mostly shared by several masters. Previous works solved this issue by minimizing the latencies of several latency-critical masters, but the side effect of these methods is that it can increase the latencies of other masters, hence they may violate the given timing constraints. Unlike previous works, our method uses the concept of "slack" in order to make the latency as close as its given constraint, resulting in the reduction of the side effect. The proposed arbitration scheme consists of bandwidth-conscious arbiter and scheduler. The arbiter can be any existing bandwidth-conscious arbiter and the scheduler implements the latency-awareness proposed in this paper. The scheduler is involved in the arbitration only when it observes a request whose slack is not sufficient for the given timing constraint. The experimental results show that our method outperforms the conventional round-robin arbiter by more than 100% in the best case in terms of the longest violated cycles.
UR - http://www.scopus.com/inward/record.url?scp=46649115332&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=46649115332&partnerID=8YFLogxK
U2 - 10.1109/ASPDAC.2007.357979
DO - 10.1109/ASPDAC.2007.357979
M3 - Conference contribution
AN - SCOPUS:46649115332
SN - 1424406293
SN - 9781424406296
T3 - Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC
SP - 159
EP - 164
BT - Proceedings of the ASP-DAC 2007 - Asia and South Pacific Design Automation Conference 2007
ER -