Booking heterogeneous processor resources to reduce communication overhead

This paper discusses how to schedule tasks of a parallel program onto heterogeneous machines with non-negligible interprocessor comnmnication. In order t,o get. a I~et.ter estinmte of the scheduling priority of a task in the face of contmunication delays, recent theoretical rest, Its are incorporated in the computation of the tasks' execution ranges. A strategy that books processor resources is also introduced to avoid unnecessary commulfication overhead. Both analytical and sinmla-tion results show the effectiveness and efficiency of the scheduling technique.