Multi-dimensional Kernel Generation for Loop Nest Software Pipelining

Single-dimension Software Pipelining (SSP) has been proposed as an effective software pipelining technique for multi-dimensional loops [16]. 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 level-by-level 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 flat method, which schedules operations from different loop levels with the same priority, and the hybrid method, which uses the level-by-level mechanism for the innermost level and ...

• Type: Conference
• Year: 2006
• Where: EUROPAR
• Authors: Alban Douillet, Hongbo Rong, Guang R. Gao
• Keywords: Distributed And Parallel Computing, EUROPAR 2006, Modulo Scheduling, Scheduling Constraint, Software Pipelining