Power-aware scheduling for periodic real-time tasks

We address power-aware scheduling of periodic tasks to reduce CPU energy consumption in hard real-time systems through dynamic voltage scaling. Our intertask voltage scheduling solution includes three components: 1) a static (offline) solution to compute the optimal speed, assuming worst-case worklo...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on computers 2004-05, Vol.53 (5), p.584-600
Main Authors: Aydin, H., Melhem, R., Mosse, D., Mejia-Alvarez, P.
Format: Article
Language:English
Subjects:
Optimization methods
Power demand
Real time systems
Scheduling
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c383t-ed1b7e8938be4986e70e51249c94a536e5ae6b7cc84ee6f3d72de2f962a368d33
cites cdi_FETCH-LOGICAL-c383t-ed1b7e8938be4986e70e51249c94a536e5ae6b7cc84ee6f3d72de2f962a368d33
container_end_page 600
container_issue 5
container_start_page 584
container_title IEEE transactions on computers
container_volume 53
creator Aydin, H.
Melhem, R.
Mosse, D.
Mejia-Alvarez, P.
description We address power-aware scheduling of periodic tasks to reduce CPU energy consumption in hard real-time systems through dynamic voltage scaling. Our intertask voltage scheduling solution includes three components: 1) a static (offline) solution to compute the optimal speed, assuming worst-case workload for each arrival, 2) an online speed reduction mechanism to reclaim energy by adapting to the actual workload, and 3) an online, adaptive and speculative speed adjustment mechanism to anticipate early completions of future executions by using the average-case workload information. All these solutions still guarantee that all deadlines are met. Our simulation results show that our reclaiming algorithm alone outperforms other recently proposed intertask voltage scheduling schemes. Our speculative techniques are shown to provide additional gains, approaching the theoretical lower-bound by a margin of 10 percent.
doi_str_mv 10.1109/TC.2004.1275298
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1109_TC_2004_1275298</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1275298</ieee_id><sourcerecordid>2428111011</sourcerecordid><originalsourceid>FETCH-LOGICAL-c383t-ed1b7e8938be4986e70e51249c94a536e5ae6b7cc84ee6f3d72de2f962a368d33</originalsourceid><addsrcrecordid>eNpdkDtLA0EUhQdRMEZrC5vFwm6TeT9KWXxBQIu1Hiazd3XiJhNndgn-ezckIFjd4nzncPkQuiZ4Rgg287qaUYz5jFAlqNEnaEKEUKUxQp6iCcZEl4ZxfI4ucl5hjCXFZoLYW9xBKt3OJSiy_4Rm6MLmo2hjKraQQmyCLxK4ruzDGore5a98ic5a12W4Ot4pen98qKvncvH69FLdL0rPNOtLaMhSgTZML4EbLUFhEIRy4w13gkkQDuRSea85gGxZo2gDtDWSOiZ1w9gU3R12tyl-D5B7uw7ZQ9e5DcQhW6qFYlzhEbz9B67ikDbjb1ZrTghhXI7Q_AD5FHNO0NptCmuXfizBdm_Q1pXdG7RHg2Pj5tAIAPBHH9NflvFrCQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>884111346</pqid></control><display><type>article</type><title>Power-aware scheduling for periodic real-time tasks</title><source>IEEE Xplore (Online service)</source><creator>Aydin, H. ; Melhem, R. ; Mosse, D. ; Mejia-Alvarez, P.</creator><creatorcontrib>Aydin, H. ; Melhem, R. ; Mosse, D. ; Mejia-Alvarez, P.</creatorcontrib><description>We address power-aware scheduling of periodic tasks to reduce CPU energy consumption in hard real-time systems through dynamic voltage scaling. Our intertask voltage scheduling solution includes three components: 1) a static (offline) solution to compute the optimal speed, assuming worst-case workload for each arrival, 2) an online speed reduction mechanism to reclaim energy by adapting to the actual workload, and 3) an online, adaptive and speculative speed adjustment mechanism to anticipate early completions of future executions by using the average-case workload information. All these solutions still guarantee that all deadlines are met. Our simulation results show that our reclaiming algorithm alone outperforms other recently proposed intertask voltage scheduling schemes. Our speculative techniques are shown to provide additional gains, approaching the theoretical lower-bound by a margin of 10 percent.</description><identifier>ISSN: 0018-9340</identifier><identifier>EISSN: 1557-9956</identifier><identifier>DOI: 10.1109/TC.2004.1275298</identifier><identifier>CODEN: ITCOB4</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Optimization methods ; Power demand ; Real time systems ; Scheduling</subject><ispartof>IEEE transactions on computers, 2004-05, Vol.53 (5), p.584-600</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2004</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c383t-ed1b7e8938be4986e70e51249c94a536e5ae6b7cc84ee6f3d72de2f962a368d33</citedby><cites>FETCH-LOGICAL-c383t-ed1b7e8938be4986e70e51249c94a536e5ae6b7cc84ee6f3d72de2f962a368d33</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1275298$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,54796</link.rule.ids></links><search><creatorcontrib>Aydin, H.</creatorcontrib><creatorcontrib>Melhem, R.</creatorcontrib><creatorcontrib>Mosse, D.</creatorcontrib><creatorcontrib>Mejia-Alvarez, P.</creatorcontrib><title>Power-aware scheduling for periodic real-time tasks</title><title>IEEE transactions on computers</title><addtitle>TC</addtitle><description>We address power-aware scheduling of periodic tasks to reduce CPU energy consumption in hard real-time systems through dynamic voltage scaling. Our intertask voltage scheduling solution includes three components: 1) a static (offline) solution to compute the optimal speed, assuming worst-case workload for each arrival, 2) an online speed reduction mechanism to reclaim energy by adapting to the actual workload, and 3) an online, adaptive and speculative speed adjustment mechanism to anticipate early completions of future executions by using the average-case workload information. All these solutions still guarantee that all deadlines are met. Our simulation results show that our reclaiming algorithm alone outperforms other recently proposed intertask voltage scheduling schemes. Our speculative techniques are shown to provide additional gains, approaching the theoretical lower-bound by a margin of 10 percent.</description><subject>Optimization methods</subject><subject>Power demand</subject><subject>Real time systems</subject><subject>Scheduling</subject><issn>0018-9340</issn><issn>1557-9956</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2004</creationdate><recordtype>article</recordtype><recordid>eNpdkDtLA0EUhQdRMEZrC5vFwm6TeT9KWXxBQIu1Hiazd3XiJhNndgn-ezckIFjd4nzncPkQuiZ4Rgg287qaUYz5jFAlqNEnaEKEUKUxQp6iCcZEl4ZxfI4ucl5hjCXFZoLYW9xBKt3OJSiy_4Rm6MLmo2hjKraQQmyCLxK4ruzDGore5a98ic5a12W4Ot4pen98qKvncvH69FLdL0rPNOtLaMhSgTZML4EbLUFhEIRy4w13gkkQDuRSea85gGxZo2gDtDWSOiZ1w9gU3R12tyl-D5B7uw7ZQ9e5DcQhW6qFYlzhEbz9B67ikDbjb1ZrTghhXI7Q_AD5FHNO0NptCmuXfizBdm_Q1pXdG7RHg2Pj5tAIAPBHH9NflvFrCQ</recordid><startdate>200405</startdate><enddate>200405</enddate><creator>Aydin, H.</creator><creator>Melhem, R.</creator><creator>Mosse, D.</creator><creator>Mejia-Alvarez, P.</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>200405</creationdate><title>Power-aware scheduling for periodic real-time tasks</title><author>Aydin, H. ; Melhem, R. ; Mosse, D. ; Mejia-Alvarez, P.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c383t-ed1b7e8938be4986e70e51249c94a536e5ae6b7cc84ee6f3d72de2f962a368d33</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Optimization methods</topic><topic>Power demand</topic><topic>Real time systems</topic><topic>Scheduling</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Aydin, H.</creatorcontrib><creatorcontrib>Melhem, R.</creatorcontrib><creatorcontrib>Mosse, D.</creatorcontrib><creatorcontrib>Mejia-Alvarez, P.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 1998–Present</collection><collection>IEEE Electronic Library Online</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on computers</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Aydin, H.</au><au>Melhem, R.</au><au>Mosse, D.</au><au>Mejia-Alvarez, P.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Power-aware scheduling for periodic real-time tasks</atitle><jtitle>IEEE transactions on computers</jtitle><stitle>TC</stitle><date>2004-05</date><risdate>2004</risdate><volume>53</volume><issue>5</issue><spage>584</spage><epage>600</epage><pages>584-600</pages><issn>0018-9340</issn><eissn>1557-9956</eissn><coden>ITCOB4</coden><abstract>We address power-aware scheduling of periodic tasks to reduce CPU energy consumption in hard real-time systems through dynamic voltage scaling. Our intertask voltage scheduling solution includes three components: 1) a static (offline) solution to compute the optimal speed, assuming worst-case workload for each arrival, 2) an online speed reduction mechanism to reclaim energy by adapting to the actual workload, and 3) an online, adaptive and speculative speed adjustment mechanism to anticipate early completions of future executions by using the average-case workload information. All these solutions still guarantee that all deadlines are met. Our simulation results show that our reclaiming algorithm alone outperforms other recently proposed intertask voltage scheduling schemes. Our speculative techniques are shown to provide additional gains, approaching the theoretical lower-bound by a margin of 10 percent.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TC.2004.1275298</doi><tpages>17</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0018-9340
ispartof IEEE transactions on computers, 2004-05, Vol.53 (5), p.584-600
issn 0018-9340
1557-9956
language eng
recordid cdi_crossref_primary_10_1109_TC_2004_1275298
source IEEE Xplore (Online service)
subjects Optimization methods
Power demand
Real time systems
Scheduling
title Power-aware scheduling for periodic real-time tasks
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-21T13%3A21%3A13IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Power-aware%20scheduling%20for%20periodic%20real-time%20tasks&rft.jtitle=IEEE%20transactions%20on%20computers&rft.au=Aydin,%20H.&rft.date=2004-05&rft.volume=53&rft.issue=5&rft.spage=584&rft.epage=600&rft.pages=584-600&rft.issn=0018-9340&rft.eissn=1557-9956&rft.coden=ITCOB4&rft_id=info:doi/10.1109/TC.2004.1275298&rft_dat=%3Cproquest_cross%3E2428111011%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c383t-ed1b7e8938be4986e70e51249c94a536e5ae6b7cc84ee6f3d72de2f962a368d33%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=884111346&rft_id=info:pmid/&rft_ieee_id=1275298&rfr_iscdi=true