Article

Free access

Parallel language constructs for tensor product computations on loosely coupled architectures

Authors:

P. Mehrotra,

J. van RosendaleAuthors Info & Claims

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

Pages 616 - 626

https://doi.org/10.1145/76263.76333

Published: 01 August 1989 Publication History

PDF eReader

Abstract

Distributed memory architectures offer high levels of performance and flexibility, but have proven awkward to program. Current languages for nonshared memory architectures provide a relatively low-level programming environment, and are poorly suited to modular programming, and to the construction of libraries. This paper describes a set of language primitives designed to allow the specification of parallel numerical algorithms at a higher level. We focus here on tensor product array computations, a simple but important class of numerical algorithms. We consider first the problem of programming one dimensional “kernel” routines, such as parallel tridiagonal solvers, and after that look at how such parallel kernels can be combined to form parallel tensor product algorithms.

References

[1]

D. Callahan and K. Kennedy. Compiling programs for distributed memory multiprocessors. The Journal of Supercomputing, 2:151-169, 1988.

Crossref

Google Scholar

[2]

D. G annon and 3. Van Rosendale. On the impact of communication complexity in the design of parallel algorithms. IEEE Transactions on Computers, C- 33( 12):1180-1194, December 1984.

Google Scholar

[3]

D.H. Grit and J.R. McGraw. Programming divide and conquer on a mult;~processor. Technical Report UCRL-88710, Lawrence Livermore National Laboratory~ 1983.

Google Scholar

[4]

C.A.R. Hoare. Communicating sequential processes. Communications of lhe A CM, 21(8):667- 677, August 1978.

Digital Library

Google Scholar

[5]

S.L. Johnsson. Solving tridiagonal systems on ensemble architectures. Technical Report YALEU/DCS/RR-436, Yale Research Report, November 1985.

Google Scholar

[6]

C. Koelbel. Compiling programs for distributed memory machines. PhD thesis, Purdue University, West Lafayette, IN, December 1989.

Digital Library

Google Scholar

[7]

C. Koelbel and P. Mehrotra. Compiler transformations for non-shared memory machines. In International Conference on Supercomputing, May 1989.

Google Scholar

[8]

C. Koelbel, P. Mehrotra, and J. Van Rosendale. Semi-automatic process partitioning for parallel computation. International Journal of Parallel Programming, 16(5):366-382, 1987.

Digital Library

Google Scholar

[9]

D.S. Lira and R.V. Thanakij. A survey of adi implementations on hypercubes. In Proceedings of the Second Conference on Hypercube Multiyorcessors, 1987.

Google Scholar

[10]

P. Mehrotra and 3. Van RosendMe. The BLAZE language: A parMlel language for scientific programs. P~r~llel Computing, 5(3):339-361, November 1987.

Google Scholar

[11]

P. Mehrotra and 3. Van Rosendale. Compiling high level constructs to distributed memory architectures. In Proceedings of lhe Fourth Conference ou Hypercube Concurrent Computers and Applications, March 1989.

Google Scholar

[12]

D.W. Peaceman and ti.tt. Rachford. The numerical solution of parabolic and elliptic differential equations. SIAM Journal, 3(1), 1955.

Google Scholar

[13]

D. Pountain. A tutorial{ introduction to Oeeam programming. Technical report, Inmos, Colorado Springs, Co., 1986.

Google Scholar

[14]

M. Rosing and R. Schnabel. An overview of Dinoa new language for numerical computation on distributed memory multiprocessors. In Proceedings of the Third SIAM Conference on Parallel Processing for Scientific Computing, pages 312-316, 1987.

Digital Library

Google Scholar

Cited By

View all

Berryman HSaltz JScroggs J(2006)Execution time support for adaptive scientific algorithms on distributed memory machinesConcurrency: Practice and Experience10.1002/cpe.43300303033:3(159-178)Online publication date: 24-Oct-2006
https://doi.org/10.1002/cpe.4330030303
Malki DSnir M(1992)Nicke – C Extensions for Programming on Distributed-Memory MachinesLanguages, Compilers and Run-Time Environments for Distributed Memory Machines10.1016/B978-0-444-88712-2.50010-X(103-118)Online publication date: 1992
https://doi.org/10.1016/B978-0-444-88712-2.50010-X
Koelbel CMehrotra P(1991)Programming data parallel algorithms on distributed memory using KaliProceedings of the 5th international conference on Supercomputing10.1145/109025.109122(414-423)Online publication date: 1-Jun-1991
https://dl.acm.org/doi/10.1145/109025.109122
Show More Cited By

Index Terms

Parallel language constructs for tensor product computations on loosely coupled architectures

Recommendations

A massively parallel tensor contraction framework for coupled-cluster computations

Precise calculation of molecular electronic wavefunctions by methods such as coupled-cluster requires the computation of tensor contractions, the cost of which has polynomial computational scaling with respect to the system and basis set sizes. Each ...
Parallel language and pipeline constructs for concurrent computation
A loosely coupled parallel algorithm for standard cell placement
ICCAD '94: Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design

We present a loosely coupled parallel algorithm for the placement of standard cell integrated circuits. Our algorithm is a derivative of simulated annealing. The implementation of our algorithm is targeted towards networks of UNIX workstations. This is ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

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

8
Total Citations
View Citations
213
Total Downloads

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

Reflects downloads up to 21 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Berryman HSaltz JScroggs J(2006)Execution time support for adaptive scientific algorithms on distributed memory machinesConcurrency: Practice and Experience10.1002/cpe.43300303033:3(159-178)Online publication date: 24-Oct-2006
https://doi.org/10.1002/cpe.4330030303
Malki DSnir M(1992)Nicke – C Extensions for Programming on Distributed-Memory MachinesLanguages, Compilers and Run-Time Environments for Distributed Memory Machines10.1016/B978-0-444-88712-2.50010-X(103-118)Online publication date: 1992
https://doi.org/10.1016/B978-0-444-88712-2.50010-X
Koelbel CMehrotra P(1991)Programming data parallel algorithms on distributed memory using KaliProceedings of the 5th international conference on Supercomputing10.1145/109025.109122(414-423)Online publication date: 1-Jun-1991
https://dl.acm.org/doi/10.1145/109025.109122
Koelbel CMehrotra PVan Rosendale J(1990)Supporting shared data structures on distributed memory architecturesACM SIGPLAN Notices10.1145/99164.9918325:3(177-186)Online publication date: 1-Feb-1990
https://dl.acm.org/doi/10.1145/99164.99183
Koelbel CMehrotra PVan Rosendale JPadua D(1990)Supporting shared data structures on distributed memory architecturesProceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming10.1145/99163.99183(177-186)Online publication date: 1-Feb-1990
https://dl.acm.org/doi/10.1145/99163.99183
Rühl RAnnaratone MSameh Avan der Vorst H(1990)Parallelization of FORTRAN code on distributed-memory parallel processorsProceedings of the 4th international conference on Supercomputing10.1145/77726.255174(342-353)Online publication date: 1-Jun-1990
https://dl.acm.org/doi/10.1145/77726.255174
Rühl RAnnaratone M(1990)Parallelization of FORTRAN code on distributed-memory parallel processorsACM SIGARCH Computer Architecture News10.1145/255129.25517418:3b(342-353)Online publication date: 1-Jun-1990
https://dl.acm.org/doi/10.1145/255129.255174
Mirchandaney SSaltz JMehrotra PBerryman H(1990)A Scheme for Supporting Automatic Data Migration on MultlcomputersProceedings of the Fifth Distributed Memory Computing Conference, 1990.10.1109/DMCC.1990.556314(1028-1037)Online publication date: 1990
https://doi.org/10.1109/DMCC.1990.556314

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

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

A massively parallel tensor contraction framework for coupled-cluster computations

Parallel language and pipeline constructs for concurrent computation

A loosely coupled parallel algorithm for standard cell placement