Abstract
This Chapter introduces several communication-free partitioning techniques of nested loops in literature. Since the cost of data communication is much higher than that of a primitive computation in distributed-memory multicomputers, it is important to reduce data communication. The ideal situation is to eliminate data communication when it is possible. During the last few years, many techniques investigating how to achieve communication-free by partitioning nested loops are proposed. This Chapter makes a survey of these techniques and points out the differences among them.