IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v19y2016i6d10.1007_s10951-015-0452-y.html
   My bibliography  Save this article

Throughput maximization for speed scaling with agreeable deadlines

Author

Listed:
  • Eric Angel

    (Université d’Evry Val d’Essonne)

  • Evripidis Bampis

    (LIP6, Université Pierre et Marie Curie)

  • Vincent Chau

    (City University of Hong Kong)

  • Dimitrios Letsios

    (Technische Universität München)

Abstract

We study the following energy-efficient scheduling problem. We are given a set of n jobs which have to be scheduled by a single processor whose speed can be varied dynamically. Each job $$J_j$$ J j is characterized by a processing requirement (work) $$p_j$$ p j , a release date $$r_j$$ r j , and a deadline $$d_j$$ d j . We are also given a budget of energy E which must not be exceeded and our objective is to maximize the throughput (i.e., the number of jobs which are completed on time). We show that the problem can be solved optimally via dynamic programming in $$O(n^4 \log n \log P)$$ O ( n 4 log n log P ) time when all jobs have the same release date, where P is the sum of the processing requirements of the jobs. For the more general case with agreeable deadlines where the jobs can be ordered so that, for every $$i

Suggested Citation

  • Eric Angel & Evripidis Bampis & Vincent Chau & Dimitrios Letsios, 2016. "Throughput maximization for speed scaling with agreeable deadlines," Journal of Scheduling, Springer, vol. 19(6), pages 619-625, December.
    • Handle: RePEc:spr:jsched:v:19:y:2016:i:6:d:10.1007_s10951-015-0452-y
    DOI: 10.1007/s10951-015-0452-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-015-0452-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10951-015-0452-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jsched:v:19:y:2016:i:6:d:10.1007_s10951-015-0452-y. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.