File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/978-3-642-15775-2_3
- Scopus: eid_2-s2.0-78249245096
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Non-clairvoyant speed scaling for weighted flow time
Title | Non-clairvoyant speed scaling for weighted flow time |
---|---|
Authors | |
Keywords | At-speed Competitive algorithms Energy efficient Flow-time Job scheduling |
Issue Date | 2010 |
Publisher | Springer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/ |
Citation | The 18th Annual European Symposium on Algorithms (ESA 2010), Liverpool, UK., 6-8 September 2010. In Lecture Notes In Computer Science, 2010, v. 6346 pt. 1, p. 23-35 How to Cite? |
Abstract | We study online job scheduling on a processor that can vary its speed dynamically to manage its power. We attempt to extend the recent success in analyzing total unweighted flow time plus energy to total weighted flow time plus energy. We first consider the non-clairvoyant setting where the size of a job is only known when the job finishes. We show an online algorithm WLAPS that is 8α2-competitive for weighted flow time plus energy under the traditional power model, which assumes the power P(s) to run the processor at speed s to be sα for some α > 1. More interestingly, for any arbitrary power function P(s), WLAPS remains competitive when given a more energy-efficient processor; precisely, WLAPS is 16(1 + 1/ε) 2-competitive when using a processor that, given the power P(s), can run at speed (1 + ε)s for some ε > 0. Without such speedup, no non-clairvoyant algorithm can be O(1)-competitive for an arbitrary power function [8]. For the clairvoyant setting (where the size of a job is known at release time), previous results on minimizing weighted flow time plus energy rely on scaling the speed continuously over time [5-7]. The analysis of WLAPS has inspired us to devise a clairvoyant algorithm LLB which can transform any continuous speed scaling algorithm to one that scales the speed at discrete times only. Under an arbitrary power function, LLB can give an 4(1 + 1/ε)-competitive algorithm using a processor with (1 + ε)-speedup. © 2010 Springer-Verlag. |
Description | LNCS v. 6346 has title: Algorithms - ESA 2010: 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010: Proceedings |
Persistent Identifier | http://hdl.handle.net/10722/129559 |
ISSN | 2023 SCImago Journal Rankings: 0.606 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chan, SH | en_HK |
dc.contributor.author | Lam, TW | en_HK |
dc.contributor.author | Lee, LK | en_HK |
dc.date.accessioned | 2010-12-23T08:39:16Z | - |
dc.date.available | 2010-12-23T08:39:16Z | - |
dc.date.issued | 2010 | en_HK |
dc.identifier.citation | The 18th Annual European Symposium on Algorithms (ESA 2010), Liverpool, UK., 6-8 September 2010. In Lecture Notes In Computer Science, 2010, v. 6346 pt. 1, p. 23-35 | en_HK |
dc.identifier.issn | 0302-9743 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/129559 | - |
dc.description | LNCS v. 6346 has title: Algorithms - ESA 2010: 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010: Proceedings | - |
dc.description.abstract | We study online job scheduling on a processor that can vary its speed dynamically to manage its power. We attempt to extend the recent success in analyzing total unweighted flow time plus energy to total weighted flow time plus energy. We first consider the non-clairvoyant setting where the size of a job is only known when the job finishes. We show an online algorithm WLAPS that is 8α2-competitive for weighted flow time plus energy under the traditional power model, which assumes the power P(s) to run the processor at speed s to be sα for some α > 1. More interestingly, for any arbitrary power function P(s), WLAPS remains competitive when given a more energy-efficient processor; precisely, WLAPS is 16(1 + 1/ε) 2-competitive when using a processor that, given the power P(s), can run at speed (1 + ε)s for some ε > 0. Without such speedup, no non-clairvoyant algorithm can be O(1)-competitive for an arbitrary power function [8]. For the clairvoyant setting (where the size of a job is known at release time), previous results on minimizing weighted flow time plus energy rely on scaling the speed continuously over time [5-7]. The analysis of WLAPS has inspired us to devise a clairvoyant algorithm LLB which can transform any continuous speed scaling algorithm to one that scales the speed at discrete times only. Under an arbitrary power function, LLB can give an 4(1 + 1/ε)-competitive algorithm using a processor with (1 + ε)-speedup. © 2010 Springer-Verlag. | en_HK |
dc.language | eng | en_US |
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 | en_US |
dc.subject | At-speed | - |
dc.subject | Competitive algorithms | - |
dc.subject | Energy efficient | - |
dc.subject | Flow-time | - |
dc.subject | Job scheduling | - |
dc.title | Non-clairvoyant speed scaling for weighted flow time | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.openurl | http://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0302-9743&volume=6346 &issue=pt. 1&spage=23&epage=35&date=2010&atitle=Non-clairvoyant+speed+scaling+for+weighted+flow+time | - |
dc.identifier.email | Lam, TW: hresltk@hkucc.hku.hk | en_HK |
dc.identifier.email | Lee, LK: lklee@cs.hku.hk | en_HK |
dc.identifier.authority | Lam, TW=rp00135 | en_HK |
dc.identifier.authority | Lee, LK=rp00140 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1007/978-3-642-15775-2_3 | en_HK |
dc.identifier.scopus | eid_2-s2.0-78249245096 | en_HK |
dc.identifier.hkuros | 177022 | en_US |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-78249245096&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 6346 LNCS | en_HK |
dc.identifier.issue | PART 1 | en_HK |
dc.identifier.spage | 23 | en_HK |
dc.identifier.epage | 35 | en_HK |
dc.publisher.place | Germany | en_HK |
dc.description.other | The 18th Annual European Symposium on Algorithms (ESA 2010), Liverpool, UK., 6-8 September 2010. In Lecture Notes In Computer Science, 2010, v. 6346 pt. 1, p. 23-35 | - |
dc.identifier.scopusauthorid | Chan, SH=36652336600 | en_HK |
dc.identifier.scopusauthorid | Lam, TW=7202523165 | en_HK |
dc.identifier.scopusauthorid | Lee, LK=12646190100 | en_HK |
dc.identifier.issnl | 0302-9743 | - |