Generating local addresses and communication sets for data-parallel programs

DOI10.1006/JPDC.1995.1049zbMATH Open0826.68047OpenAlexW1974685317MaRDI QIDQ1892863FDOQ1892863

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

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

Recommendations

• Efficient address generation for affine subscripts in data-parallel programs
• Generating communication sets of array assignment statements for block-cyclic distribution on distributed memory parallel computers
• Generating efficient local memory access sequences for coupled subscripts in data-parallel programs.
• scientific article; zbMATH DE number 1487942
• Analysis of local enumeration and storage schemes in HPF

zbMATH Keywords

high performance Fortrandata-parallel languagesdistributed-memory implementations

Mathematics Subject Classification ID

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

Cited In (14)

• Automatic array partitioning based on the Smith normal form
• Title not available (Why is that?)
• Symbolic communication set generation for irregular parallel applications
• Generating communication sets of array assignment statements for block-cyclic distribution on distributed memory parallel computers
• Generating efficient local memory access sequences for coupled subscripts in data-parallel programs.
• Title not available (Why is that?)
• Data distribution specification for high performance computing
• Presburger arithmetic in memory access optimization for data-parallel languages
• Efficient address generation for affine subscripts in data-parallel programs
• Revisiting communication code generation algorithms for message-passing systems
• Communication set generations with CSD calculus and expression-rewriting framework
• Parallelization of sequential programs: distribution of arrays among processors and structurization of communications
• Skewed data partition and alignment techniques for compiling programs on distributed memory multicomputers
• A schedule cache for data parallel unstructured computations

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1892863)