Efficient address generation for affine subscripts in data-parallel programs

DOI10.1023/A:1008190606079zbMATH Open0969.68655MaRDI QIDQ5938647

Chih-Yung Chang, Kuei-Ping Shih, Jang-Ping Sheu

Publication date: 1 October 2001

Published in: The Journal of Supercomputing (Search for Journal in Brave)

zbMATH Keywords

address generationaffine subscriptsdata distributiondata-parallel languagesdistributed-memory multicomputersmultiple induction variables (MIVs)single program multiple data (SPMD)

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Computing methodologies and applications (68U99)

Related Items (1)

Efficient address generation in a parallel processor

This page was built for publication: Efficient address generation for affine subscripts in data-parallel programs

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