1 Introduction. - 1. 1 Model Assumptions. - 1. 2 Related Work. - 1. 3 Overview. - 2 Contiguous Loop Partitions for Neighborhood Communication. - 2. 1 Introduction. - 2. 2 Quantifying Communication. - 2. 3 Compensation for Cache Line Size. - 2. 4 Partition Construction. - 2. 5 Experimental Evaluation of ADP. - 2. 6 Conclusion. - 3 Contiguous Data Assignments for Neighborhood Communication. - 3. 1 Introduction. - 3. 2 Data Assignments. - 3. 3 Exploiting Overlap. - 3. 4 Software Redundancy. - 3. 5 ADAPT. - 3. 6 Experimental Results. - 3. 7 Conclusion. - 4 Cyclic Loop Partitions for Linearly Varying Loops. - 4. 1 Introduction. - 4. 2 Code Segments. - 4. 3 Determining Communication Parameters. - 4. 4 Multicast Communication Overhead. - 4. 5 Partitioning. - 4. 6 Experimental Results. - 4. 7 Conclusion. - 5 Collective Partitioning and Remapping for Multiple Loop Nests. - 5. 1 Introduction. - 5. 2 Program Enclosure Trees. - 5. 3 The CPR Algorithm. - 5. 4 Experimental Results. - 5. 5 Conclusion. Language: English