DescriptionTiling subdivides the multidimensional iteration space of a nested loop into blocks or tiles. Tiles become a natural candidate as the unit of work for parallel task scheduling, where scheduling and synchronization is done at tile granularity, reducing overhead at some loss of potential parallelism. Tiling allows separation of concerns between local optimizations (vectorization, cache footprint) and global optimization (parallelization, scheduling for locality). Tiling is well-known and has been included in many compilers and code transformation systems. The talk will explore the basic contribution of the SC1989 paper to the current state of iteration space tiling.