skip to main content
10.1145/1378533.1378577acmconferencesArticle/Chapter ViewAbstractPublication PagesspaaConference Proceedingsconference-collections
research-article

Fast distributed scheduling via primal-dual

Published: 14 June 2008 Publication History

Abstract

In this paper we give an efficient distributed algorithm computing approximate solutions to a very general, and classical, scheduling problem. The approximation guarantee is within a constant factor of the optimum. By "efficient", we mean that the number of communication rounds is poly-logarithmic in the size of the input. In the problem, we have a bipartite graph with computing agents on one side and resources on the other. Agents that share a resource can communicate in one time step. Each agent has a list of jobs, each with its own length and profit, to be executed on a neighbouring resource within a given time-window. Resources can execute non preemptively only one job at a time. The goal is to maximize the profit of the jobs that are scheduled. It is well known that this problem is NP-hard. A very interesting feature of our algorithm is that it is derived in a systematic manner from a primal-dual algorithm.

References

[1]
F. Chudak, T. Erlebach, A. Panconesi and M. Sozio. Primal-Dual Distributed Algorithms for Covering and Facility Location Problems Manuscript, 2006.
[2]
S. Khuller, U. Vishkin, and N. Young. A primal-dual parallel approximation technique applied to weighted set and vertex covers. J. Algorithms}, 17(2):280--289, 1994.
[3]
F. Kuhn and R. Wattenhofer. Constant-time distributed dominating set approximation. In Proceedings, ACM Symposium on Principles of Distributed Computing, pages 25--32, 2003.
[4]
F. Kuhn, T. Moscibroda, and R. Wattenhofer. On the Locality of Bounded Growth, 24th ACM Symposium on the Principles ofDistributed Computing (PODC 05).
[5]
N. Linial and M. Saks.Low diameter graph decompositions. Combinatorica, 13(1993) pages 441--454.
[6]
M. Luby. A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput., 15:1036--1053, 1986.
[7]
A. Panconesi and A. Srinivasan. The local nature of delta-coloring and its algorithmic applications. Combinatorica}, 15(2):255--280, 1995.
[8]
A. Panconesi and A. Srinivasan.On the complexity of Distributed Network Decomposition. Journal of Algorithms 20, 356--374 (1996).
[9]
Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi and Mauro Sozio. A primal-dual bicriteria distributed algorithm for capacitated vertex cover.Accepted for publication in SIAM Journal on Computing (SICOMP).
[10]
Amotz Bar-Noy and Reuven Bar-Yehuda and Ari Freund and Joseph Naor and Baruch Schieber. A unified approach to approximating resource allocation and scheduling, Journal of the ACM, 48,1069--1090,2001.
[11]
Michael Luby and Noam Nisan. A parallel approximation algorithm for positive linear programming, STOC 1993, pages 448--457.
[12]
Fabian Kuhn and Thomas Moscibroda and Roger Wattenhofer. The price of being near-sighted, SODA 2006, pages 980--989.

Cited By

View all
  • (2017)Distributed Approximation of Maximum Independent Set and Maximum MatchingProceedings of the ACM Symposium on Principles of Distributed Computing10.1145/3087801.3087806(165-174)Online publication date: 25-Jul-2017
  • (2013)Distributed Algorithms for Scheduling on Line and Tree Networks with Non-uniform BandwidthsProceedings of the 2013 IEEE 27th International Symposium on Parallel and Distributed Processing10.1109/IPDPS.2013.92(973-984)Online publication date: 20-May-2013
  • (2012)Distributed algorithms for scheduling on line and tree networksProceedings of the 2012 ACM symposium on Principles of distributed computing10.1145/2332432.2332503(345-354)Online publication date: 16-Jul-2012
  • Show More Cited By

Recommendations

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
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.

Check for updates

Author Tags

  1. distributed algorithms
  2. peer-to-peer
  3. primal-dual
  4. scheduling

Qualifiers

  • Research-article

Conference

SPAA08

Acceptance Rates

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

Upcoming Conference

SPAA '25
37th ACM Symposium on Parallelism in Algorithms and Architectures
July 28 - August 1, 2025
Portland , OR , USA

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 19 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2017)Distributed Approximation of Maximum Independent Set and Maximum MatchingProceedings of the ACM Symposium on Principles of Distributed Computing10.1145/3087801.3087806(165-174)Online publication date: 25-Jul-2017
  • (2013)Distributed Algorithms for Scheduling on Line and Tree Networks with Non-uniform BandwidthsProceedings of the 2013 IEEE 27th International Symposium on Parallel and Distributed Processing10.1109/IPDPS.2013.92(973-984)Online publication date: 20-May-2013
  • (2012)Distributed algorithms for scheduling on line and tree networksProceedings of the 2012 ACM symposium on Principles of distributed computing10.1145/2332432.2332503(345-354)Online publication date: 16-Jul-2012
  • (2011)Peer-assisted texture streaming in metaversesProceedings of the 19th ACM international conference on Multimedia10.1145/2072298.2072326(203-212)Online publication date: 28-Nov-2011
  • (2010)Dominating sets of agents in visibility graphsProceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 110.5555/1838206.1838312(797-804)Online publication date: 10-May-2010
  • (2010)Fast primal-dual distributed algorithms for scheduling and matching problemsDistributed Computing10.1007/s00446-010-0100-x22:4(269-283)Online publication date: 1-May-2010

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media