Article

Free access

Competitive distributed job scheduling (extended abstract)

Authors:

Baruch Awerbuch,

David PelegAuthors Info & Claims

STOC '92: Proceedings of the twenty-fourth annual ACM symposium on Theory of Computing

Pages 571 - 580

https://doi.org/10.1145/129712.129768

Published: 01 July 1992 Publication History

Abstract

This paper examines the problem of balancing the job load in a network of processors, and introduces an online algorithm for scheduling a sequence of jobs in a competitive manner. The algorithm is shown to be polylog (n)-competitive according to a strict definition that forces the online algorithm to be competitive even when considering any bounded area of the network and bounded period of time.

We also analyze the common greedy feedback-based approach, and provide matching lower and upper bounds (up to a polylogarithmic factor) for the tradeoff between the costs of searches and updates under this approach.

References

[1]

Yehuda Afek, Baruch Awerbuch, Serge A. Plotkin, and Michael Saks. Local management of a global resource in a communication network, in Proc. 28th IEEE Syrup. on Foundations of Computer Science, October 1987.

Digital Library

[2]

Baruch Awerbuch, Israel Cidon, Inder Gopal, Marc Kaplan, and Shay Kutten. Distributed control for paris. In Proc. 9th A CM Syrup. on Principles of Distributed Computing, pages 145-160, 1990.

Digital Library

[3]

Baruch Awerbuch, Israel Cidon, and Shay Kutten. Optimal maintenance of replicated information. In Proc. 31st IEEE Syrup. on Foundations of Computer Science, 1990.

Digital Library

[4]

G.R. Andrews, D.P. Dobkin, and P.J. Downey. Distributed allocation with pools of servers, in Proc. 1st A CM Symp. on Principles of Distributed Computing, pages 73-83. ACM, August 1982.

Digital Library

[5]

J. Aspnes, M. Herlihy, and N. Shavit. Counting networks and multi-processor coordination. In Proc. 23rd A CM Syrup. on Theory of Computing, pages 348-358, 1991.

Digital Library

[6]

Baruch Awerbuch and David Peleg. Online tracking of mobile users. Technical Memo TM-410, MIT, Lab. for Computer Science, August 1989.

[7]

Baruch Awerbuch and David Feleg. Sparse partitions. In Proc. 31st IEEE Symp. on Foundations of Computer Science, pages 503-513, 1990.

Digital Library

[8]

Baruch Awerbuch and David Peleg. Routing with polynomial communication- space trade-off. SIAM J. on Discr. Math., 1991. To appear. Also in Technical Memo TM-411, MIT, Sept. 1989.

Digital Library

[9]

Israel Cidon, Inder Gopal, and Shay Kutten. New models and algorithms for future networks. In Proc. 7th A CM Syrup. on Principles of Distributed Computing, pages 74-89. ACM, August 1988.

Digital Library

[10]

A. Feldmann, J. Sgall, and S.-H. Teng. Dynamic scheduling on parallel machines, in Proc. 32nd IEEE Syrup. on Foundations of Computer Science, pages 111-120, 1991.

Digital Library

[11]

R.L. Graham. Bounds for certain multiprocessor anomalies. Bell System Technical Journal, 45:1563-1581, 1966.

[12]

John McQuillan, Ira Richer, and Eric Rosen. The new routing algorithm for the arpanet. IEEE Trans. on Commun., 28(5):711-719, May 1980.

[13]

S.J. Mullender and P.M.B. Vit~nyi. Distributed match-making. Algorithmica, 3:367-391, 1988.

Digital Library

[14]

D. Peleg. Distance-dependent distributed directories. Info. and Computation, 1991. To appear. Also in Tech. Report CS89-10, The Weizmann Institute, May 89.

Digital Library

[15]

D. Peleg and E. Upfal. The token distribution problem. SIAM J. on Comput., 18:229-243, 1989.

Digital Library

[16]

A.G. Ranade. How to emulate a shared memory. In Proc. 28th IEEE Syrup. on Foundations of Computer Science, pages 185-194, 1987.

Digital Library

[17]

D.D. Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. Comm. of the A CM, 28(2):202- 208, 1985.

Digital Library

[18]

D.B. Shmoys, J. Wein, and D.P. Williamson. Scheduling parallel machines on-line. In Proc. 32nd IEEE Symp. on Foundations of Computer Science, pages 131-140, 1991.

Digital Library

Cited By

Zhao TLi WZomaya A(2024)Learning-Augmented SchedulingIEEE Transactions on Computers10.1109/TC.2024.344185673:11(2548-2562)Online publication date: Nov-2024
https://doi.org/10.1109/TC.2024.3441856
Vivek SRakesh KMohan B(2022)Optimized Distributed Job Shop Scheduling Using Balanced Job Allocation and Modified Ant Colony OptimizationPattern Recognition and Data Analysis with Applications10.1007/978-981-19-1520-8_21(271-281)Online publication date: 2-Sep-2022
https://doi.org/10.1007/978-981-19-1520-8_21
Ahmed RBodwin GSahneh FHamm KLatifi Jebelli MKobourov SSpence R(2020)Graph spanners: A tutorial reviewComputer Science Review10.1016/j.cosrev.2020.10025337(100253)Online publication date: Aug-2020
https://doi.org/10.1016/j.cosrev.2020.100253
Show More Cited By

Index Terms

Competitive distributed job scheduling (extended abstract)

Recommendations

Improved competitive algorithms for online scheduling with partial job values
Special papers from: COCOON 2003

This paper considers an online scheduling problem arising from Quality-of-Service (QoS) applications. We are required to schedule a set of jobs, each with release time, deadline, processing time and weight. The objective is to maximize the total value ...
Parallel job scheduling algorithms
Improved online algorithms for parallel job scheduling and strip packing

In this paper we consider the online scheduling of jobs which require processing on a number of machines simultaneously. These jobs are presented to a decision maker one by one, where the next job becomes known as soon as the current job is scheduled. ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

STOC '92: Proceedings of the twenty-fourth annual ACM symposium on Theory of Computing

July 1992

794 pages

ISBN:0897915119

DOI:10.1145/129712

Chairmen:
Rao Kosaraju
Johns Hopkins Univ., Baltimore, MD
,
Mike Fellows
Univ. of Victoria, Victoria, BC, Canada
,
Avi Wigderson
Hebrew University; Princeton Univ., Princeton, NJ
,
John Ellis
Univ. of Victoria, Victoria, BC, Canada

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

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1992

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC92

Sponsor:

SIGACT

STOC92: 24th Annual ACM Symposium on the Theory of Computing 1992

May 4 - 6, 1992

British Columbia, Victoria, Canada

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

41
Total Citations
View Citations
726
Total Downloads

Downloads (Last 12 months)108
Downloads (Last 6 weeks)13

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Zhao TLi WZomaya A(2024)Learning-Augmented SchedulingIEEE Transactions on Computers10.1109/TC.2024.344185673:11(2548-2562)Online publication date: Nov-2024
https://doi.org/10.1109/TC.2024.3441856
Vivek SRakesh KMohan B(2022)Optimized Distributed Job Shop Scheduling Using Balanced Job Allocation and Modified Ant Colony OptimizationPattern Recognition and Data Analysis with Applications10.1007/978-981-19-1520-8_21(271-281)Online publication date: 2-Sep-2022
https://doi.org/10.1007/978-981-19-1520-8_21
Ahmed RBodwin GSahneh FHamm KLatifi Jebelli MKobourov SSpence R(2020)Graph spanners: A tutorial reviewComputer Science Review10.1016/j.cosrev.2020.10025337(100253)Online publication date: Aug-2020
https://doi.org/10.1016/j.cosrev.2020.100253
Garncarek PJurdziński TKowalski DLoryś K(2019)Online packet scheduling under adversarial errorsTheoretical Computer Science10.1016/j.tcs.2019.08.003Online publication date: Aug-2019
https://doi.org/10.1016/j.tcs.2019.08.003
Bampis EKononov ALetsios DLucarelli GSviridenko M(2018)Energy-efficient scheduling and routing via randomized roundingJournal of Scheduling10.1007/s10951-016-0500-221:1(35-51)Online publication date: 1-Feb-2018
https://dl.acm.org/doi/10.1007/s10951-016-0500-2
Aljuraidan JBauer LReiter MBeckerle M(2017)Introducing Reputation Systems to the Economics of Outsourcing Computations to Rational WorkersFinancial Cryptography and Data Security10.1007/978-3-662-54970-4_4(60-77)Online publication date: 17-May-2017
https://doi.org/10.1007/978-3-662-54970-4_4
Emek YKutten SWattenhofer RWichs DMansour Y(2016)Online matching: haste makes waste!Proceedings of the forty-eighth annual ACM symposium on Theory of Computing10.1145/2897518.2897557(333-344)Online publication date: 19-Jun-2016
https://dl.acm.org/doi/10.1145/2897518.2897557
Fernández Anta AGeorgiou CKowalski DWidmer JZavou E(2016)Measuring the impact of adversarial errors on packet scheduling strategiesJournal of Scheduling10.1007/s10951-015-0451-z19:2(135-152)Online publication date: 1-Apr-2016
https://dl.acm.org/doi/10.1007/s10951-015-0451-z
Fernández Anta AGeorgiou CKowalski DZavou E(2015)Online parallel scheduling of non-uniform tasksTheoretical Computer Science10.1016/j.tcs.2015.01.027590:C(129-146)Online publication date: 26-Jul-2015
https://dl.acm.org/doi/10.1016/j.tcs.2015.01.027
Georgiou CKowalski D(2015)On the competitiveness of scheduling dynamically injected tasks on processes prone to crashes and restartsJournal of Parallel and Distributed Computing10.1016/j.jpdc.2015.07.00784:C(94-107)Online publication date: 1-Oct-2015
https://dl.acm.org/doi/10.1016/j.jpdc.2015.07.007
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

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

Media

Figures

Other

Tables

View Table of Contents