Efficient computation of address sequences in data parallel programs using closed forms for basis vectors.
From MaRDI portal
Publication:676619
DOI10.1006/jpdc.1996.0140zbMath1114.68352MaRDI 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
68N01: General topics in the theory of software
Related Items
Generating efficient local memory access sequences for coupled subscripts in data-parallel programs., Automatic array partitioning based on the Smith normal form