by G M Megson (University of Reading) & X Chen (University of Kent)

The automatic generation of parallel code from high level sequential description is of key importance to the wide spread use of high performance machine architectures. This text considers (in detail) the theory and practical realization of automatic mapping of algorithms generated from systems of uniform recurrence equations (do-lccps) onto fixed size architectures with defined communication primitives. Experimental results of the mapping scheme and its implementation are given.

• Survey and Analysis of Partitioning and Mapping
• Improvements to Some Existing Partitioning and Mapping Methods
• A Methodology of Partitioning and Mapping for Given (N-1)-D Regular Arrays
• Optimal Mapping onto Lower-Dimensional Regular Arrays
• The Structure of Parallel Programs
• Parallel Code Generation
• Experimental Results and Discussions
• Conclusion
• Bibliography