research-article

Commitment and Slack for Online Load Maximization

Authors:

Samin Jamalabadi,

Chris Schwiegelshohn,

Uwe SchwiegelshohnAuthors Info & Claims

SPAA '20: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures

Pages 339 - 348

https://doi.org/10.1145/3350755.3400271

Published: 09 July 2020 Publication History

Abstract

We consider a basic admission control problem in which jobs with deadlines arrive online and our goal is to maximize the total volume of executed job processing times. We assume that the deadlines have a slack of at least ε, that is, each deadline d satisfies d≥ (1+ε)· p+r with processing time p and release date r. In addition, we require the admission policy to support immediate commitment, that is, upon a job's submission, we must immediately make the decision of if and where we schedule the job, and this decision is irreversible.

Our main contribution is a deterministic algorithm with nearly optimal competitive ratio for load maximization on multiple machines in the non-preemptive model. Previous results either only held for a single machine, did not support commitment, or required job preemption and migration.

References

[1]

B. Awerbuch, Y. Azar, and S.A. Plotkin. 1993. Throughput-Competitive On-Line Routing. In Proc. of the 34th Annual Symposium on Foundations of Computer Science (FOCS). 32--40.

[2]

Y. Azar, I. Kalp-Shaltiel, B. Lucier, I. Menache, J. Naor, and J. Yaniv. 2015. Truthful Online Scheduling with Commitments. In Proc. of the Sixteenth ACM Conference on Economics and Computation (EC). 715--732.

[3]

A. Bar-Noy, R. Canetti, S. Kutten, Y. Mansour, and B. Schieber. 1999. Bandwidth Allocation with Preemption. SIAM J. Comput., Vol. 28, 5 (1999), 1806--1828.

Digital Library

[4]

S.K. Baruah, J.R. Haritsa, and N. Sharma. 1994. On-Line Scheduling to Maximize Task Completions. In Proceedings of the 15th IEEE Real-Time Systems Symposium (RTSS '94), San Juan, Puerto Rico, December 7--9, 1994. 228--236. https://doi.org/10.1109/REAL.1994.342713

[5]

S.K. Baruah, G. Koren, B. Mishra, A. Raghunathan, L.E. Rosier, and D.E. Shasha. 1991. On-line Scheduling in the Presence of Overload. In 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1--4 October 1991. 100--110.

[6]

S. K. Baruah, G. Koren, D. Mao, B. Mishra, A. Raghunathan, L. E. Rosier, D. Shasha, and F. Wang. 1992. On the Competitiveness of On-Line Real-Time Task Scheduling. Real-Time Systems, Vol. 4, 2 (1992), 125--144.

Digital Library

[7]

D.P. Bunde and M.H. Goldwasser. 2010. Dispatching Equal-Length Jobs to Parallel Machines to Maximize Throughput. In Algorithm Theory - SWAT 2010, 12th Scandinavian Symposium and Workshops on Algorithm Theory, Bergen, Norway, June 21--23, 2010. Proceedings. 346--358.

[8]

L. Chen, F. Eberle, N. Megow, K. Schewior, and C. Stein. 2019. A general framework for handling commitment in online throughput maximization. In Proccedings of the 20th IPCO 2019, Ann Arbor, MI, USA. 141--154.

[9]

M. Chrobak, W. Jawor, J. Sgall, and T. Tichý. 2007. Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help. SIAM J. Comput., Vol. 36, 6 (2007), 1709--1728.

Digital Library

[10]

B. DasGupta and M.A. Palis. 2001. Online real-time preemptive scheduling of jobs with deadlines on multiple machines. Journal of Scheduling, Vol. 4, 6 (2001), 297--312.

[11]

J. Ding, T. Ebenlendr, J. Sgall, and G. Zhang. 2007. Online Scheduling of Equal-Length Jobs on Parallel Machines. In Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8--10, 2007, Proceedings. 427--438.

[12]

J. Ding and G. Zhang. 2006. Online Scheduling with Hard Deadlines on Parallel Machines. In Algorithmic Aspects in Information and Management, Second International Conference, AAIM 2006, Hong Kong, China, June 20--22, 2006, Proceedings. 32--42.

[13]

T. Ebenlendr and J. Sgall. 2008. A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines. In Approximation and Online Algorithms, 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18--19, 2008. Revised Papers. 43--52.

[14]

F. Eberle, N. Megow, and K. Schewior. 2019. Optimally handling commitment issues in online throughput maximization. CoRR, Vol. abs/1912.10769 (2019). arxiv: 1912.10769 http://arxiv.org/abs/1912.10769

[15]

S.P.Y. Fung. 2014. Online scheduling with preemption or non-completion penalties. J. Scheduling, Vol. 17, 2 (2014), 173--183.

Digital Library

[16]

J.A. Garay, J. Naor, B. Yener, and P. Zhao. 2002. On-line Admission Control and Packet Scheduling with Interleaving. In Proc. of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM). 94--103.

[17]

S.A. Goldman, J. Parwatikar, and S. Suri. 2000. Online Scheduling with Hard Deadlines. Journal of Algorithms, Vol. 34, 2 (2000), 370 -- 389.

Digital Library

[18]

M.H. Goldwasser. 1999. Patience is a Virtue: The Effect of Slack on Competitiveness for Admission Control. In Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 396--405.

[19]

M.H. Goldwasser. 2003. Patience is a virtue: the effect of slack on competitiveness for admission control. Journal of Scheduling, Vol. 6, 2 (2003), 183--211.

Digital Library

[20]

M.H. Goldwasser and B. Kerbikov. 2003. Admission Control with Immediate Notification. J. Scheduling, Vol. 6, 3 (2003), 269--285.

Digital Library

[21]

M.H. Goldwasser and M. Pedigo. 2008. Online nonpreemptive scheduling of equal-length jobs on two identical machines. ACM Trans. Algorithms, Vol. 5, 1 (2008), 2:1--2:18.

Digital Library

[22]

R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan. 1979. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey. In Discrete Optimization II, P.L. Hammer, E.L. Johnson, and B.H. Korte (Eds.). Annals of Discrete Mathematics, Vol. 5. Elsevier, 287 -- 326.

[23]

J.H. Kim and K.-Y. Chwa. 2001. On-Line Deadline Scheduling on Multiple Resources. In Proc. of the 7th Annual International Conference of Computing and Combinatorics (COCOON). 443--452.

Digital Library

[24]

C.-Y. Koo, T. W. Lam, T.-W. Ngan, and K.-K. To. 2002. Extra processors versus future information in optimal deadline scheduling. In SPAA. 133--142.

[25]

G. Koren and D.E. Shasha. 1995. Dover: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems. SIAM J. Comput., Vol. 24, 2 (1995), 318--339.

Digital Library

[26]

J. Lee. 2003. Online deadline scheduling: multiple machines and randomization. In Proc. of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 19--23.

Digital Library

[27]

R.J. Lipton and A. Tomkins. 1994. Online Interval Scheduling. In Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23--25 January 1994, Arlington, Virginia. 302--311.

[28]

B. Lucier, I. Menache, J. Naor, and J. Yaniv. 2013. Efficient online scheduling for deadline-sensitive jobs: extended abstract. In Proc. of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 305--314.

[29]

C. Schwiegelshohn and U. Schwiegelshohn. 2016. The Power of Migration for Online Slack Scheduling. In 24th Annual European Symposium on Algorithms (ESA). 75:1--75:17.

[30]

M. Skutella and J. Verschae. 2016. Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures. Math. Oper. Res., Vol. 41, 3 (2016), 991--1021.

Digital Library

[31]

N. Thibault and C. Laforest. 2009. Online time constrained scheduling with penalties. In 23rd IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2009, Rome, Italy, May 23--29, 2009. 1--8.

Digital Library

Cited By

Zhang CTan HHuang HHan ZJiang SLi GLi X(2023)Online Approximation Scheme for Scheduling Heterogeneous Utility Jobs in Edge ComputingIEEE/ACM Transactions on Networking10.1109/TNET.2022.319338131:1(352-365)Online publication date: Feb-2023
https://doi.org/10.1109/TNET.2022.3193381
Eberle FMegow NSchewior K(2022)Online Throughput Maximization on Unrelated Machines: Commitment is No BurdenACM Transactions on Algorithms10.1145/356958219:1(1-25)Online publication date: 14-Dec-2022
https://dl.acm.org/doi/10.1145/3569582
Nileshwar GSchwiegelshohn U(2022)AI-Job Scheduling on Systems with Renewable Power SourcesJob Scheduling Strategies for Parallel Processing10.1007/978-3-031-22698-4_2(25-46)Online publication date: 3-Jun-2022
https://dl.acm.org/doi/10.1007/978-3-031-22698-4_2
Show More Cited By

Index Terms

Commitment and Slack for Online Load Maximization
1. Networks
  1. Network services
    1. Cloud computing
2. Theory of computation
  1. Design and analysis of algorithms
    1. Online algorithms
      1. Online learning algorithms
        Scheduling algorithms

Recommendations

Online Throughput Maximization on Unrelated Machines: Commitment is No Burden
We consider a fundamental online scheduling problem in which jobs with processing times and deadlines arrive online over time at their release dates. The task is to determine a feasible preemptive schedule on a single or multiple possibly unrelated ...
Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost

We consider the single-machine online scheduling with job rejection to minimize the total completion time of the scheduled jobs plus the total rejection cost of the rejected jobs under an agreeable condition on the processing times and rejection ...
Online scheduling with linear deteriorating jobs to minimize the total weighted completion time

In this paper, we study the online scheduling of linear deteriorating jobs on a single machine to minimize the total weighted completion time. In the problem, a set of n independent linear deteriorating jobs arriving online over time has to be scheduled ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SPAA '20: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures

July 2020

601 pages

ISBN:9781450369350

DOI:10.1145/3350755

General Chair:
Christian Scheideler
Institut fuer Informatik Universitaet Paderborn Fuerstenallee 11
,
Program Chair:
Michael Spear

Copyright © 2020 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

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture
EATCS: European Association for Theoretical Computer Science

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 July 2020

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

SPAA '20

Sponsor:

SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures

July 15 - 17, 2020

Virtual Event, USA

Acceptance Rates

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
136
Total Downloads

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

Reflects downloads up to 25 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Zhang CTan HHuang HHan ZJiang SLi GLi X(2023)Online Approximation Scheme for Scheduling Heterogeneous Utility Jobs in Edge ComputingIEEE/ACM Transactions on Networking10.1109/TNET.2022.319338131:1(352-365)Online publication date: Feb-2023
https://doi.org/10.1109/TNET.2022.3193381
Eberle FMegow NSchewior K(2022)Online Throughput Maximization on Unrelated Machines: Commitment is No BurdenACM Transactions on Algorithms10.1145/356958219:1(1-25)Online publication date: 14-Dec-2022
https://dl.acm.org/doi/10.1145/3569582
Nileshwar GSchwiegelshohn U(2022)AI-Job Scheduling on Systems with Renewable Power SourcesJob Scheduling Strategies for Parallel Processing10.1007/978-3-031-22698-4_2(25-46)Online publication date: 3-Jun-2022
https://dl.acm.org/doi/10.1007/978-3-031-22698-4_2
Höhne FSchmitt Svan Stee R(2021)SIGACT News Online Algorithms Column 36ACM SIGACT News10.1145/3444815.344483051:4(89-107)Online publication date: 14-Jan-2021
https://dl.acm.org/doi/10.1145/3444815.3444830

View Options

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