| Abstract |
|---|
| This paper addresses the following scheduling problem: given aprecedence graph with communication delays and a machine architecturewith different types of processors, construct a schedule that runs onthe given architecture at the minimum possible execution time. Themain contribution is to develop a new scheduling algorithm that keepsprocessors idle for future important tasks and fills idle time slotsincurred due to interprocessor communication. Experiments show thatthis algorithm produces better schedules. |
| Contact |
| Dingchao Li Educational Center for Information Processing,Nagoya Institute of Technology,Gokisocho Showaku,466,Nagoya,Japan liding@center.nitech.ac.jp |