File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Sleep management on multiple machines for energy and flow time

TitleSleep management on multiple machines for energy and flow time
Authors
Issue Date2011
PublisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/
Citation
The 38th International Colloquium on Automata, Languages and Programming (ICALP 2011), Zurich, Switzerland, 4-8 July 2011. In Lecture Notes in Computer Science, 2011, v. 6755 pt. 1, p. 219-231 How to Cite?
AbstractIn large data centers, determining the right number of operating machines is often non-trivial, especially when the workload is unpredictable. Using too many machines would waste energy, while using too few would affect the performance. This paper extends the traditional study of online flow-time scheduling on multiple machines to take sleep management and energy into consideration. Specifically, we study online algorithms that can determine dynamically when and which subset of machines should wake up (or sleep), and how jobs are dispatched and scheduled. We consider schedules whose objective is to minimize the sum of flow time and energy, and obtain O(1)-competitive algorithms for two settings: one assumes machines running at a fixed speed, and the other allows dynamic speed scaling to further optimize energy usage. Like the previous work on the tradeoff between flow time and energy, the analysis of our algorithms is based on potential functions. What is new here is that the online and offline algorithms would use different subsets of machines at different times, and we need a more general potential analysis that can consider different match-up of machines. © 2011 Springer-Verlag.
DescriptionLNCS v. 6755 has title: Automata, languages and programming: 38th international colloquium, ICALP 2011 ... proceedings
Persistent Identifierhttp://hdl.handle.net/10722/139978
ISBN
ISSN
2005 Impact Factor: 0.402
2015 SCImago Journal Rankings: 0.252
References

 

DC FieldValueLanguage
dc.contributor.authorChan, SHen_HK
dc.contributor.authorLam, TWen_HK
dc.contributor.authorLee, LKen_HK
dc.contributor.authorLiu, CMen_HK
dc.contributor.authorTing, HFen_HK
dc.date.accessioned2011-09-23T06:04:18Z-
dc.date.available2011-09-23T06:04:18Z-
dc.date.issued2011en_HK
dc.identifier.citationThe 38th International Colloquium on Automata, Languages and Programming (ICALP 2011), Zurich, Switzerland, 4-8 July 2011. In Lecture Notes in Computer Science, 2011, v. 6755 pt. 1, p. 219-231en_HK
dc.identifier.isbn978-3-642-22005-0en_US
dc.identifier.issn0302-9743en_HK
dc.identifier.urihttp://hdl.handle.net/10722/139978-
dc.descriptionLNCS v. 6755 has title: Automata, languages and programming: 38th international colloquium, ICALP 2011 ... proceedings-
dc.description.abstractIn large data centers, determining the right number of operating machines is often non-trivial, especially when the workload is unpredictable. Using too many machines would waste energy, while using too few would affect the performance. This paper extends the traditional study of online flow-time scheduling on multiple machines to take sleep management and energy into consideration. Specifically, we study online algorithms that can determine dynamically when and which subset of machines should wake up (or sleep), and how jobs are dispatched and scheduled. We consider schedules whose objective is to minimize the sum of flow time and energy, and obtain O(1)-competitive algorithms for two settings: one assumes machines running at a fixed speed, and the other allows dynamic speed scaling to further optimize energy usage. Like the previous work on the tradeoff between flow time and energy, the analysis of our algorithms is based on potential functions. What is new here is that the online and offline algorithms would use different subsets of machines at different times, and we need a more general potential analysis that can consider different match-up of machines. © 2011 Springer-Verlag.en_HK
dc.languageengen_US
dc.publisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/en_HK
dc.relation.ispartofLecture Notes in Computer Scienceen_HK
dc.rightsThe original publication is available at www.springerlink.comen_US
dc.titleSleep management on multiple machines for energy and flow timeen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=978-3-642-22005-0&volume=LNCS 6755&spage=219 &epage= 231&date=2011&atitle=Sleep+Management+on+Multiple+Machines+for+Energy+and+Flow+Timeen_US
dc.identifier.emailChan, SH: bhchan@hku.hken_HK
dc.identifier.emailLam, TW: hresltk@hkucc.hku.hken_HK
dc.identifier.emailLee, LK: lklee@cs.hku.hken_HK
dc.identifier.emailLiu, CM: h0389343@hku.hk-
dc.identifier.emailTing, HF: hfting@cs.hku.hk-
dc.identifier.authorityLam, TW=rp00135en_HK
dc.identifier.authorityLee, LK=rp00140en_HK
dc.identifier.authorityTing, HF=rp00177en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1007/978-3-642-22006-7_19en_HK
dc.identifier.scopuseid_2-s2.0-79959977898en_HK
dc.identifier.hkuros192196en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-79959977898&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume6755en_HK
dc.identifier.issuept. 1en_HK
dc.identifier.spage219en_HK
dc.identifier.epage231en_HK
dc.publisher.placeGermanyen_HK
dc.identifier.scopusauthoridTing, HF=7005654198en_HK
dc.identifier.scopusauthoridLiu, CM=36918796000en_HK
dc.identifier.scopusauthoridLee, LK=12646190100en_HK
dc.identifier.scopusauthoridLam, TW=7202523165en_HK
dc.identifier.scopusauthoridChan, SH=36652336600en_HK
dc.customcontrol.immutablesml 130327-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats