IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v11y2006i3d10.1007_s10878-006-7910-6.html
   My bibliography  Save this article

Min-energy voltage allocation for tree-structured tasks

Author

Listed:
  • Minming Li

    (Tsinghua University)

  • Becky Jie Liu

    (City University of Hong Kong)

  • Frances F. Yao

    (City University of Hong Kong)

Abstract

We study job scheduling on processors capable of running at variable voltage/speed to minimize energy consumption. Each job in a problem instance is specified by its arrival time and deadline, together with required number of CPU cycles. It is known that the minimum energy schedule for n jobs can be computed in O(n3) time, assuming a convex energy function. We investigate more efficient algorithms for computing the optimal schedule when the job sets have certain special structures. When the time intervals are structured as trees, the minimum energy schedule is shown to have a succinct characterization and is computable in time O(P) where P is the tree’s total path length. We also study an on-line average-rate heuristics AVR and prove that its energy consumption achieves a small constant competitive ratio for nested job sets and for job sets with limited overlap. Some simulation results are also given.

Suggested Citation

  • Minming Li & Becky Jie Liu & Frances F. Yao, 2006. "Min-energy voltage allocation for tree-structured tasks," Journal of Combinatorial Optimization, Springer, vol. 11(3), pages 305-319, May.
    • Handle: RePEc:spr:jcomop:v:11:y:2006:i:3:d:10.1007_s10878-006-7910-6
    DOI: 10.1007/s10878-006-7910-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-006-7910-6
    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/s10878-006-7910-6?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:jcomop:v:11:y:2006:i:3:d:10.1007_s10878-006-7910-6. 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.