Home
Tags
No Tags
VARIATIONS ON ROTATION SCHEDULING
| Title: | VARIATIONS ON ROTATION SCHEDULING |
| Author: | Richter, Michael Edwin |
| Description: | The best way to increase the overall speed of a process is to increase the speed of the part of the process that takes the most time. Effective parallelization of iterative processes has been a focus of research, since the vast majority of computation performed by modern systems is iterative. For an iterative process to be parallelized, the operations that comprise the process must be organized into a schedule that will allow the hardware to correctly execute the instructions. 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 develop a technique called rotation spanto compute the complete space of schedules that can be produced by rotation scheduling. We use rotation span as a basis of comparison for priority functions that can be used in rotation scheduling. We present three new heuristics based on rotation scheduling, half-rotation, random rotation, and best span, and compare them with existing methods. We discuss problems with existing methods, and show that random rotation is an effective alternative that avoids these problems. |
| Permanent Link: |
http://rave.ohiolink.edu/etdc/view?acc_num=akron1185815419
http://hdl.handle.net/2374.OX/3889 |
| Date: | 2007 |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
|
There are no files associated with this item. |
|||