research-article

Online parallel scheduling of non-uniform tasks

Authors:

Antonio Fernández Anta,

Chryssis Georgiou,

Dariusz R. Kowalski,

Elli ZavouAuthors Info & Claims

Theoretical Computer Science, Volume 590, Issue C

Pages 129 - 146

https://doi.org/10.1016/j.tcs.2015.01.027

Published: 26 July 2015 Publication History

Abstract

Consider a system in which tasks of different execution times arrive continuously and have to be executed by a set of machines that are prone to crashes and restarts. In this paper we model and study the impact of parallelism and failures on the competitiveness of such an online system. In a fault-free environment, a simple Longest-In-System scheduling policy, enhanced by a redundancy-avoidance mechanism, guarantees optimality in a long-term execution. In the presence of failures though, scheduling becomes a much more challenging task. In particular, no parallel deterministic algorithm can be competitive against an off-line optimal solution, even with one single machine and tasks of only two different execution times. We find that when additional energy is provided to the system in the form of processing speedup, the situation changes. Specifically, we identify thresholds on the speedup under which such competitiveness cannot be achieved by any deterministic algorithm, and above which competitive algorithms exist. Finally, we propose algorithms that achieve small bounded competitive ratios when the speedup is over the threshold.

References

[1]

Enhanced Intel speedstep technology for the Intel Pentium M processor, Intel White Paper 301170-001, 2004.

[2]

M. Ajtai, J. Aspnes, C. Dwork, O. Waarts, A theory of competitive analysis for distributed algorithms, in: Proceedings of the 35th IEEE Symposium on Foundations of Computer Science, 1994, pp. 401-411.

Digital Library

[3]

S. Albers, A. Antoniadis, Race to idle: new algorithms for speed scaling with a sleep state, in: Proceedings of the 23rd ACM-SIAM Symposium on Discrete Algorithms, 2012, pp. 1266-1285.

Digital Library

[4]

S. Albers, A. Antoniadis, G. Greiner, On multi-processor speed scaling with migration: extended abstract, in: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures, 2011, pp. 279-288.

Digital Library

[5]

D. Alistarh, M.A. Bender, S. Gilbert, R. Guerraoui, How to allocate tasks asynchronously, in: Proceeding of the 53rd IEEE Symposium on Foundations of Computer Science, 2012, pp. 331-340.

Digital Library

[6]

S. Anand, N. Garg, N. Megow, Meeting deadlines: how much speed suffices?, in: Proceedings of the 38th International Colloquium on Automata, Languages and Programming, 2011, pp. 232-243.

Digital Library

[7]

R. Anderson, H. Woll, Algorithms for the certified write-all problem, SIAM J. Comput., 26 (1997) 1277-1283.

Digital Library

[8]

B. Awerbuch, S. Kutten, D. Peleg, Competitive distributed job scheduling (extended abstract), in: Proceedings of the 24th ACM Symposium on Theory of Computing, 1992, pp. 571-580.

Digital Library

[9]

N. Bansal, H.L. Chan, K. Pruhs, Speed scaling with an arbitrary power function, in: Proceedings of the 20th ACM-SIAM Symposium on Discrete Algorithms, 2009, pp. 693-701.

Digital Library

[10]

H.L. Chan, J. Edmonds, K. Pruhs, Speed scaling of processes with arbitrary speedup curves on a multiprocessor, in: Proceedings of the 21st ACM Symposium on Parallelism in Algorithms and Architectures, 2009, pp. 1-10.

Digital Library

[11]

B.S. Chlebus, R. De Prisco, A.A. Shvartsman, Performing tasks on synchronous restartable message-passing processors, Distrib. Comput., 14 (2001) 49-64.

Digital Library

[12]

G. Cordasco, G. Malewicz, A.L. Rosenberg, Advances in IC-scheduling theory: scheduling expansive and reductive DAGs and scheduling DAGs via duality, IEEE Trans. Parallel Distrib. Syst., 18 (2007) 1607-1617.

Digital Library

[13]

J. Dias, E. Ogasawara, D. de Oliveira, E. Pacitti, M. Mattoso, Improving many-task computing in scientific workflows using p2p techniques, in: Proceedings of the 3rd IEEE Workshop on Many-Task Computing on Grids and Supercomputers, 2010.

[14]

Y. Emek, M.M. Halldórsson, Y. Mansour, B. Patt-Shamir, J. Radhakrishnan, D. Rawitz, Online set packing and competitive scheduling of multi-part tasks, in: Proceedings of the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 2010, pp. 440-449.

Digital Library

[15]

Enabling Grids for E-sciencE (EGEE). http://www.eu-egee.org

[16]

Ch. Georgiou, D.R. Kowalski, Performing dynamically injected tasks on processes prone to crashes and restarts, in: Proceedings of the 25th International Symposium on Distributed Computing, 2011, pp. 165-180.

Digital Library

[17]

Ch. Georgiou, A. Russell, A.A. Shvartsman, The complexity of synchronous iterative Do-All with crashes, Distrib. Comput., 17 (2004) 47-63.

Digital Library

[18]

Ch. Georgiou, A.A. Shvartsman, Do-All Computing in Distributed Systems: Cooperation in the Presence of Adversity, Springer, 2008.

Digital Library

[19]

Ch. Georgiou, A.A. Shvartsman, Cooperative Task-Oriented Computing: Algorithms and Complexity, Morgan & Claypool Publishers, 2011.

[20]

G. Greiner, T. Nonner, A. Souza, The bell is ringing in speed-scaled multiprocessor scheduling, in: Proceedings of the 21st ACM Symposium on Parallelism in Algorithms and Architectures, 2009, pp. 11-18.

Digital Library

[21]

K.S. Hong, J.Y.-T. Leung, On-line scheduling of real-time tasks, IEEE Trans. Comput., 41 (1992) 1326-1331.

Digital Library

[22]

K. Jeffay, D.F. Stanat, C.U. Martel, On non-preemptive scheduling of period and sporadic tasks, in: Twelfth Real-Time Systems Symposium 1991, Proceedings, 1991, pp. 129-139.

[23]

B. Joan, E. Faith, Bounds for scheduling jobs on grid processors, in: Lecture Notes in Computer Science, vol. 8066, Springer, Berlin, Heidelberg, 2013, pp. 12-26.

[24]

P.C. Kanellakis, A.A. Shvartsman, Fault-Tolerant Parallel Computation, Kluwer Academic Publishers, Norwell, MA, USA, 1997.

Digital Library

[25]

S. Kentros, A. Kiayias, N.C. Nicolaou, A.A. Shvartsman, At-most-once semantics in asynchronous shared memory, in: Proceedings of the 23rd International Symposium on Distributed Computing, 2009, pp. 258-273.

Digital Library

[26]

E. Korpela, D. Werthimer, D. Anderson, J. Cobb, M. Leboisky, SETI@home-massively distributed computing for SETI, Comput. Sci. Eng., 3 (2001) 78-83.

Digital Library

[27]

P. Lalanda, Shared repository pattern, in: Proceedings of the 5th Pattern Languages of Programs Conference, 1998.

[28]

C.A. Phillips, C. Stein, E. Torng, J. Wein, Optimal time-critical scheduling via resource augmentation (extended abstract), in: Proceedings of the 29th ACM Symposium on Theory of Computing, 1997, pp. 140-149.

Digital Library

[29]

M.L. Pinedo, Scheduling: Theory, Algorithms, and Systems, Springer, 2012.

Digital Library

[30]

K. Schwan, H. Zhou, Dynamic scheduling of hard real-time tasks and real-time threads, IEEE Trans. Softw. Eng., 18 (1992) 736-748.

Digital Library

[31]

D. Sleator, R.E. Tarjan, Amortized efficiency of list update and paging rules, Commun. ACM, 28 (1985) 202-208.

Digital Library

[32]

U. van Heesch, S. Mahdavi Hezavehi, P. Avgeriou, Combining architectural patterns and software technologies in one design language, in: Proceedings of the 16th European Pattern Languages of Programming, 2011.

[33]

A. Wierman, L.L.H. Andrew, A. Tang, Power-aware speed scaling in processor sharing systems, in: Proceedings of the IEEE INFOCOM 2009, 2009, pp. 2007-2015.

[34]

F. Yao, A. Demers, A. Shenker, A scheduling model for reduced CPU energy, in: Proceedings of the 36th IEEE Symposium on Foundations of Computer Science, 1995, pp. 374-382.

Digital Library

[35]

M. Yokokawa, F. Shoji, A. Uno, M. Kurokawa, T. Watanabe, The K computer: Japanese next-generation supercomputer development project, in: Proceedings of the 2011 International Symposium on Low Power Electronics and Design, 2011, pp. 371-372.

Digital Library

Cited By

Fernndez Anta AGeorgiou CKowalski DZavou E(2018)Competitive analysis of fundamental scheduling algorithms on a fault-prone machine and the impact of resource augmentationFuture Generation Computer Systems10.1016/j.future.2016.05.04278:P1(245-256)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.1016/j.future.2016.05.042
Kowalski DWong PZavou E(2017)Fault tolerant scheduling of tasks of two sizes under resource augmentationJournal of Scheduling10.1007/s10951-017-0541-120:6(695-711)Online publication date: 1-Dec-2017
https://dl.acm.org/doi/10.1007/s10951-017-0541-1

Online parallel scheduling of non-uniform tasks
1. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
    2. Online algorithms
      1. Online learning algorithms
  2. Theory and algorithms for application domains
    1. Machine learning theory
      1. Reinforcement learning

Recommendations

Online parallel scheduling of non-uniform tasks: trading failures for energy
FCT'13: Proceedings of the 19th international conference on Fundamentals of Computation Theory

Consider a system in which tasks of different execution times arrive continuously and have to be executed by a set of processors that are prone to crashes and restarts. In this paper we model and study the impact of parallelism and failures on the ...
Competitive analysis of fundamental scheduling algorithms on a fault-prone machine and the impact of resource augmentation

Reliable task execution in machines that are prone to unpredictable crashes and restarts is both challenging and of high importance, but not much work exists on the analysis of such systems. We consider the online version of the problem, with tasks ...
Online malleable job scheduling for m≤3

A malleable parallel job is one that may be assigned to any number of processors in a parallel computing environment. In our particular problem, we assume that the execution time of a job j with processing requirement p"j is p"j/k"j+(k"j-1)c if the job ...

Comments

Information & Contributors

Information

Published In

cover image Theoretical Computer Science

Theoretical Computer Science Volume 590, Issue C

July 2015

152 pages

ISSN:0304-3975

Issue’s Table of Contents

Copyright © Elsevier B.V.

Publisher

Elsevier Science Publishers Ltd.

United Kingdom

Publication History

Published: 26 July 2015

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 16 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Fernndez Anta AGeorgiou CKowalski DZavou E(2018)Competitive analysis of fundamental scheduling algorithms on a fault-prone machine and the impact of resource augmentationFuture Generation Computer Systems10.1016/j.future.2016.05.04278:P1(245-256)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.1016/j.future.2016.05.042
Kowalski DWong PZavou E(2017)Fault tolerant scheduling of tasks of two sizes under resource augmentationJournal of Scheduling10.1007/s10951-017-0541-120:6(695-711)Online publication date: 1-Dec-2017
https://dl.acm.org/doi/10.1007/s10951-017-0541-1

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents