Article

Free access

Allocating weighted jobs in parallel

Authors:

Petra Berenbrink,

Friedhelm Meyer auf der Heide,

Klaus SchröderAuthors Info & Claims

SPAA '97: Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures

Pages 302 - 310

https://doi.org/10.1145/258492.258522

Published: 01 June 1997 Publication History

PDF eReader

References

[1]

Yossi Azar, Andrei Z. Broder, and Anna R. Karlin. On-line load balancing. Theoretical Computer Science, 130:73-84, 1994. preliminary version in FOCS 92.

Digital Library

Google Scholar

[2]

Y. Azar, A. Z. Broder, A. R. Karlin, and E. Upfal. Balanced allocations (extended abstract). In Symposium on Theory of Computing. ACM, 1994.

Digital Library

Google Scholar

[3]

Micah Adler, Soumen Chakrabarti, Michael Mitzenmacher, and Lars Rasmussen. Parallel randomized load balancing (preliminary version). In Symposium on Theory of Computing. ACM, 1995.

Digital Library

Google Scholar

[4]

Yossi Azar, Bala Kakyanasundaram, Serge Plotkin, Kirk R. Pruhs, and Orli Waarts. Online load balazlcing of temporary tasks. In Proc. of 3rd Workshop on Algorithms and Data Structures, pages 119-130, 1993.

Digital Library

Google Scholar

[5]

Martin Dietzfelbinger and Friedhelm Meyer auf der Heide. How to distribute a dictionary in a complete network. In Proceedings o/ the 22nd Symposium on Theory o/ Computing, 1990.

Digital Library

Google Scholar

[6]

Thomas G. Kurtz. Approximation of Population Processes. Regional Conference Series in Applied Mathematics. CMBS-NSF, 1981.

Google Scholar

[7]

Michael Mitzenmacher. Density dependent jump markov processes and applications to load balancing. In FOCS, 1996.

Digital Library

Google Scholar

[8]

Michael David Mitzenmacher. The Power of Two Random Choices in Randomized Load Balancing. PhD thesis, Graduate Division of the University of California at Berkley, 1996.

Google Scholar

[9]

S. Phillips and J. Westbrook. Online load balancing and network flow. In Proceedings of 25th STOC, pages 402-411. ACM, 1993.

Digital Library

Google Scholar

[10]

P. Raghvan R. Motwani. Randomized Algorithms. Cambridge University Press, 1995.

Digital Library

Google Scholar

[11]

Volker Stemann. Contention Resolution in Hashing Based Shared Memory Simulations. PhD thesis, Heinz Nixdorf Institute, University of Paderborn, 1995. appears in: HNI Verlagsschriftenreihe, Vol 3.

Google Scholar

[12]

Volker Stemann. Parallel balanced allocations (extended abstract). In Annual A CM Symposium on Parallel Algorithms and Architectures, 1996.

Digital Library

Google Scholar

Cited By

View all

Bremler-Barr AHay DMoyal ISchiff L(2017)Load balancing memcached traffic using software defined networking2017 IFIP Networking Conference (IFIP Networking) and Workshops10.23919/IFIPNetworking.2017.8264855(1-9)Online publication date: Jun-2017
https://doi.org/10.23919/IFIPNetworking.2017.8264855
Lenzen CWattenhofer R(2016)Tight bounds for parallel randomized load balancingDistributed Computing10.1007/s00446-014-0225-429:2(127-142)Online publication date: 1-Apr-2016
https://dl.acm.org/doi/10.1007/s00446-014-0225-4
Berenbrink PFriedetzky TMallmann-Trenn FMeshkinfamfard SWastell C(2015)Threshold Load Balancing with Weighted TasksProceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium10.1109/IPDPS.2015.73(550-558)Online publication date: 25-May-2015
https://dl.acm.org/doi/10.1109/IPDPS.2015.73
Show More Cited By

Index Terms

Allocating weighted jobs in parallel

Recommendations

Preemptive Weighted Completion Time Scheduling of Parallel Jobs

We present a new algorithm for the preemptive offline scheduling of independent jobs on a system consisting of m identical machines. The jobs can be parallel; that is, they may need the concurrent availability of several machines for their execution. To ...
Single machine parallel-batch scheduling with deteriorating jobs

We consider several single machine parallel-batch scheduling problems in which the processing time of a job is a linear function of its starting time. We give a polynomial-time algorithm for minimizing the maximum cost, an O(n⁵) time algorithm for ...
Scheduling in dynamic assembly job-shops to minimize the sum of weighted earliness, weighted tardiness and weighted flowtime of jobs

In many manufacturing systems, jobs that are completed early are held as finished-goods inventory until their due-dates, and hence we incur earliness costs. Similarly, jobs that are completed after their due-dates incur penalty. The objective in such ...

Comments

Information & Contributors

Information

Published In

SPAA '97: Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures

June 1997

331 pages

ISBN:0897918908

DOI:10.1145/258492

Chairmen:
Charles E. Leiserson
Massachussets Institute of Technology, Cambridge
,
David E. Culler
UC Berkely

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1997

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SPAA97

Sponsor:

SPAA97: 9th Annual ACM Symposium on Parallel

June 23 - 25, 1997

Rhode Island, Newport, USA

Acceptance Rates

SPAA '97 Paper Acceptance Rate 32 of 97 submissions, 33%;

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

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
351
Total Downloads

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

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bremler-Barr AHay DMoyal ISchiff L(2017)Load balancing memcached traffic using software defined networking2017 IFIP Networking Conference (IFIP Networking) and Workshops10.23919/IFIPNetworking.2017.8264855(1-9)Online publication date: Jun-2017
https://doi.org/10.23919/IFIPNetworking.2017.8264855
Lenzen CWattenhofer R(2016)Tight bounds for parallel randomized load balancingDistributed Computing10.1007/s00446-014-0225-429:2(127-142)Online publication date: 1-Apr-2016
https://dl.acm.org/doi/10.1007/s00446-014-0225-4
Berenbrink PFriedetzky TMallmann-Trenn FMeshkinfamfard SWastell C(2015)Threshold Load Balancing with Weighted TasksProceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium10.1109/IPDPS.2015.73(550-558)Online publication date: 25-May-2015
https://dl.acm.org/doi/10.1109/IPDPS.2015.73
Lenzen CWattenhofer RFortnow LVadhan S(2011)Tight bounds for parallel randomized load balancingProceedings of the forty-third annual ACM symposium on Theory of computing10.1145/1993636.1993639(11-20)Online publication date: 6-Jun-2011
https://dl.acm.org/doi/10.1145/1993636.1993639
Suss TWiesemann TFischer M(2010)Evaluation of a c-Load-Collision-Protocol for Load-Balancing in Interactive EnvironmentsProceedings of the 2010 IEEE Fifth International Conference on Networking, Architecture, and Storage10.1109/NAS.2010.52(448-456)Online publication date: 15-Jul-2010
https://dl.acm.org/doi/10.1109/NAS.2010.52
Adler MBerenbrink PSchröder K(2002)Analyzing an Infinite Parallel Job Allocation ProcessAlgorithms — ESA’ 9810.1007/3-540-68530-8_35(417-428)Online publication date: 15-Mar-2002
https://doi.org/10.1007/3-540-68530-8_35
Berenbrink PFriedetzky TSteger AMiller GRamachandran V(1999)Randomized and adversarial load balancingProceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures10.1145/305619.305638(175-184)Online publication date: 1-Jun-1999
https://dl.acm.org/doi/10.1145/305619.305638
Berenbrink PRiedel MScheideler CMiller GRamachandran V(1999)Simple competitive request scheduling strategiesProceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures10.1145/305619.305623(33-42)Online publication date: 1-Jun-1999
https://dl.acm.org/doi/10.1145/305619.305623
Cole RFrieze AMaggs BMitzenmacher MRicha ASitaraman RUpfal E(1999)On Balls and Bins with DeletionsRandomization and Approximation Techniques in Computer Science10.1007/3-540-49543-6_12(145-158)Online publication date: 11-Jun-1999
https://doi.org/10.1007/3-540-49543-6_12
Czumaj AMiller GGibbons P(1998)Recovery time of dynamic allocation processesProceedings of the tenth annual ACM symposium on Parallel algorithms and architectures10.1145/277651.277686(202-211)Online publication date: 1-Jun-1998
https://dl.acm.org/doi/10.1145/277651.277686
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

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

Cited By

Index Terms

Recommendations

Preemptive Weighted Completion Time Scheduling of Parallel Jobs

Single machine parallel-batch scheduling with deteriorating jobs

Scheduling in dynamic assembly job-shops to minimize the sum of weighted earliness, weighted tardiness and weighted flowtime of jobs