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
Issue Date2009
PublisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/tcs
Citation
Theoretical Computer Science, 2009, v. 410 n. 45, p. 4580-4587 How to Cite?
AbstractWe consider the setting of a device that obtains its energy from a battery and some regenerative source such as a solar cell. We 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 of the regenerative source. 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 show 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. © 2009 Elsevier B.V. All rights reserved.
Persistent Identifierhttp://hdl.handle.net/10722/152417
ISSN
2015 Impact Factor: 0.643
2015 SCImago Journal Rankings: 0.720
ISI Accession Number ID
Funding AgencyGrant Number
NSFCNS-0325353
CCF-0514058
IIS-0534531
Funding Information:

This paper was done when the second author was in University of Pittsburgh. The third author was supported in part by NSF grants CNS-0325353, CCF-0514058 and IIS-0534531.

References

 

DC FieldValueLanguage
dc.contributor.authorBansal, Nen_US
dc.contributor.authorChan, HLen_US
dc.contributor.authorPruhs, Ken_US
dc.date.accessioned2012-06-26T06:38:19Z-
dc.date.available2012-06-26T06:38:19Z-
dc.date.issued2009en_US
dc.identifier.citationTheoretical Computer Science, 2009, v. 410 n. 45, p. 4580-4587en_US
dc.identifier.issn0304-3975en_US
dc.identifier.urihttp://hdl.handle.net/10722/152417-
dc.description.abstractWe consider the setting of a device that obtains its energy from a battery and some regenerative source such as a solar cell. We 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 of the regenerative source. 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 show 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. © 2009 Elsevier B.V. All rights reserved.en_US
dc.languageengen_US
dc.publisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/tcsen_US
dc.relation.ispartofTheoretical Computer Scienceen_US
dc.subjectDeadline Schedulingen_US
dc.subjectEnergy Efficiencyen_US
dc.subjectSchedulingen_US
dc.subjectSolar Cellen_US
dc.titleSpeed scaling with a solar cellen_US
dc.typeArticleen_US
dc.identifier.emailChan, HL:hlchan@cs.hku.hken_US
dc.identifier.authorityChan, HL=rp01310en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1016/j.tcs.2009.07.004en_US
dc.identifier.scopuseid_2-s2.0-70349390753en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-70349390753&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume410en_US
dc.identifier.issue45en_US
dc.identifier.spage4580en_US
dc.identifier.epage4587en_US
dc.identifier.isiWOS:000271332200006-
dc.publisher.placeNetherlandsen_US
dc.identifier.scopusauthoridBansal, N=7102714084en_US
dc.identifier.scopusauthoridChan, HL=7403402384en_US
dc.identifier.scopusauthoridPruhs, K=6603866438en_US
dc.identifier.citeulike5274019-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats