Compile-time Loop Splitting for Distributed Memory ... - Stanford AI Lab

Contents
1 Introduction 9
1.1 Overview XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX 10
1.2 Previous Application XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX 11
2 Array Management in Multiprocessors 12
2.1 Introduction XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX 12
2.2 Partitioning XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX 14
2.2.1 Task Partitioning XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX 14
2.2.2 Data Partitioning XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX 18
2.3 Optimal Partitioning XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX 19
2.3.1 Optimal Task Partitioning XXXXXXXXXXXXXXXXXXXXXXXXXXXX 19
2.3.2 Optimal Data Partitioning XXXXXXXXXXXXXXXXXXXXXXXXXXX 21
2.4 The Problem XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX 21
2.5 Array Referencing XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX 22
2.6 Simple Optimization of Array Calculation XXXXXXXXXXXXXXXXXXXXXX 25
2.7 Summary XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX 27
3 Overview of Loop Splitting 28
3.1 Introduction XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX 28
3.2 Two Loop Transformations XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX 29
3.2.1 General Loop Splitting XXXXXXXXXXXXXXXXXXXXXXXXXXXXXX 29
3.2.2 Peeling XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX 30
3.3 Two Compiler Optimizations XXXXXXXXXXXXXXXXXXXXXXXXXXXXXX 31
4