Please use this identifier to cite or link to this item: https://doi.org/10.1145/2544375.2544392
DC FieldValue
dc.titleEnergy-aware task mapping and scheduling for reliable embedded computing systems
dc.contributor.authorDas, A.
dc.contributor.authorKumar, A.
dc.contributor.authorVeeravalli, B.
dc.date.accessioned2014-10-07T04:27:30Z
dc.date.available2014-10-07T04:27:30Z
dc.date.issued2014
dc.identifier.citationDas, A., Kumar, A., Veeravalli, B. (2014). Energy-aware task mapping and scheduling for reliable embedded computing systems. Transactions on Embedded Computing Systems 13 (2 SUPPL.) : -. ScholarBank@NUS Repository. https://doi.org/10.1145/2544375.2544392
dc.identifier.issn15399087
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/82279
dc.description.abstractTask mapping and scheduling are critical in minimizing energy consumption while satisfying the performance requirement of applications enabled on heterogeneous multiprocessor systems. An area of growing concern for modern multiprocessor systems is the increase in the failure probability of one or more component processors. This is especially critical for applications where performance degradation (e.g., throughput) directly impacts the quality of service requirement. This article proposes a design-time (offline) multi-criterion optimization technique for application mapping on embedded multiprocessor systems to minimize energy consumption for all processor fault-scenarios. A scheduling technique is then proposed based on self-timed execution to minimize the schedule storage and construction overhead at runtime. Experiments conducted with synthetic and real applications from streaming and nonstreaming domains on heterogeneous MPSoCs demonstrate that the proposed technique minimizes energy consumption by 22% and design space exploration time by 100x, while satisfying the throughput requirement for all processor fault-scenarios. For scalable throughput applications, the proposed technique achieves 30% better throughput per unit energy, compared to the existing techniques. Additionally, the self-timed execution-based scheduling technique minimizes schedule construction time by 95% and storage overhead by 92%. © 2014 ACM.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1145/2544375.2544392
dc.sourceScopus
dc.subjectEnergy consumption
dc.subjectFault tolerance
dc.subjectMultimedia applications
dc.subjectSynchronous dataflow graphs
dc.subjectTask mapping and scheduling
dc.typeArticle
dc.contributor.departmentELECTRICAL & COMPUTER ENGINEERING
dc.description.doi10.1145/2544375.2544392
dc.description.sourcetitleTransactions on Embedded Computing Systems
dc.description.volume13
dc.description.issue2 SUPPL.
dc.description.page-
dc.identifier.isiut000330905800017
Appears in Collections:Staff Publications

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

Google ScholarTM

Check

Altmetric


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