Slack-based bus arbitration scheme for soft real-time constrained embedded systems

Minje Jun, Kwanhu Bang, Hyuk Jun Lee, Naehyuck Chang, Eui Young Chung

Research output: Chapter in Book/Report/Conference proceedingConference contribution

18 Citations (Scopus)

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 languageEnglish
Title of host publicationProceedings of the ASP-DAC 2007 - Asia and South Pacific Design Automation Conference 2007
Pages159-164
Number of pages6
DOIs
Publication statusPublished - 2007 Dec 1
EventASP-DAC 2007 - Asia and South Pacific Design Automation Conference 2007 - Yokohama, Japan
Duration: 2007 Jan 232007 Jan 27

Other

OtherASP-DAC 2007 - Asia and South Pacific Design Automation Conference 2007
CountryJapan
CityYokohama
Period07/1/2307/1/27

Fingerprint

Embedded systems
Bandwidth
Data transfer
Communication

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering

Cite this

Jun, M., Bang, K., Lee, H. J., Chang, N., & Chung, E. Y. (2007). Slack-based bus arbitration scheme for soft real-time constrained embedded systems. In Proceedings of the ASP-DAC 2007 - Asia and South Pacific Design Automation Conference 2007 (pp. 159-164). [4196025] https://doi.org/10.1109/ASPDAC.2007.357979
Jun, Minje ; Bang, Kwanhu ; Lee, Hyuk Jun ; Chang, Naehyuck ; Chung, Eui Young. / Slack-based bus arbitration scheme for soft real-time constrained embedded systems. Proceedings of the ASP-DAC 2007 - Asia and South Pacific Design Automation Conference 2007. 2007. pp. 159-164
@inproceedings{e380a3a272624dd7bc7ba67ec90a9bbe,
title = "Slack-based bus arbitration scheme for soft real-time constrained embedded systems",
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.",
author = "Minje Jun and Kwanhu Bang and Lee, {Hyuk Jun} and Naehyuck Chang and Chung, {Eui Young}",
year = "2007",
month = "12",
day = "1",
doi = "10.1109/ASPDAC.2007.357979",
language = "English",
isbn = "1424406293",
pages = "159--164",
booktitle = "Proceedings of the ASP-DAC 2007 - Asia and South Pacific Design Automation Conference 2007",

}

Jun, M, Bang, K, Lee, HJ, Chang, N & Chung, EY 2007, Slack-based bus arbitration scheme for soft real-time constrained embedded systems. in Proceedings of the ASP-DAC 2007 - Asia and South Pacific Design Automation Conference 2007., 4196025, pp. 159-164, ASP-DAC 2007 - Asia and South Pacific Design Automation Conference 2007, Yokohama, Japan, 07/1/23. https://doi.org/10.1109/ASPDAC.2007.357979

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.

Research output: Chapter in Book/Report/Conference proceedingConference 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

SN - 1424406293

SN - 9781424406296

SP - 159

EP - 164

BT - Proceedings of the ASP-DAC 2007 - Asia and South Pacific Design Automation Conference 2007

ER -

Jun M, Bang K, Lee HJ, Chang N, Chung EY. Slack-based bus arbitration scheme for soft real-time constrained embedded systems. In Proceedings of the ASP-DAC 2007 - Asia and South Pacific Design Automation Conference 2007. 2007. p. 159-164. 4196025 https://doi.org/10.1109/ASPDAC.2007.357979