Generating local addresses and communication sets for data-parallel programs
From MaRDI portal
(Redirected from Publication:1892863)
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
Cited in
(14)- Revisiting communication code generation algorithms for message-passing systems
- A schedule cache for data parallel unstructured computations
- Symbolic communication set generation for irregular parallel applications
- Generating communication sets of array assignment statements for block-cyclic distribution on distributed memory parallel computers
- Automatic array partitioning based on the Smith normal form
- Efficient address generation for affine subscripts in data-parallel programs
- Generating efficient local memory access sequences for coupled subscripts in data-parallel programs.
- Skewed data partition and alignment techniques for compiling programs on distributed memory multicomputers
- scientific article; zbMATH DE number 1985709 (Why is no real title available?)
- Parallelization of sequential programs: distribution of arrays among processors and structurization of communications
- Data distribution specification for high performance computing
- Communication set generations with CSD calculus and expression-rewriting framework
- scientific article; zbMATH DE number 1376308 (Why is no real title available?)
- Presburger arithmetic in memory access optimization for data-parallel languages
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)