Add to ORKGThe problem of scheduling two or more processors to minimize the execution time of a program which consists of a set of partially ordered tasks is studied. Cases where task execution times are deterministic and others in which execution times are random variables are analyzed. It is shown that different algorithms suggested in the literature vary significantly in execution time and that the B-schedule of Coffman and Graham is near-optimal. A dynamic programming solution for the case in which execution times are random variables is presented
We present complexity results which have influence on the strength of list scheduling in a parallel ...
Static scheduling of a program represented by a directed task graph on a multiprocessor system to mi...
Parallel processor scheduling to minimize maximum tardiness with uniform processors is investigated....
The problem of scheduling two or more processors to minimize the execution time of a program which c...
We consider the problem of scheduling n jobs on m identical parallel machines to minimize a regular ...
Given a parallel program to be executed on a heterogeneous computing system, the overall execution t...
We consider the problem of processing a given number of tasks on a given number of processors as qui...
The lower and upper bounds on the minimum time needed to process a given directed acyclic task graph...
Communicated by Susumu Matsumae This paper studies task scheduling algorithms which schedule a set o...
Abstract—The way the processes in a parallel program are scheduled on the processors of a multiproce...
The notion of profile scheduling was first introduced by Ullman in 1975 in the complexity analysis o...
In this work scheduling multiprocessor tasks on two parallel identical processors is considered. Mul...
We consider the problem of processing a given number of tasks on a given number of processors as qui...
Multiprocessor tasks are executed by more than one processor at the same moment of time, This work c...
In this work scheduling multiprocessor tasks on two parallel identical processors is considered. Mul...
We present complexity results which have influence on the strength of list scheduling in a parallel ...
Static scheduling of a program represented by a directed task graph on a multiprocessor system to mi...
Parallel processor scheduling to minimize maximum tardiness with uniform processors is investigated....
The problem of scheduling two or more processors to minimize the execution time of a program which c...
We consider the problem of scheduling n jobs on m identical parallel machines to minimize a regular ...
Given a parallel program to be executed on a heterogeneous computing system, the overall execution t...
We consider the problem of processing a given number of tasks on a given number of processors as qui...
The lower and upper bounds on the minimum time needed to process a given directed acyclic task graph...
Communicated by Susumu Matsumae This paper studies task scheduling algorithms which schedule a set o...
Abstract—The way the processes in a parallel program are scheduled on the processors of a multiproce...
The notion of profile scheduling was first introduced by Ullman in 1975 in the complexity analysis o...
In this work scheduling multiprocessor tasks on two parallel identical processors is considered. Mul...
We consider the problem of processing a given number of tasks on a given number of processors as qui...
Multiprocessor tasks are executed by more than one processor at the same moment of time, This work c...
In this work scheduling multiprocessor tasks on two parallel identical processors is considered. Mul...
We present complexity results which have influence on the strength of list scheduling in a parallel ...
Static scheduling of a program represented by a directed task graph on a multiprocessor system to mi...
Parallel processor scheduling to minimize maximum tardiness with uniform processors is investigated....