#### Filter Results:

#### Publication Year

1995

2016

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

This paper introduces a new list scheduling algorithm that uses greedy duplication to solve a scheduling problem with communication delays and resource 1 limitations. We prove that, for any priority list, its worst case relative performance is bounded by 2 ? 1 m and that this bound is tight.

We consider a general class of precedence-constrained scheduling problems on identical parallel machines, whereby a nonnegative precedence delay d ij is associated with each precedence-constrained job pair (i; j), with the following meaning: in every feasible schedule, job j cannot start until d ij time units after job i is completed. Special cases include… (More)

This paper deenes and studies an approximation algorithm for scheduling tasks with small communication delays on m processors. In a rst step, a schedule 1 for the problem instance with an unlimited number of processors is generated with a polynomial algorithm with relative performance bounded by 2(1 +) 2 + , where denotes the ratio between the greatest… (More)

In this paper, we consider a nite set of generic tasks that we execute a large number of times. We introduce the linear constraints between two generic tasks : the diierence of iteration indices between the execution of two tasks subject to a precedence constraint is a linear function of these indices. These constraints are modeled by a linear graph G.… (More)

—Synchronous Dataflow graphs, introduced by Lee and Messerschmitt in 1987, are a well-known formalism commonly used to model data-exchanges between parallel processes. This model was extensively studied in the last two decades because of the importance of its applications. However, the determination of a maximal throughput is a difficult question, for which… (More)