Dynamic scheduling of imprecise-computation tasks in maximizing QoS under energy constraints for embedded systems

Heng Yu; Bharadwaj Veeravalli; Yajun Ha

doi:10.1109/ASPDAC.2008.4483993

Dynamic scheduling of imprecise-computation tasks in maximizing QoS under energy constraints for embedded systems

Heng Yu, Bharadwaj Veeravalli, Yajun Ha

Research output: Chapter in Book/Conference proceeding › Conference contribution › peer-review

22 Citations (Scopus)

Abstract

In designing energy-aware CPU scheduling algorithms for real-time embedded systems, dynamic slack reclamation techniques significantly improve system Quality-of-Service (QoS) and energy efficiency. However, the limited schemes in this domain either demand high complexity or can only achieve limited QoS. In this paper, we present a novel low complexity runtime scheduling algorithm for the Imprecise Computation (IC) modeled tasks. The target is to maximize system QoS under energy constraints. Our proposed algorithm, named Gradient Curve Shifting (GCS), is able to decide the best allocation of slack cycles arising at runtime, with very low complexity. We study both linear and concave QoS functions associated with IC modelde tasks, on non-DVS and DVS processors. Furthermore, we apply the intra-task DVS technique to tasks and achieve as large as 18% more of the system QoS compared to the conventional "optimal" solution which is inter-task DVS based.

Original language	English
Title of host publication	2008 Asia and South Pacific Design Automation Conference, ASP-DAC
Pages	452-455
Number of pages	4
DOIs	https://doi.org/10.1109/ASPDAC.2008.4483993
Publication status	Published - 2008
Externally published	Yes
Event	2008 Asia and South Pacific Design Automation Conference, ASP-DAC - Seoul, Korea, Republic of Duration: 21 Mar 2008 → 24 Mar 2008

Publication series

Name	Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

Conference

Conference	2008 Asia and South Pacific Design Automation Conference, ASP-DAC
Country/Territory	Korea, Republic of
City	Seoul
Period	21/03/08 → 24/03/08

ASJC Scopus subject areas

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

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1109/ASPDAC.2008.4483993

Cite this

Yu, H., Veeravalli, B., & Ha, Y. (2008). Dynamic scheduling of imprecise-computation tasks in maximizing QoS under energy constraints for embedded systems. In 2008 Asia and South Pacific Design Automation Conference, ASP-DAC (pp. 452-455). Article 4483993 (Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC). https://doi.org/10.1109/ASPDAC.2008.4483993

@inproceedings{7e20720f56b548f0b0587cf71b2468fd,

title = "Dynamic scheduling of imprecise-computation tasks in maximizing QoS under energy constraints for embedded systems",

abstract = "In designing energy-aware CPU scheduling algorithms for real-time embedded systems, dynamic slack reclamation techniques significantly improve system Quality-of-Service (QoS) and energy efficiency. However, the limited schemes in this domain either demand high complexity or can only achieve limited QoS. In this paper, we present a novel low complexity runtime scheduling algorithm for the Imprecise Computation (IC) modeled tasks. The target is to maximize system QoS under energy constraints. Our proposed algorithm, named Gradient Curve Shifting (GCS), is able to decide the best allocation of slack cycles arising at runtime, with very low complexity. We study both linear and concave QoS functions associated with IC modelde tasks, on non-DVS and DVS processors. Furthermore, we apply the intra-task DVS technique to tasks and achieve as large as 18% more of the system QoS compared to the conventional {"}optimal{"} solution which is inter-task DVS based.",

author = "Heng Yu and Bharadwaj Veeravalli and Yajun Ha",

year = "2008",

doi = "10.1109/ASPDAC.2008.4483993",

language = "English",

isbn = "9781424419227",

series = "Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC",

pages = "452--455",

booktitle = "2008 Asia and South Pacific Design Automation Conference, ASP-DAC",

}

Yu, H, Veeravalli, B & Ha, Y 2008, Dynamic scheduling of imprecise-computation tasks in maximizing QoS under energy constraints for embedded systems. in 2008 Asia and South Pacific Design Automation Conference, ASP-DAC., 4483993, Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC, pp. 452-455, 2008 Asia and South Pacific Design Automation Conference, ASP-DAC, Seoul, Korea, Republic of, 21/03/08. https://doi.org/10.1109/ASPDAC.2008.4483993

Dynamic scheduling of imprecise-computation tasks in maximizing QoS under energy constraints for embedded systems. / Yu, Heng; Veeravalli, Bharadwaj; Ha, Yajun.
2008 Asia and South Pacific Design Automation Conference, ASP-DAC. 2008. p. 452-455 4483993 (Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC).

Research output: Chapter in Book/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Dynamic scheduling of imprecise-computation tasks in maximizing QoS under energy constraints for embedded systems

AU - Yu, Heng

AU - Veeravalli, Bharadwaj

AU - Ha, Yajun

PY - 2008

Y1 - 2008

N2 - In designing energy-aware CPU scheduling algorithms for real-time embedded systems, dynamic slack reclamation techniques significantly improve system Quality-of-Service (QoS) and energy efficiency. However, the limited schemes in this domain either demand high complexity or can only achieve limited QoS. In this paper, we present a novel low complexity runtime scheduling algorithm for the Imprecise Computation (IC) modeled tasks. The target is to maximize system QoS under energy constraints. Our proposed algorithm, named Gradient Curve Shifting (GCS), is able to decide the best allocation of slack cycles arising at runtime, with very low complexity. We study both linear and concave QoS functions associated with IC modelde tasks, on non-DVS and DVS processors. Furthermore, we apply the intra-task DVS technique to tasks and achieve as large as 18% more of the system QoS compared to the conventional "optimal" solution which is inter-task DVS based.

AB - In designing energy-aware CPU scheduling algorithms for real-time embedded systems, dynamic slack reclamation techniques significantly improve system Quality-of-Service (QoS) and energy efficiency. However, the limited schemes in this domain either demand high complexity or can only achieve limited QoS. In this paper, we present a novel low complexity runtime scheduling algorithm for the Imprecise Computation (IC) modeled tasks. The target is to maximize system QoS under energy constraints. Our proposed algorithm, named Gradient Curve Shifting (GCS), is able to decide the best allocation of slack cycles arising at runtime, with very low complexity. We study both linear and concave QoS functions associated with IC modelde tasks, on non-DVS and DVS processors. Furthermore, we apply the intra-task DVS technique to tasks and achieve as large as 18% more of the system QoS compared to the conventional "optimal" solution which is inter-task DVS based.

UR - http://www.scopus.com/inward/record.url?scp=49549104624&partnerID=8YFLogxK

U2 - 10.1109/ASPDAC.2008.4483993

DO - 10.1109/ASPDAC.2008.4483993

M3 - Conference contribution

AN - SCOPUS:49549104624

SN - 9781424419227

T3 - Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

SP - 452

EP - 455

BT - 2008 Asia and South Pacific Design Automation Conference, ASP-DAC

T2 - 2008 Asia and South Pacific Design Automation Conference, ASP-DAC

Y2 - 21 March 2008 through 24 March 2008

ER -

Dynamic scheduling of imprecise-computation tasks in maximizing QoS under energy constraints for embedded systems

Abstract

Publication series

Conference

ASJC Scopus subject areas

UN SDGs

Access to Document

Other files and links

Fingerprint

Cite this