Article

Free access

Automatic data/program partitioning using the single assignment principle

Authors:

L. Bic,

M. D. Nagel,

J. M. A. RoyAuthors Info & Claims

Supercomputing '89: Proceedings of the 1989 ACM/IEEE conference on Supercomputing

Pages 551 - 556

https://doi.org/10.1145/76263.76324

Published: 01 August 1989 Publication History

PDF eReader

Abstract

Loosely-coupled MIMD architectures do not suffer from memory contention; hence large numbers of processors may be utilized. The main problem, however, is how to partition data and programs in order to exploit the available parallelism. In this paper we show that efficient schemes for automatic data/program partitioning and synchronization may be employed if single assignment is used. Using simulations of program loops common to scientific computations (the Livermore Loops), we demonstrate that only a small fraction of data accesses are remote and thus the degradation in network performance due to multi-processing is minimal.

References

[1]

Arvind and D.E. Culler. Dataflow Architectures, Annual Reviews in Computer Science, Vol. 1 1986, pp. 225-253.

Digital Library

Google Scholar

[2]

A. Aiken and A. Nicolau. Loop Quantization: an Analysis and Algorithm, Technical Report 87-821, Dept. of Computer Science, Cornell Univ., March 1987.

Digital Library

Google Scholar

[3]

W.B. Ackerman. Data Flow Languages, Computer, Feb. 1982, pp. 15-24.

Google Scholar

[4]

Arvind, R. Nikhil, and K. Pingali. I-structures: Data Structures for Parallel Computing, Computation Structures Group Memo 269, Laboratory for Computer Science, M1T, February 1987.

Google Scholar

[5]

D. Callahan, K. Kennedy. Compiling Programs for Distributed-Memory Multiprocessors. Jour. of Supercomputing V2, (1988), pp. 151-169.

Google Scholar

[6]

Dennis, J.B. First Version of a Dataflow Procedure Language. MAC Technical Memo 61, M1T, Cambridge, Mass.

Google Scholar

[7]

C. Koelbel, P. Mehrotra, J. V. Rosendale. Semi-Autornatie Domain Decomposition in BLASE. 1987 International Conference on Parallel Processing (1987), pp. 521-524.

Google Scholar

[8]

J.-K. Peri. Program Partitioning and Synchronization on Multiprocessor Systems, Ph.D. Thesis, Univ. of illinois at Urb.-Champ., Rept. No. UIUCDCS-R-86- 1259, Mar. 1986.

Digital Library

Google Scholar

[9]

J. Peir, D. Gajski, and M. Wu, Programming Environments for Multiprocessors, Supercomputing, North-Holland, 1987, pp. 73-93

Digital Library

Google Scholar

[10]

D.A. Reed and R. M. Fujimoto. Multicomputer Networks: Message-Based Parallel Processing, MIT Press, 1987.

Digital Library

Google Scholar

[11]

Architecture and Applications of the HEP Multiprocessor Computer System, Denelcor, Denver, Colorado, 1983.

Google Scholar

[12]

B.J. Smith. Architecture and Applications of the HEP Multiprocessor Computer System, Society of Photo- Optical Instrumentation Engineers, Vol. 298, Realtime Signal Processing IV, Aug. 1981, pp. 241-248.

Google Scholar

Cited By

View all

PINEO† P(1997)THE EFFICIENT CREATION OF SINGLE ASSIGNMENT FORMS FROM UNSTRUCTURED CODE*Parallel Algorithms and Applications10.1080/0149573970894141912:1-3(143-163)Online publication date: Jan-1997
https://doi.org/10.1080/01495739708941419
Pineo P(1996)An efficient algorithm for the creation of single assignment formsProceedings of HICSS-29: 29th Hawaii International Conference on System Sciences10.1109/HICSS.1996.495465(213-222 vol.1)Online publication date: 1996
https://doi.org/10.1109/HICSS.1996.495465
Roh LNajjar WBöhm A(1996)Generation, Optimization, and Evaluation of Multithreaded CodeJournal of Parallel and Distributed Computing10.1006/jpdc.1996.001332:2(188-204)Online publication date: 1-Feb-1996
https://dl.acm.org/doi/10.1006/jpdc.1996.0013
Show More Cited By

Index Terms

Automatic data/program partitioning using the single assignment principle

Recommendations

Dynamic Data Partitioning for Distributed-Memory Multicomputers
Special issue on compilation techniques for distributed memory systems

For distributed-memory multicomputers such as the Intel Paragon, the IBM SP-1/SP-2, the NCUBE/2, and the Thinking Machines CM-5, the quality of the data partitioning for a given application is crucial to obtaining high performace. This task has ...
Improving parallelism and data locality with affine partitioning
Demonstration of Automatic Data Partitioning Techniques for Parallelizing Compilers on Multicomputers

An approach to the problem of automatic data partitioning is introduced. The notion of constraints on data distribution is presented, and it is shown how, based on performance considerations, a compiler identifies constraints to be imposed on the ...

Comments

Information & Contributors

Information

Published In

Supercomputing '89: Proceedings of the 1989 ACM/IEEE conference on Supercomputing

August 1989

849 pages

ISBN:0897913418

DOI:10.1145/76263

Chairman:
F. Ron Bailey

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]

In-Cooperation

Los Alamos National Labs: Los Alamos National Labs
NASA: National Aeronatics and Space Administration
Argonne Natl Lab: Argonne National Lab

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1989

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SC '89

Sponsor:

SIGARCH
IEEE-CS

SC '89: International Conference for High Performance Computing, Networking, Storage and Analysis

November 12 - 17, 1989

Nevada, Reno, USA

Acceptance Rates

Overall Acceptance Rate 1,516 of 6,373 submissions, 24%

Upcoming Conference

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
197
Total Downloads

Downloads (Last 12 months)25
Downloads (Last 6 weeks)5

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

PINEO† P(1997)THE EFFICIENT CREATION OF SINGLE ASSIGNMENT FORMS FROM UNSTRUCTURED CODE*Parallel Algorithms and Applications10.1080/0149573970894141912:1-3(143-163)Online publication date: Jan-1997
https://doi.org/10.1080/01495739708941419
Pineo P(1996)An efficient algorithm for the creation of single assignment formsProceedings of HICSS-29: 29th Hawaii International Conference on System Sciences10.1109/HICSS.1996.495465(213-222 vol.1)Online publication date: 1996
https://doi.org/10.1109/HICSS.1996.495465
Roh LNajjar WBöhm A(1996)Generation, Optimization, and Evaluation of Multithreaded CodeJournal of Parallel and Distributed Computing10.1006/jpdc.1996.001332:2(188-204)Online publication date: 1-Feb-1996
https://dl.acm.org/doi/10.1006/jpdc.1996.0013
Pineo PSoffa MBic LEvripidou PBöhm WGaudiot J(1995)Practical approach to single assignment codeProceedings of the IFIP WG10.3 working conference on Parallel architectures and compilation techniques10.5555/224659.224712(149-158)Online publication date: 27-Jun-1995
https://dl.acm.org/doi/10.5555/224659.224712
Roh LNajjar WShankar BBöhm A(1994)An Evaluation of Optimized Threaded Code GenerationProceedings of the IFIP WG10.3 Working Conference on Parallel Architectures and Compilation Techniques10.5555/647042.713812(37-46)Online publication date: 24-Aug-1994
https://dl.acm.org/doi/10.5555/647042.713812
Najjar WRoh LBöhm A(1994)An evaluation of medium-grain dataflow codeInternational Journal of Parallel Programming10.1007/BF0257773322:3(209-242)Online publication date: 1-Jun-1994
https://dl.acm.org/doi/10.1007/BF02577733
Najjar WRoh LBöhm A(1993)The Initial Performance of a Bottom-Up Clustering Algorithm for Dataflow GraphsProceedings of the IFIP WG10.3. Working Conference on Architectures and Compilation Techniques for Fine and Medium Grain Parallelism10.5555/647025.714253(91-100)Online publication date: 20-Jan-1993
https://dl.acm.org/doi/10.5555/647025.714253
Pineo PSoffa M(1991)Debugging parallelized code using code liberation techniquesACM SIGPLAN Notices10.1145/127695.12276926:12(108-119)Online publication date: 1-Dec-1991
https://dl.acm.org/doi/10.1145/127695.122769
Pineo PSoffa MMiller BMcDowell C(1991)Debugging parallelized code using code liberation techniquesProceedings of the 1991 ACM/ONR workshop on Parallel and distributed debugging10.1145/122759.122769(108-119)Online publication date: 1-Dec-1991
https://dl.acm.org/doi/10.1145/122759.122769
Roy JNagel MBic LPryor DMontry GMartin J(1990)Partitioning declarative programs into communicating processesProceedings of the 1990 ACM/IEEE conference on Supercomputing10.5555/110382.110616(846-855)Online publication date: 12-Nov-1990
https://dl.acm.org/doi/10.5555/110382.110616
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

Dynamic Data Partitioning for Distributed-Memory Multicomputers

Improving parallelism and data locality with affine partitioning

Demonstration of Automatic Data Partitioning Techniques for Parallelizing Compilers on Multicomputers

Comments

Published In

Sponsors

In-Cooperation

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Abstract

References

Cited By

Index Terms

Recommendations

Dynamic Data Partitioning for Distributed-Memory Multicomputers

Improving parallelism and data locality with affine partitioning

Demonstration of Automatic Data Partitioning Techniques for Parallelizing Compilers on Multicomputers

Comments

Information

Published In

Sponsors

In-Cooperation

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

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