IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v23y2020i6d10.1007_s10951-020-00653-8.html
   My bibliography  Save this article

Approximation algorithms for energy-efficient scheduling of parallel jobs

Author

Listed:
  • Alexander Kononov

    (Sobolev Institute of Mathematics SB RAS)

  • Yulia Kovalenko

    (Sobolev Institute of Mathematics SB RAS, Omsk Department)

Abstract

In this paper, we consider the homogeneous scheduling on speed-scalable processors, where the energy consumption is minimized. While most previous works have studied single-processor jobs, we focus on rigid parallel jobs, using more than one processor at the same time. Each job is specified by release date, deadline, processing volume and the number of required processors. Firstly, we develop constant-factor approximation algorithms for such interesting cases as agreeable jobs without migration and preemptive instances. Next, we propose a configuration linear program, which allows us to obtain an “almost exact” solution for the preemptive setting. Finally, in the case of non-preemptive agreeable jobs with unit-work operations, we present a three-approximation algorithm by generalization of the known exact algorithm for single-processor jobs.

Suggested Citation

  • Alexander Kononov & Yulia Kovalenko, 2020. "Approximation algorithms for energy-efficient scheduling of parallel jobs," Journal of Scheduling, Springer, vol. 23(6), pages 693-709, December.
  • Handle: RePEc:spr:jsched:v:23:y:2020:i:6:d:10.1007_s10951-020-00653-8
    DOI: 10.1007/s10951-020-00653-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-020-00653-8
    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-020-00653-8?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.

    References listed on IDEAS

    as
    1. Marco E. T. Gerards & Johann L. Hurink & Philip K. F. Hölzenspies, 2016. "A survey of offline algorithms for energy minimization under deadline constraints," Journal of Scheduling, Springer, vol. 19(1), pages 3-19, February.
    2. Akiyoshi Shioura & Natalia V. Shakhlevich & Vitaly A. Strusevich, 2017. "Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints," INFORMS Journal on Computing, INFORMS, vol. 29(4), pages 724-736, November.
    3. Evripidis Bampis & Alexander Kononov & Dimitrios Letsios & Giorgio Lucarelli & Maxim Sviridenko, 2018. "Energy-efficient scheduling and routing via randomized rounding," Journal of Scheduling, Springer, vol. 21(1), pages 35-51, February.
    4. Eric Angel & Evripidis Bampis & Fadi Kacem & Dimitrios Letsios, 2019. "Speed scaling on parallel processors with migration," Journal of Combinatorial Optimization, Springer, vol. 37(4), pages 1266-1282, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Alexander Kononov & Yulia Zakharova, 2022. "Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion," Journal of Global Optimization, Springer, vol. 83(3), pages 539-564, July.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Alexander Kononov & Yulia Zakharova, 2022. "Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion," Journal of Global Optimization, Springer, vol. 83(3), pages 539-564, July.
    2. Martijn H. H. Schoot Uiterkamp & Marco E. T. Gerards & Johann L. Hurink, 2022. "On a Reduction for a Class of Resource Allocation Problems," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1387-1402, May.
    3. Akiyoshi Shioura & Natalia V. Shakhlevich & Vitaly A. Strusevich & Bernhard Primas, 2018. "Models and algorithms for energy-efficient scheduling with immediate start of jobs," Journal of Scheduling, Springer, vol. 21(5), pages 505-516, October.
    4. Evripidis Bampis & Alexander Kononov & Dimitrios Letsios & Giorgio Lucarelli & Maxim Sviridenko, 2018. "Energy-efficient scheduling and routing via randomized rounding," Journal of Scheduling, Springer, vol. 21(1), pages 35-51, February.
    5. Schoot Uiterkamp, Martijn H.H., 2024. "A characterization of simultaneous optimization, majorization, and (bi)submodular polyhedra," Other publications TiSEM 59cc86d9-0a5d-4a7d-b47c-d, Tilburg University, School of Economics and Management.
    6. Wei, Wei & Li, Haoyi & Zhang, Qinghui, 2023. "Bidirectional pruned tree-based efficient minimum cut acceleration in dense graph," Chaos, Solitons & Fractals, Elsevier, vol. 175(P2).

    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:23:y:2020:i:6:d:10.1007_s10951-020-00653-8. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.