The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—Task scheduling is an important aspect of parallel programming. Most of the heuristics for this NP-hard problem are based on a very simple system model of the target parallel system. Experiments revealed the inappropriateness of this classic model to obtain accurate and efficient schedules for real systems. In order to overcome this shortcoming, a new scheduling model was proposed that considers the contention for communication resources. Even though the accuracy and efficiency improved with the consideration of contention, the new contention model is still not good enough. The crucial aspect is the involvement of the processor in communication. This paper investigates the involvement of the processor in communication and its impact on task scheduling. A new system model is proposed based on the contention model that is aware of the processor involvement. The challenges for the scheduling techniques are analyzed and two scheduling algorithms are proposed. Experiments on real parallel systems show the significantly improved accuracy and efficiency of the new model and algorithms.</p>
Parallel processing, concurrent programming, scheduling and task partitioning, processor involvement, heterogeneous system model.

O. Sinnen, F. Eika Sandnes and L. A. Sousa, "Toward a Realistic Task Scheduling Model," in IEEE Transactions on Parallel & Distributed Systems, vol. 17, no. , pp. 263-275, 2006.
82 ms
(Ver 3.3 (11022016))