File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/978-3-642-02927-1_55
- Scopus: eid_2-s2.0-70449095258
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Sleep with guilt and work faster to minimize flow plus energy
Title | Sleep with guilt and work faster to minimize flow plus energy |
---|---|
Authors | |
Keywords | Bounded-speed Maximum speed Multiple levels New model Non-clairvoyant algorithms |
Issue Date | 2009 |
Publisher | Springer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/ |
Citation | The 36th International Colloquium on Automata, Languages and Programming (ICALP 2009), Rhodes, Greece, 5-12 July 2009. In Lecture Notes in Computer Science, 2009, v. 5555, p. 665-676 How to Cite? |
Abstract | In this paper we extend the study of flow-energy scheduling to a model that allows both sleep management and speed scaling. Our main result is a sleep management algorithm called IdleLonger, which works online for a processor with one or multiple levels of sleep states. The design of IdleLonger is interesting; among others, it may force the processor to idle or even sleep even though new jobs have already arrived. IdleLonger works in both clairvoyant and non-clairvoyant settings. We show how to adapt two existing speed scaling algorithms AJC [15] (clairvoyant) and LAPS [9] (non-clairvoyant) to the new model. The adapted algorithms, when coupled with IdleLonger, are shown to be O(1)-competitive clairvoyant and non-clairvoyant algorithms for minimizing flow plus energy on a processor that allows sleep management and speed scaling. The above results are based on the traditional model with no limit on processor speed. If the processor has a maximum speed, the problem becomes more difficult as the processor, once overslept, cannot rely on unlimited extra speed to catch up the delay. Nevertheless, we are able to enhance IdleLonger and AJC so that they remain O(1)-competitive for flow plus energy under the bounded speed model. Non-clairvoyant scheduling in the bounded speed model is left as an open problem. © 2009 Springer Berlin Heidelberg. |
Description | LNCS v. 5555 is Proceedings of the 36th International Colloquium, ICALP 2009 Session A3 - Scheduling |
Persistent Identifier | http://hdl.handle.net/10722/93390 |
ISSN | 2023 SCImago Journal Rankings: 0.606 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lam, TW | en_HK |
dc.contributor.author | Lee, LK | en_HK |
dc.contributor.author | Ting, HF | en_HK |
dc.contributor.author | To, IKK | en_HK |
dc.contributor.author | Wong, PWH | en_HK |
dc.date.accessioned | 2010-09-25T14:59:38Z | - |
dc.date.available | 2010-09-25T14:59:38Z | - |
dc.date.issued | 2009 | en_HK |
dc.identifier.citation | The 36th International Colloquium on Automata, Languages and Programming (ICALP 2009), Rhodes, Greece, 5-12 July 2009. In Lecture Notes in Computer Science, 2009, v. 5555, p. 665-676 | en_HK |
dc.identifier.issn | 0302-9743 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/93390 | - |
dc.description | LNCS v. 5555 is Proceedings of the 36th International Colloquium, ICALP 2009 | - |
dc.description | Session A3 - Scheduling | - |
dc.description.abstract | In this paper we extend the study of flow-energy scheduling to a model that allows both sleep management and speed scaling. Our main result is a sleep management algorithm called IdleLonger, which works online for a processor with one or multiple levels of sleep states. The design of IdleLonger is interesting; among others, it may force the processor to idle or even sleep even though new jobs have already arrived. IdleLonger works in both clairvoyant and non-clairvoyant settings. We show how to adapt two existing speed scaling algorithms AJC [15] (clairvoyant) and LAPS [9] (non-clairvoyant) to the new model. The adapted algorithms, when coupled with IdleLonger, are shown to be O(1)-competitive clairvoyant and non-clairvoyant algorithms for minimizing flow plus energy on a processor that allows sleep management and speed scaling. The above results are based on the traditional model with no limit on processor speed. If the processor has a maximum speed, the problem becomes more difficult as the processor, once overslept, cannot rely on unlimited extra speed to catch up the delay. Nevertheless, we are able to enhance IdleLonger and AJC so that they remain O(1)-competitive for flow plus energy under the bounded speed model. Non-clairvoyant scheduling in the bounded speed model is left as an open problem. © 2009 Springer Berlin Heidelberg. | en_HK |
dc.language | eng | en_HK |
dc.publisher | Springer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/ | en_HK |
dc.relation.ispartof | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | en_HK |
dc.rights | The original publication is available at www.springerlink.com | - |
dc.subject | Bounded-speed | - |
dc.subject | Maximum speed | - |
dc.subject | Multiple levels | - |
dc.subject | New model | - |
dc.subject | Non-clairvoyant algorithms | - |
dc.title | Sleep with guilt and work faster to minimize flow plus energy | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.email | Lam, TW: hresltk@hkucc.hku.hk | en_HK |
dc.identifier.email | Lee, LK: lklee@cs.hku.hk | en_HK |
dc.identifier.email | Ting, HF: hfting@cs.hku.hk | en_HK |
dc.identifier.authority | Lam, TW=rp00135 | en_HK |
dc.identifier.authority | Lee, LK=rp00140 | en_HK |
dc.identifier.authority | Ting, HF=rp00177 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1007/978-3-642-02927-1_55 | en_HK |
dc.identifier.scopus | eid_2-s2.0-70449095258 | en_HK |
dc.identifier.hkuros | 162181 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-70449095258&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 5555 LNCS | en_HK |
dc.identifier.issue | PART 1 | en_HK |
dc.identifier.spage | 665 | en_HK |
dc.identifier.epage | 676 | en_HK |
dc.publisher.place | Germany | en_HK |
dc.description.other | The 36th International Colloquium on Automata, Languages and Programming (ICALP 2009), Rhodes, Greece, 5-12 July 2009. In Lecture Notes in Computer Science, 2009, v. 5555, p. 665-676 | - |
dc.identifier.scopusauthorid | Lam, TW=7202523165 | en_HK |
dc.identifier.scopusauthorid | Lee, LK=12646190100 | en_HK |
dc.identifier.scopusauthorid | Ting, HF=7005654198 | en_HK |
dc.identifier.scopusauthorid | To, IKK=23398547200 | en_HK |
dc.identifier.scopusauthorid | Wong, PWH=9734871500 | en_HK |
dc.identifier.issnl | 0302-9743 | - |