Please use this identifier to cite or link to this item: https://doi.org/10.1109/ICPADS.2007.4447753
DC FieldValue
dc.titleNovel critical-path based low-energy scheduling algorithms for heterogeneous multiprocessor real-time embedded systems
dc.contributor.authorLiu, Y.
dc.contributor.authorVeeravalli, B.
dc.contributor.authorViswanathan, S.
dc.date.accessioned2014-06-19T03:20:45Z
dc.date.available2014-06-19T03:20:45Z
dc.date.issued2007
dc.identifier.citationLiu, Y.,Veeravalli, B.,Viswanathan, S. (2007). Novel critical-path based low-energy scheduling algorithms for heterogeneous multiprocessor real-time embedded systems. Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS 1 : -. ScholarBank@NUS Repository. <a href="https://doi.org/10.1109/ICPADS.2007.4447753" target="_blank">https://doi.org/10.1109/ICPADS.2007.4447753</a>
dc.identifier.isbn9781424418909
dc.identifier.issn15219097
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/71176
dc.description.abstractIn this paper, we propose novel low-energy static and dynamic scheduling algorithms with low computational complexities, for heterogeneous multiprocessor real-time embedded systems. We consider task graphs with deadlines and precedence relationships to satisfy. We propose a novel scheme, referred to as "critical-path information track-and update", based on critical-path analysis to distribute the slack-time over tasks such that energy consumption is minimized, while guaranteeing the precedence and timing constraints. Our dynamic scheduling algorithm applies the static scheduling algorithm during runtime based on the updated average-case execution demands of tasks. Our simulation results show that the proposed static scheduling algorithm consumes only 2% of the computational time with no degradation in energy savings, whereas the dynamic scheduling algorithm delivers up to 25% more energy savings while reducing the computational time overhead by more than 90%, when compared with recent heterogeneous multiprocessor scheduling algorithms. © 2007 IEEE.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/ICPADS.2007.4447753
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentELECTRICAL & COMPUTER ENGINEERING
dc.description.doi10.1109/ICPADS.2007.4447753
dc.description.sourcetitleProceedings of the International Conference on Parallel and Distributed Systems - ICPADS
dc.description.volume1
dc.description.page-
dc.description.codenPIPSF
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

12
checked on Aug 1, 2021

Page view(s)

104
checked on Jul 15, 2021

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.