File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Speed scaling with a solar cell

TitleSpeed scaling with a solar cell
Authors
KeywordsDeadline scheduling
Energy efficiency
Scheduling
Solar cell
Convex programs
Issue Date2008
PublisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/
Citation
Lecture Notes In Computer Science (Including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics), 2008, v. 5034 LNCS, p. 15-26 How to Cite?
AbstractWe consider the speed scaling problem of scheduling a collection of tasks with release times, deadlines, and sizes so as to minimize the energy recharge rate. This is the first theoretical investigation of speed scaling for devices with a regenerative energy source. We show that the problem can be expressed as a polynomial sized convex program. We that using the KKT conditions, one can obtain an efficient algorithm to verify the optimality of a schedule. We show that the energy optimal YDS schedule, is 2-approximate with respect to the recharge rate. We show that the online algorithm BKP is O(1)-competitive with respect to recharge rate. © 2008 Springer-Verlag Berlin Heidelberg.
Persistent Identifierhttp://hdl.handle.net/10722/92631
ISSN
2005 Impact Factor: 0.402
2015 SCImago Journal Rankings: 0.252
References

 

DC FieldValueLanguage
dc.contributor.authorBansal, Nen_HK
dc.contributor.authorChan, HLen_HK
dc.contributor.authorPruhs, Ken_HK
dc.date.accessioned2010-09-17T10:52:28Z-
dc.date.available2010-09-17T10:52:28Z-
dc.date.issued2008en_HK
dc.identifier.citationLecture Notes In Computer Science (Including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics), 2008, v. 5034 LNCS, p. 15-26en_HK
dc.identifier.issn0302-9743en_HK
dc.identifier.urihttp://hdl.handle.net/10722/92631-
dc.description.abstractWe consider the speed scaling problem of scheduling a collection of tasks with release times, deadlines, and sizes so as to minimize the energy recharge rate. This is the first theoretical investigation of speed scaling for devices with a regenerative energy source. We show that the problem can be expressed as a polynomial sized convex program. We that using the KKT conditions, one can obtain an efficient algorithm to verify the optimality of a schedule. We show that the energy optimal YDS schedule, is 2-approximate with respect to the recharge rate. We show that the online algorithm BKP is O(1)-competitive with respect to recharge rate. © 2008 Springer-Verlag Berlin Heidelberg.en_HK
dc.languageengen_HK
dc.publisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/en_HK
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)en_HK
dc.subjectDeadline schedulingen_HK
dc.subjectEnergy efficiencyen_HK
dc.subjectSchedulingen_HK
dc.subjectSolar cellen_HK
dc.subjectConvex programs-
dc.titleSpeed scaling with a solar cellen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0304-3975&volume=410&issue=45&spage=4580&epage=4587&date=2009&atitle=Speed+scaling+with+a+solar+cell-
dc.identifier.emailChan, HL:hlchan@cs.hku.hken_HK
dc.identifier.authorityChan, HL=rp01310en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1007/978-3-540-68880-8_4en_HK
dc.identifier.scopuseid_2-s2.0-48249091999en_HK
dc.identifier.hkuros181813-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-48249091999&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume5034 LNCSen_HK
dc.identifier.issue45en_HK
dc.identifier.spage15en_HK
dc.identifier.epage26en_HK
dc.publisher.placeGermanyen_HK
dc.identifier.scopusauthoridBansal, N=7102714084en_HK
dc.identifier.scopusauthoridChan, HL=7403402384en_HK
dc.identifier.scopusauthoridPruhs, K=6603866438en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats