Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/generating-parallel-code-for-simd-machines-gih4XxBW0H
- Publisher
- Association for Computing Machinery
- Copyright
- Copyright © 1992 by ACM Inc.
- ISSN
- 1057-4514
- DOI
- 10.1145/130616.130622
- Publisher site
- See Article on Publisher Site
Abstract
Massively parallel SIMD machines rely on data parallelism usually achieved by a careful hand coding to support program efficiency. This paper describes parallelization of code generated for SIMD machines by the compiler for the Equational Programming Language, EPL. The language supports architecture-independent scientific programming by recurrent equations. The EPL compiler serves as a programming aid for users of parallel machines by automating data partitioning and computation parallelization based on inherent data dependencies. In support of a Connection Machine architecture, the EPL compiler performs horizontal partitioning of the program, a process that selects a dimension of each data structure to be projected along the processor array. Each processor then holds a single instance of that structure and operations along the projected dimension are done in parallel. The paper describes horizontal partitioning, code generation in MPL and efficiency of programs generated for Maspar SIMD machine.
Journal
ACM Letters on Programming Languages and Systems (LOPLAS) – Association for Computing Machinery
Published: Mar 1, 1992