Single-dimension Software Pipelining (SSP) has been proposed as an effective software pipelining technique for multi-dimensional loops . This paper introduces for the first time the scheduling methods that actually produce the kernel code. Because of the multi-dimensional nature of the problem, the scheduling problem is more complex and challenging than with traditional modulo scheduling. The scheduler must handle multiple subkernels and initiation rates under specific scheduling constraints, while producing a solution that minimizes the execution time of the final schedule.
In this paper three approaches are proposed: the
method, which schedules operations in loop level order, starting from the innermost, and does not let other operations interfere with the already scheduled levels, the
method, which schedules operations from different loop levels with the same priority, and the
method, which uses the level-by-level mechanism for the innermost level and the flat solution for the other levels. The methods subsume Huff’s modulo scheduling  for single loops as a special case. We also break a scheduling constraint introduced in earlier publications and allow for a more compact kernel. The proposed approaches were implemented in the Open64/ORC compiler, and evaluated on loop nests from the Livermore, SPEC200 and NAS benchmarks.