Article

Free access

A multi-level load balancing scheme for OR-parallel exhaustive search programs on the multi-PSI

Authors:

N. IchiyoshiAuthors Info & Claims

PPOPP '90: Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming

Pages 50 - 59

https://doi.org/10.1145/99163.99170

Published: 01 February 1990 Publication History

Abstract

Good load balancing is the key to deriving maximal performance from multiprocessors. Several successful dynamic load balancing techniques on tightly-coupled multiprocessors have been developed. However, load balancing is more difficult on loosely-coupled multiprocessors because inter-processor communication overheads cost more. Dynamic load balancing techniques have been employed in a few programs on loosely-coupled multiprocessors, but they are tightly built into the particular programs and not much attention is paid to scalability. We have developed a dynamic load balancing scheme which is applicable to OR-parallel programs in general. Processors are grouped, and work loads of groups and processors are balanced hierarchically. Moreover, it is scalable to any number of processors because of this multi-level hierarchical structure. The scheme is tested for the all-solution exhaustive search Pentomino program on the mesh-connected loosely-coupled multiprocessor Multi-PSI, and speedups of 28.4 times with 32 processors and 50 times with 64 processors have been attained.

References

[1]

K. M. Baumgartner, and B. W. Wah. "GAMMON: A Load Balancing Strategy for Local Computer Systems with Multiaccess Networks". In IEEE Transactions of Computers, Vol. 38, No.8, pages 1,098-1,109, Aug. 1989.

Digital Library

[2]

T. Chikayama. "Load balancing in a very large scale multi-processor system". In Proceedings of Fourth Japanese-Swedish Workshop on Fifth Generation Computer Systems. SICS, 1986.

[3]

T. Chikayama, It. Sato, and T. Miyazaki. "Overview of the parallel inference machine operating system (PIMOS)". In Proceedings of the International Conference on Fifth Generation Computer Systems 1988, pages 230-251, 1988.

[4]

T. C. K. Chou, and J. A. Abraham. "Load Balancing in Distributed Systems". In IEEE Transactions of Computers, Vol. SE-8, No.4, pages 401-412, Jul. 1982.

[5]

E. W. Felten and S. W. Otto. "A highly parallel chess program". In Proceedings of the International Conference on Fifth Generation Computer Systems 1988, pages 1001-1009, Dec. 1988.

[6]

C. Ferguson, and R. E. Korf. "Distributed Tree Search and its Application to Alpha-Beta Pruning". In Proceedings of the Seventh National Conference on Artificial Intelligence 1988, Vol. 1, pages 128-132, Aug. 1988

[7]

A. George, M. T. Heath, J. Jiu, and E. Ng. "Solution of Sparse Positive Definite Systems on a Shared-Memory Multiprocessor". In International Journal of Parallel Programming, Vol. 15, No. 4, pages 309-325, 1986.

Digital Library

[8]

S. Hiroguchi, and Y. Shigeki. "Optimal Number of Processors for Finding the Maximum Value on Multiprocessor Systems". In Proceedings of The Twelfth Annual International Computer Software and Applications Conference 1988, pages 308-315, Oct. 1988

[9]

V. Kumar and V. N. Rao. "Parallel Depth-First Search, Part I: Implementation. In International Journal of Parallel Programming, 16(6), 479--499, 1988

Digital Library

[10]

K. Nakajima, Y. Inamura, N. Iehiyoshi, K. Rokusawa, and T. Chikayama. "Distributed implementation of KL1 on the Multi-PSI/V2". In Proceedings of the Sixth International Conference on Logic Programming, pages 436-451, 1989.

[11]

L. M. Ni, and Kai ttwang. "Optimal Load Balancing Strategies for A Multiple Processor System". In Proceedings of l Oth International Conference of Parallel Processing 1981, pages 352-357, Aug. 1981

[12]

D. M. Nicol, and F. H. Willard. "Problem Size, Parallel Architecture, and Optimal Speedup". In Journal of Parallel And Distributed Computing, 6, pages 404-420, 1988

Digital Library

[13]

S. Pulidas. "Imbedding Gradient Estimators in Load Balancing Algorithms". In Proceedings of 8th International Conference on Distributed Computing Systems 1988, pages 482-490, jun. 1988

[14]

A. N. Tantawi. "Optimal Static Load Balancing in Distributed Computer Systems". In Journal of the Association for Computing Machinery, Vol. 32. No. 2, pages 445-465, April 1985.

Digital Library

[15]

E. Tick. "Compile-Time Granularity Analysis for Parallel Logic Programming Languages". In Proceedings of the International Conference on Fifth Generation Compuler Syslems 1988, ICOT, 1988.

[16]

J. Schaeffer. "Distributed Game-Tree Searching". In Journal of Parallel And Distributed Computing, 6, pages 90-114, 1989

Digital Library

Cited By

Wang KQiao KSadooghi IZhou XLi TLang MRaicu I(2016)Load-balanced and locality-aware scheduling for data-intensive workloads at extreme scalesConcurrency and Computation: Practice & Experience10.1002/cpe.361728:1(70-94)Online publication date: 1-Jan-2016
https://dl.acm.org/doi/10.1002/cpe.3617
Garcia DHarvey BBarnes T(2015)The beauty and joy of computingACM Inroads10.1145/28351846:4(71-79)Online publication date: 17-Nov-2015
https://dl.acm.org/doi/10.1145/2835184
Snyder LAlexander R(2015)Early assessment of computer science principles at UWACM Inroads10.1145/28312386:4(98-101)Online publication date: 17-Nov-2015
https://dl.acm.org/doi/10.1145/2831238
Show More Cited By

Index Terms

A multi-level load balancing scheme for OR-parallel exhaustive search programs on the multi-PSI

Recommendations

A multi-level load balancing scheme for OR-parallel exhaustive search programs on the multi-PSI

Good load balancing is the key to deriving maximal performance from multiprocessors. Several successful dynamic load balancing techniques on tightly-coupled multiprocessors have been developed. However, load balancing is more difficult on loosely-...
Load Balancing in Parallel Computers: Theory and Practice
Broader dynamic load balancing for hybrid/multi-level parallel programming models

Recently, Hybrid/Multi-Level Parallel Programming Models have begun gaining lots of momentum basically because they have proven to provide better scalability, speedup and utilisation than any single parallel programming model alone. In such models, load ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PPOPP '90: Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming

February 1990

206 pages

ISBN:0897913507

DOI:10.1145/99163

Chairman:
David Padua
Univ. of Illinois at Urbana/Champaign, Urbana

ACM SIGPLAN Notices Volume 25, Issue 3
Mar. 1990
216 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/99164
Editor:
David Padua
Univ. of Illinois at Urbana/Champaign, Urbana
Issue’s Table of Contents

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

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 February 1990

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PPOPP90

Sponsor:

SIGPLAN

PPOPP90: Principals & Practice of Parallel Processing

March 14 - 16, 1990

Washington, Seattle, USA

Acceptance Rates

Overall Acceptance Rate 230 of 1,014 submissions, 23%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

47
Total Citations
View Citations
543
Total Downloads

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

Reflects downloads up to 23 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Wang KQiao KSadooghi IZhou XLi TLang MRaicu I(2016)Load-balanced and locality-aware scheduling for data-intensive workloads at extreme scalesConcurrency and Computation: Practice & Experience10.1002/cpe.361728:1(70-94)Online publication date: 1-Jan-2016
https://dl.acm.org/doi/10.1002/cpe.3617
Garcia DHarvey BBarnes T(2015)The beauty and joy of computingACM Inroads10.1145/28351846:4(71-79)Online publication date: 17-Nov-2015
https://dl.acm.org/doi/10.1145/2835184
Snyder LAlexander R(2015)Early assessment of computer science principles at UWACM Inroads10.1145/28312386:4(98-101)Online publication date: 17-Nov-2015
https://dl.acm.org/doi/10.1145/2831238
Beth BLin CVeletsianos G(2015)Training a diverse computer science teacher populationACM Inroads10.1145/28299786:4(94-97)Online publication date: 17-Nov-2015
https://dl.acm.org/doi/10.1145/2829978
Zheng GBhatelé AMeneses EKalé L(2011)Periodic hierarchical load balancing for large supercomputersThe International Journal of High Performance Computing Applications10.1177/109434201039438325:4(371-385)Online publication date: 8-Mar-2011
https://doi.org/10.1177/1094342010394383
Sun YZheng GJetley PKale L(2011)An Adaptive Framework for Large-Scale State Space Search2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum10.1109/IPDPS.2011.338(1798-1805)Online publication date: May-2011
https://doi.org/10.1109/IPDPS.2011.338
Romanescu BLebeck ASorin D(2010)Specifying and dynamically verifying address translation-aware memory consistencyACM SIGPLAN Notices10.1145/1735971.173605745:3(323-334)Online publication date: 13-Mar-2010
https://dl.acm.org/doi/10.1145/1735971.1736057
Bergan TAnderson ODevietti JCeze LGrossman D(2010)CoreDetACM SIGPLAN Notices10.1145/1735971.173602945:3(53-64)Online publication date: 13-Mar-2010
https://dl.acm.org/doi/10.1145/1735971.1736029
Harris TTomic SCristal AUnsal O(2010)Dynamic filteringACM SIGPLAN Notices10.1145/1735971.173602745:3(39-52)Online publication date: 13-Mar-2010
https://dl.acm.org/doi/10.1145/1735971.1736027
Neelakantam NDitzel DZilles C(2010)A real system evaluation of hardware atomicity for software speculationACM SIGPLAN Notices10.1145/1735971.173602645:3(29-38)Online publication date: 13-Mar-2010
https://dl.acm.org/doi/10.1145/1735971.1736026
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