Please use this identifier to cite or link to this item:
|Title:||Dynamic scheduling of imprecise-computation tasks in maximizing QoS under energy constraints for embedded systems||Authors:||Yu, H.
|Issue Date:||2008||Citation:||Yu, H.,Veeravalli, B.,Ha, Y. (2008). Dynamic scheduling of imprecise-computation tasks in maximizing QoS under energy constraints for embedded systems. Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC : 452-455. ScholarBank@NUS Repository. https://doi.org/10.1109/ASPDAC.2008.4483993||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. ©2008 IEEE.||Source Title:||Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC||URI:||http://scholarbank.nus.edu.sg/handle/10635/70051||ISBN:||9781424419227||DOI:||10.1109/ASPDAC.2008.4483993|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 18, 2021
checked on Oct 14, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.