Maximum-Utility Scheduling of Operation Modes With Probabilistic Task Execution Times Under Energy Constraints
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, Wan Yeon | - |
dc.contributor.author | Kim, Hyogon | - |
dc.contributor.author | Lee, Heejo | - |
dc.date.accessioned | 2021-09-08T12:44:20Z | - |
dc.date.available | 2021-09-08T12:44:20Z | - |
dc.date.created | 2021-06-11 | - |
dc.date.issued | 2009-10 | - |
dc.identifier.issn | 0278-0070 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/119138 | - |
dc.description.abstract | We propose a novel scheduling scheme that determines the instant operation modes of multiple tasks. The tasks have probabilistic execution times and are executed on discrete operation modes providing different utilities with different energy consumptions. We first design an optimal offline scheduling scheme that stochastically maximizes the cumulative utility of the tasks under energy constraints, at the cost of heavy computational overhead. Next, the optimal offline scheme is modified to an approximate online scheduling scheme. The online scheme has little runtime overhead and yields almost the maximum utility, with an energy budget that is given at runtime. The difference between the maximum utility and the output utility of the online scheme is bounded by a controllable input value. Extensive evaluation shows that the output utility of the online scheme approaches the maximum utility in most cases, and is much higher than that of existing methods by up to 50% of the largest utility difference among available operation modes. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.subject | SYSTEMS | - |
dc.subject | FRAMEWORK | - |
dc.subject | QOS | - |
dc.title | Maximum-Utility Scheduling of Operation Modes With Probabilistic Task Execution Times Under Energy Constraints | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Hyogon | - |
dc.contributor.affiliatedAuthor | Lee, Heejo | - |
dc.identifier.doi | 10.1109/TCAD.2009.2026352 | - |
dc.identifier.scopusid | 2-s2.0-77955210379 | - |
dc.identifier.wosid | 000270036600008 | - |
dc.identifier.bibliographicCitation | IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, v.28, no.10, pp.1531 - 1544 | - |
dc.relation.isPartOf | IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS | - |
dc.citation.title | IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS | - |
dc.citation.volume | 28 | - |
dc.citation.number | 10 | - |
dc.citation.startPage | 1531 | - |
dc.citation.endPage | 1544 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Hardware & Architecture | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Interdisciplinary Applications | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.subject.keywordPlus | SYSTEMS | - |
dc.subject.keywordPlus | FRAMEWORK | - |
dc.subject.keywordPlus | QOS | - |
dc.subject.keywordAuthor | Approximate scheduling | - |
dc.subject.keywordAuthor | energy constraint | - |
dc.subject.keywordAuthor | maximum utility | - |
dc.subject.keywordAuthor | optimal scheduling | - |
dc.subject.keywordAuthor | probabilistic execution time | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.