research-article

Competitive non-migratory scheduling for flow time and energy

Authors:

Isaac K. K. To, and

Prudence W. H. WongAuthors Info & Claims

SPAA '08: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures

June 2008

Pages 256 - 264

https://doi.org/10.1145/1378533.1378580

Published: 14 June 2008 Publication History

Abstract

Energy usage has been an important concern in recent research on online scheduling. In this paper we extend the study of the tradeoff between flow time and energy from the single-processor setting [8, 6] to the multi-processor setting. Our main result is an analysis of a simple non-migratory online algorithm called CRR (classified round robin) on m ≥ 2 processors, showing that its flow time plus energy is within O(1) times of the optimal non-migratory offline algorithm, when the maximum allowable speed is slightly relaxed. This result still holds even if the comparison is made against the optimal migratory offline algorithm (the competitive ratio increases by a factor of 2.5). As a special case, our work also contributes to the traditional online flow-time scheduling. Specifically, for minimizing flow time only, CRR can yield a competitive ratio one or even arbitrarily smaller than one, when using sufficiently faster processors. Prior to our work, similar result is only known for online algorithms that needs migration [21, 23], while the best non-migratory result can achieve an O(1) competitive ratio [14].

The above result stems from an interesting observation that there always exists some optimal migratory schedule S that can be converted (in an offline sense) to a non-migratory schedule S' with a moderate increase in flow time plus energy. More importantly, this non-migratory schedule always dispatches jobs in the same way as CRR.

References

[1]

S. Albers, and H. Fujiwara. Energy-efficient algorithms for flow time minimization. ACM Trans. Alg., 3(4):49, 2007.

Digital Library

[2]

S. Albers, F. Muller, and S. Schmelzer. Speed Scaling on parallel processors. In Proc. SPAA, pages 289--298, 2007.

Digital Library

[3]

J. Augustine, S. Irani, and C. Swany. Optimal power-down strategies. In Proc. FOCS, pages 530--539, 2004.

Digital Library

[4]

N. Avrahami, and Y. Azar. Minimizing total flow time and total completion time with immediate dispatching. In Proc. SPAA, pages 11--18, 2003.

Digital Library

[5]

B. Awerbuch, Y. Azar, S. Leonardi, and O. Regev. Minimizing the flow time without migration. SIAM J. on Comput., 31(5):1370--1382, 2002.

Digital Library

[6]

N. Bansal, H. L. Chan, T. W. Lam, and L. K. Lee. Scheduling for speed bounded processors. To appear in Proc. ICALP, 2008.

Digital Library

[7]

N. Bansal, T. Kimbrel, and K. Pruhs. Dynamic speed scaling to manage energy and temperature. In Proc. FOCS, pages 520-5-5-529, 2004.

Digital Library

[8]

N. Bansal, K. Pruhs and C. Stein. Speed scaling for weighted flow time. In Proc. SODA, pages 805--813, 2007.

Digital Library

[9]

D. M. Brooks, P. Bose, S.E. Schuster, H. Jacobson, P.N. Kudva, A. Buyuktosunoglu, J. D. Wellman, V. Zyuban, M. Gupta, and P. W. Cook. Power-aware microarchitecture: Design and modeling challenges for next-generation microprocessors. IEEE Micro, 20(6):26--44, 2000.

Digital Library

[10]

D. P. Bunde. Power-aware scheduling for makespan and flow. In Proc. SPAA, pages 190--196, 2006.

Digital Library

[11]

H. L. Chan, W. T. Chan, T. W. Lam, L. K. Lee, K. S. Mak, and P. W. H. Wong. Energy efficient online deadline scheduling. In Proc. SODA, pages 795--804, 2007.

Digital Library

[12]

H. L Chan, T. W. Lam and K. K. To. Nonmigratory online deadline scheduling on multiprocessors. SIAM J. on Comput., 34(3):669--682, 2005.

Digital Library

[13]

C. Chekuri, S. Khanna, and A. Zhu. Algorithms for minimizing weighted flow time. In Proc. STOC, pages 84--93, 2001.

Digital Library

[14]

C. Chekuri, A. Goel, S. Khanna, and A. Kumar. Multi-processor scheduling to minimize flow time with ε resource augmentation. In Proc. STOC, pages 363--372, 2004.

Digital Library

[15]

D. Grunwald, P. Levis, K. I. Farkas, C. B. Morrey, and M. Neufeld. Policies for dynamic clock scheduling. In Proc. OSDI, pages 73--86, 2000.

Digital Library

[16]

S. Irani, R. K. Gupta, and S. Shukla. Algorithms for power savings. In Proc. SODA, pages 37--46, 2003.

Digital Library

[17]

S. Irani and K. Pruhs. Algorithmic problems in power management. SIGACT News, 32(2):63--76, 2005.

Digital Library

[18]

B. Kalyanasundaram and K. Pruhs. Eliminating migration in multi-processor scheduling. J. Alg., 38:2--24, 2001.

Digital Library

[19]

S. Leonardi, and D. Raz. Approximating total flow time on parallel machines. In Proc. STOC, pages 110--119, 1997.

Digital Library

[20]

M. Li, B. J. Liu, and F. F. Yao. Min-energy voltage allocations for tree-structured tasks. In Proc. COCOON, pages 283--296, 2005.

Digital Library

[21]

J. McCullough and E. Torng. SRPT optimally utilizes faster machines to minimize flow time. In Proc. SODA, pages 350--358, 2004.

Digital Library

[22]

T. Mudge. Power: A first-class architectural design constraint. Computer, 34(4):52--58, 2001.

Digital Library

[23]

C. A. Phillips, C. Stein, E. Torng, and J. Wein. Optimal time-critical scheduling via resource augmentation. In STOC, pages 140--149, 1997.

Digital Library

[24]

P. Pillai and K. G. Shin. Real-time dynamic voltage scaling for low-power embedded operating systems. In Proc. SOSP, pages 89--102, 2001.

Digital Library

[25]

K. Pruhs, J. Sgall, and E. Torng. Online scheduling. In J. Leung, editor, Handbook of Scheduling: Algorithms, Models and Performance Analysis, pages 15--1--15-41. CRC Press, 2004.

[26]

K. Pruhs, R. van Stee, and P. Uthaisombut. Speed scaling of tasks with precedence constraints. In Proc. WAOA, pages 307--319, 2005.

Digital Library

[27]

K. Pruhs, P. Uthaisombut, and G. Woeginger. Getting the best response for your erg. In Proc. SWAT, pages 14--25, 2004.

[28]

M. Weiser, B. Welch, A. Demers, and S. Shenker. Scheduling for reduced CPU energy. In Proc. OSDI, pages 13--23, 1994.

Digital Library

[29]

F. Yao, A. Demers, and S. Shenker. A scheduling model for reduced CPU energy. In Proc. FOCS, pages 374--382, 1995.

Digital Library

Cited By

Vaze RNair J(2022)Speed Scaling on Parallel Servers With MapReduce Type Precedence ConstraintsIEEE/ACM Transactions on Networking10.1109/TNET.2022.314209130:4(1509-1524)Online publication date: Aug-2022
https://doi.org/10.1109/TNET.2022.3142091
Singh PKhan BMahela OHaes Alhelou HHayek G(2020)Managing Energy Plus Performance in Data Centers and Battery-Based Devices Using an Online Non-Clairvoyant Speed-Bounded Multiprocessor SchedulingApplied Sciences10.3390/app1007245910:7(2459)Online publication date: 3-Apr-2020
https://doi.org/10.3390/app10072459
Vaze RNair J(2020)Multiple Server SRPT With Speed Scaling Is CompetitiveIEEE/ACM Transactions on Networking10.1109/TNET.2020.2993142(1-13)Online publication date: 2020
https://doi.org/10.1109/TNET.2020.2993142
Show More Cited By

Index Terms

Competitive non-migratory scheduling for flow time and energy
1. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Scheduling algorithms
    2. Online algorithms
      1. Online learning algorithms
        Scheduling algorithms
  2. Theory and algorithms for application domains
    1. Machine learning theory
      1. Reinforcement learning
        Sequential decision making

Recommendations

Improved multi-processor scheduling for flow time and energy

Energy usage has been an important concern in recent research on online scheduling. In this paper, we study the tradeoff between flow time and energy (Albers and Fujiwara in ACM Trans. Algorithms 3(4), 2007; Bansal et al. in Proceedings of ACM-SIAM ...
Read More
Nonmigratory Multiprocessor Scheduling for Response Time and Energy

Energy usage has been an important concern in recent research on online job scheduling, where processors are allowed to vary the speed dynamically so as to save energy whenever possible. Notice that providing good quality of service such as response ...
Read More
Energy-efficient multiprocessor scheduling for flow time and makespan

We consider energy-efficient scheduling on multiprocessors, where the speed of each processor can be individually scaled, and a processor consumes power s^@a when running at speed s, for @a>1. A scheduling algorithm needs to decide at any time both ...
Read More

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SPAA '08: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures

June 2008

380 pages

ISBN:9781595939739

DOI:10.1145/1378533

General Chair:
Friedhelm Meyer auf der Heide
University of Paderborn, Germany
,
Program Chair:
Nir Shavit
Tel-Aviv University, Israel, and Sun Labs, USA

Copyright © 2008 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 14 June 2008

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

SPAA08

Sponsor:

SPAA08: 20th ACM Symposium on Parallelism in Algorithms and Architectures

June 14 - 16, 2008

Munich, Germany

Acceptance Rates

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

29
Total Citations
View Citations
251
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)1

Other Metrics

View Author Metrics

Citations

Cited By

Vaze RNair J(2022)Speed Scaling on Parallel Servers With MapReduce Type Precedence ConstraintsIEEE/ACM Transactions on Networking10.1109/TNET.2022.314209130:4(1509-1524)Online publication date: Aug-2022
https://doi.org/10.1109/TNET.2022.3142091
Singh PKhan BMahela OHaes Alhelou HHayek G(2020)Managing Energy Plus Performance in Data Centers and Battery-Based Devices Using an Online Non-Clairvoyant Speed-Bounded Multiprocessor SchedulingApplied Sciences10.3390/app1007245910:7(2459)Online publication date: 3-Apr-2020
https://doi.org/10.3390/app10072459
Vaze RNair J(2020)Multiple Server SRPT With Speed Scaling Is CompetitiveIEEE/ACM Transactions on Networking10.1109/TNET.2020.2993142(1-13)Online publication date: 2020
https://doi.org/10.1109/TNET.2020.2993142
Méndez‐Díaz IOrozco JSantos RZabala P(2016)Energy‐aware scheduling mandatory/optional tasks in multicore real‐time systemsInternational Transactions in Operational Research10.1111/itor.1232824:1-2(173-198)Online publication date: 8-Aug-2016
https://doi.org/10.1111/itor.12328
Nelson AGoossens KGirault AGuan N(2015)Distributed power management of real-time applications on a GALS multiprocessor SOCProceedings of the 12th International Conference on Embedded Software10.5555/2830865.2830882(147-156)Online publication date: 4-Oct-2015
https://dl.acm.org/doi/10.5555/2830865.2830882
Nelson AGoossens K(2015)Distributed power management of real-time applications on a GALS multiprocessor SOC2015 International Conference on Embedded Software (EMSOFT)10.1109/EMSOFT.2015.7318270(147-156)Online publication date: Oct-2015
https://doi.org/10.1109/EMSOFT.2015.7318270
Greiner GNonner TSouza A(2014)The Bell Is Ringing in Speed-Scaled Multiprocessor SchedulingTheory of Computing Systems10.1007/s00224-013-9477-954:1(24-44)Online publication date: 1-Jan-2014
https://dl.acm.org/doi/10.1007/s00224-013-9477-9
Fox KIm SMoseley BKhanna S(2013)Energy efficient scheduling of parallelizable jobsProceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms10.5555/2627817.2627885(948-957)Online publication date: 6-Jan-2013
https://dl.acm.org/doi/10.5555/2627817.2627885
Lam TLee LTo IWong P(2013)Online Speed Scaling Based on Active Job Count to Minimize Flow Plus EnergyAlgorithmica10.1007/s00453-012-9613-y65:3(605-633)Online publication date: 1-Mar-2013
https://dl.acm.org/doi/10.1007/s00453-012-9613-y
Angel EBampis EKacem F(2012)Energy Aware Scheduling for Unrelated Parallel MachinesProceedings of the 2012 IEEE International Conference on Green Computing and Communications10.1109/GreenCom.2012.78(533-540)Online publication date: 20-Nov-2012
https://dl.acm.org/doi/10.1109/GreenCom.2012.78
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents