Title :
Massive parallelism through program restructuring
Author_Institution :
Oregon Graduate Inst. of Sci. & Eng., Beaverton, OR, USA
Abstract :
A technique for mapping algorithms to massively parallel processors is described. It differs from previous work by focusing on explicit program restructuring, as opposed to manual or algebraic mapping. The method is flexible, and it allows nonlinear, as well as linear, mappings. Some restructuring transformations and how they would be used are described. A limitation of the approach is the restriction of skewing and rotating by unit factors only. The method benefits from previous work in program restructuring and systolic array synthesis and thus will be simple to implement
Keywords :
parallel programming; mapping algorithms; massively parallel processors; program restructuring; restructuring transformations; rotating; skewing; systolic array synthesis; Automatic control; Computational modeling; Concurrent computing; Iterative algorithms; Manuals; Optimization methods; Parallel algorithms; Parallel languages; Parallel processing; Systolic arrays;
Conference_Titel :
Frontiers of Massively Parallel Computation, 1990. Proceedings., 3rd Symposium on the
Conference_Location :
College Park, MD
Print_ISBN :
0-8186-2053-6
DOI :
10.1109/FMPC.1990.89491
