Show simple item record

dc.contributor.authorDemaine, Erik D.
dc.contributor.authorGhodsi, Mohammad
dc.contributor.authorHajiaghayi, Mohammad Taghi
dc.contributor.authorSayedi-Roshkhar, Amin S.
dc.contributor.authorZadimoghaddam, Morteza
dc.date.accessioned2014-04-23T20:03:29Z
dc.date.available2014-04-23T20:03:29Z
dc.date.issued2013-01
dc.date.submitted2010-06
dc.identifier.issn1094-6136
dc.identifier.issn1099-1425
dc.identifier.urihttp://hdl.handle.net/1721.1/86224
dc.description.abstractThis paper considers scheduling tasks while minimizing the power consumption of one or more processors, each of which can go to sleep at a fixed cost α . There are two natural versions of this problem, both considered extensively in recent work: minimize the total power consumption (including computation time), or minimize the number of “gaps” in execution. For both versions in a multiprocessor system, we develop a polynomial-time algorithm based on sophisticated dynamic programming. In a generalization of the power-saving problem, where each task can execute in any of a specified set of time intervals, we develop a (1+23α) -approximation, and show that dependence on α is necessary. In contrast, the analogous multi-interval gap scheduling problem is set-cover hard (and thus not o(lgn) -approximable), even in the special cases of just two intervals per job or just three unit intervals per job. We also prove several other hardness-of-approximation results. Finally, we give an O(n√) -approximation for maximizing throughput given a hard upper bound on the number of gaps.en_US
dc.description.sponsorshipInstitute for Research in Fundamental Sciences (Iran) (Grant Number CS1385-2-01)en_US
dc.description.sponsorshipInstitute for Research in Fundamental Sciences (Iran) (Grant Number CS1384-6-01)en_US
dc.language.isoen_US
dc.publisherSpringer-Verlag Berlin Heidelbergen_US
dc.relation.isversionofhttp://dx.doi.org/10.1007/s10951-012-0309-6en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourceMIT web domainen_US
dc.titleScheduling to minimize gaps and power consumptionen_US
dc.typeArticleen_US
dc.identifier.citationDemaine, Erik D., Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Amin S. Sayedi-Roshkhar, and Morteza Zadimoghaddam. “Scheduling to Minimize Gaps and Power Consumption.” Journal of Scheduling 16, no. 2 (April 2013): 151–160.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratoryen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.mitauthorDemaine, Erik D.en_US
dc.contributor.mitauthorZadimoghaddam, Mortezaen_US
dc.contributor.mitauthorHajiaghayi, Mohammad Taghien_US
dc.relation.journalJournal of Schedulingen_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dspace.orderedauthorsDemaine, Erik D.; Ghodsi, Mohammad; Hajiaghayi, MohammadTaghi; Sayedi-Roshkhar, Amin S.; Zadimoghaddam, Mortezaen_US
dc.identifier.orcidhttps://orcid.org/0000-0003-3803-5703
dspace.mitauthor.errortrue
mit.licenseOPEN_ACCESS_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record