Efficient computation of address sequences in data parallel programs using closed forms for basis vectors.

DOI10.1006/jpdc.1996.0140zbMath1114.68352OpenAlexW2001607830MaRDI QIDQ676619

J. Ramanujam, Ashwath Thirumalai

Publication date: 7 August 1997

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

Full work available at URL: https://doi.org/10.1006/jpdc.1996.0140

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

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: Efficient computation of address sequences in data parallel programs using closed forms for basis vectors.