Scheduling partitioned algorithms on processor arrays with limited communication supports

Abstract

It is important that array designs, especially the scheduling of partitioned arrays, must cope with various kinds of communication constraints such as interconnection topology, channel bandwidth, and inhomogeneous communication delay. The interprocessor communication requirements can be dictated by the dependence vectors and size of the partitioned tiles. A folded constraint graph is created to describe timing constraints between computation and communication events. An integer-programming based method can then be adopted to find an optimal execution schedule, including offset between the start times of processors, which satisfies these constraints. >