Article

Free access

Partitioning programs for parallel execution

Authors:

M. Girkar,

C. PolychronopoulosAuthors Info & Claims

ICS '88: Proceedings of the 2nd international conference on Supercomputing

Pages 216 - 229

https://doi.org/10.1145/55364.55386

Published: 01 June 1988 Publication History

PDF eReader

Abstract

The ability of parallel computers to execute multiple instruction streams (tasks) simultaneously gives rise to the problem of partitioning a program into a set of tasks that can be assigned to different processors. The degree to which parallelism can be exploited, the amount of overhead involved during parallel execution of a program and a number of other factors depend directly on partitioning. A good partitioning scheme must take into account all these factors. In this paper we present algorithms to compute optimal partitions in diverse models of the problem. Both directed and undirected graph representations of a parallel program are considered. For some instances of the problem where practical optimal schemes are not possible we suggest simple and efficient heuristics. Finally, a polynomial time algorithm to compute optimal partitions for chains is given.

References

[1]

Bokhari S. H. Partitioning Problems in Parallel, Pipelined, and Distributed Computing, IEEE Trans. on Computers, Vol. 37, No.'1, January 1988.

Digital Library

Google Scholar

[2]

Coffman E. G. Jr., R. L. Graham. Optimal Scheduling on Two Processor Systems, A cta Informat|ca, Vol. 1, No. 3~ 1972.

Google Scholar

[3]

Coffmaxt E. G. Jr., M. R. Garey, D. S. Johnson. An Application of Bin. Packing to Multiprocessor Scheduling, SIAM J. of Computing, Vol. 7, No. 1, February 78.

Google Scholar

[4]

Garey M. R., D. S. Johnson. Computers and Intractability, A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, San Francisco, CMifornia, 1979.

Digital Library

Google Scholar

[5]

Graham R. L. Bounds on Multiprocessing Timing Anomalies, SIAM J. Appl. Math., Vol. 17, 1969, pp. 263- 269.

Crossref

Google Scholar

[6]

Indurkhya B., H. S. Stone, L. Xi- Cheng. Optimal Partition of Randomly Generated Distributed Programs, IEEE Transactions on Software Engineering, Vol. SE-12, No. 3, March 1986, pp. 483-495.

Digital Library

Google Scholar

[7]

Iqbal M. A. Approximate Algorithms for Partitioning and Assignment Problems ICASE Rap. 86-40, NASA Contractor Rap. 178130

Google Scholar

[8]

Nicol D. M. Analysis of Optimal Random Program Partitions, ICASE Report No. 86-53, NASA Langley Research Center, August 1086.

Google Scholar

[9]

Peir J. K. Program Partitioning and Synchronization on Multiprocessor Systems, Department of Computer Science, University of Illinois at Urbana-Champaign, D CS Report No. UIUCCDCS-R-86-1259, March 1986.

Digital Library

Google Scholar

[10]

Polychronopoulos C. D. On Program Restructuring, Scheduling and Communication for Parallel Processor Systems, Center for Supercomputing Research and Development Research and Development, Rep. No. 595, August 1986.

Google Scholar

[11]

Polychronopoulos C. D., D. J. Kuck Guided Self-Scheduling: A Practical Scheduling Scheme for Parallel Supercomputers, IEEE Trans. on Computers, Vol. 36, No. 12, December 1987.

Digital Library

Google Scholar

[12]

Sarkar V. Partitioning and Scheduling Parallel Programs for Ezecution on Multiprocessors, Technical Report No. CSL-TR-87-328, Computer Systems Laboratory, Department of Electrical Engineering and Computer Science, Stan~ord University, April 1987.

Crossref

Google Scholar

[13]

Stone H. Multiprocessor Scheduling with the Aid of Network Flow Algorithms, IEEE Transactions on Software Engineering, Vol. SE-3, No. 1, January 77, pp. 85-93.

Digital Library

Google Scholar

Cited By

View all

Vavala BNeves NSteenkiste P(2016)Secure Identification of Actively Executed Code on a Generic Trusted Component2016 46th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)10.1109/DSN.2016.45(419-430)Online publication date: Jun-2016
https://doi.org/10.1109/DSN.2016.45
Liu SSoffa M(2005)Parallel task assignment by graph partitioningPARLE '92 Parallel Architectures and Languages Europe10.1007/3-540-55599-4_144(965-966)Online publication date: 14-Jul-2005
https://doi.org/10.1007/3-540-55599-4_144
Wai-Yip Chan Chi-Kwong Li (1997)Heterogeneous Dominant Sequence Cluster (HDSC): a low complexity heterogeneous scheduling algorithm1997 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, PACRIM. 10 Years Networking the Pacific Rim, 1987-199710.1109/PACRIM.1997.620418(956-959)Online publication date: 1997
https://doi.org/10.1109/PACRIM.1997.620418
Show More Cited By

Recommendations

Partitioning and scheduling parallel programs for execution on multiprocessors
Dynamic partitioning of parallel Lisp programs
Machine Independent AND and OR Parallel Execution of Logic Programs: Part II-Compiled Execution

In pt.I, we presented a binding environment for the ANDand OR parallel execution of logic programs. This environment was instrumental inrendering a compiler for the AND and OR parallel execution of logic programs machineindependent. In this paper, we ...

Comments

Information & Contributors

Information

Published In

ICS '88: Proceedings of the 2nd international conference on Supercomputing

June 1988

679 pages

ISBN:0897912721

DOI:10.1145/55364

Editor:
J. Lenfant
Rennes

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 1988

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 629 of 2,180 submissions, 29%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

15
Total Citations
View Citations
392
Total Downloads

Downloads (Last 12 months)57
Downloads (Last 6 weeks)8

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Vavala BNeves NSteenkiste P(2016)Secure Identification of Actively Executed Code on a Generic Trusted Component2016 46th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)10.1109/DSN.2016.45(419-430)Online publication date: Jun-2016
https://doi.org/10.1109/DSN.2016.45
Liu SSoffa M(2005)Parallel task assignment by graph partitioningPARLE '92 Parallel Architectures and Languages Europe10.1007/3-540-55599-4_144(965-966)Online publication date: 14-Jul-2005
https://doi.org/10.1007/3-540-55599-4_144
Wai-Yip Chan Chi-Kwong Li (1997)Heterogeneous Dominant Sequence Cluster (HDSC): a low complexity heterogeneous scheduling algorithm1997 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, PACRIM. 10 Years Networking the Pacific Rim, 1987-199710.1109/PACRIM.1997.620418(956-959)Online publication date: 1997
https://doi.org/10.1109/PACRIM.1997.620418
Newburn CShen J(1996)Automatic partitioning of signal processing programs for symmetric multiprocessorsProceedings of the 1996 Conference on Parallel Architectures and Compilation Technique10.1109/PACT.1996.552675(269-280)Online publication date: 1996
https://doi.org/10.1109/PACT.1996.552675
Nakanishi TJoe KPolychronopoulos CAraki KFukuda A(1996)Estimating parallel execution time of loops with loop-carried dependencesProceedings of the 1996 ICPP Workshop on Challenges for Parallel Processing10.1109/ICPP.1996.538560(61-69)Online publication date: 1996
https://doi.org/10.1109/ICPP.1996.538560
Yalamanchili SWinkel LPerschbacher DShenoy B(1995)Partitioning and mapping in embedded multiprocessor architectures in the presence of constraintsConcurrency: Practice and Experience10.1002/cpe.43300703027:3(167-189)Online publication date: May-1995
https://doi.org/10.1002/cpe.4330070302
Yang TGerasoulis A(1994)DSCIEEE Transactions on Parallel and Distributed Systems10.1109/71.3085335:9(951-967)Online publication date: 1-Sep-1994
https://dl.acm.org/doi/10.1109/71.308533
de Castro CYalamanchili S(1993)Partitioning Algorithms for a Class of Application Specific Multiprocessor ArchitecturesProceedings. Workshop on Heterogeneous Processing,10.1109/WHP.1993.664374(107-112)Online publication date: 1993
https://doi.org/10.1109/WHP.1993.664374
Yalamanchili Te Winkel Perschbacher Shenoy (1993)GenieProceedings of the 1993 5th IEEE Symposium on Parallel and Distributed Processing10.1109/SPDP.1993.395489(522-529)Online publication date: 2-Dec-1993
https://dl.acm.org/doi/10.1109/SPDP.1993.395489
Gerasoulis AYang T(1993)Scheduling Program Task Graphs on MIMD ArchitecturesParallel Algorithm Derivation and Program Transformation10.1007/978-0-585-27330-3_5(153-186)Online publication date: 1993
https://doi.org/10.1007/978-0-585-27330-3_5
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

Partitioning and scheduling parallel programs for execution on multiprocessors

Dynamic partitioning of parallel Lisp programs

Machine Independent AND and OR Parallel Execution of Logic Programs: Part II-Compiled Execution

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Abstract

References

Cited By

Index Terms

Recommendations

Partitioning and scheduling parallel programs for execution on multiprocessors

Dynamic partitioning of parallel Lisp programs

Machine Independent AND and OR Parallel Execution of Logic Programs: Part II-Compiled Execution

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations