New Heuristics for Rotation Scheduling

- For an iterative process to be parallelized, the operations that comprise the process must be organized into a correct schedule that will allow the hardware to compute the task. The focus of our research is rotation scheduling, a list-scheduling-based method for producing compact, static schedules for iterative processes on parallel hardware. We present three new heuristics based on rotation scheduling, half-rotation, best span, and random rotation, and compare them with existing methods. We discuss problems with existing methods, and provide statistical evidence supporting random rotation as an effective alternative that avoids these problems.

• Type: Conference
• Year: 2008
• Where: PDPTA
• Authors: Michael Richter, David Poeschl, Timothy W. O'Neil
• Keywords: Distributed And Parallel Computing, Iterative Process, PDPTA 2008, Random Rotation, Rotation Scheduling