Generating local addresses and communication sets for data-parallel programs

DOI10.1006/jpdc.1995.1049zbMath0826.68047OpenAlexW1974685317MaRDI QIDQ1892863

Shang-Hua Teng, John R. Gilbert, Fred J. E. Long, Siddhartha Chatterjee, Robert Schreiber

Publication date: 6 July 1995

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/0a8d6d029ca358b895abbb15a93161a6e04ff1ff

zbMATH Keywords

high performance Fortrandata-parallel languagesdistributed-memory implementations

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (2)

Automatic array partitioning based on the Smith normal form ⋮ Generating efficient local memory access sequences for coupled subscripts in data-parallel programs.

This page was built for publication: Generating local addresses and communication sets for data-parallel programs