Lower bounds on precedence-constrained scheduling for parallel processors |
| |
Authors: | Ivan D BaevWaleed M Meleis Alexandre Eichenberger |
| |
Affiliation: | a Department of Electrical and Computer Engineering, Northeastern University, Boston, MA 02115, USA b Department of Electrical and Computer Engineering, NC State University, Raleigh, NC 27695, USA |
| |
Abstract: | We consider two general precedence-constrained scheduling problems that have wide applicability in the areas of parallel processing, high performance compiling, and digital system synthesis. These problems are intractable so it is important to be able to compute tight bounds on their solutions. A tight lower bound on makespan scheduling can be obtained by replacing precedence constraints with release and due dates, giving a problem that can be efficiently solved. We demonstrate that recursively applying this approach yields a bound that is provably tighter than other known bounds, and experimentally shown to achieve the optimal value at least 90.3% of the time over a synthetic benchmark.We compute the best known lower bound on weighted completion time scheduling by applying the recent discovery of a new algorithm for solving a related scheduling problem. Experiments show that this bound significantly outperforms the linear programming-based bound. We have therefore demonstrated that combinatorial algorithms can be a valuable alternative to linear programming for computing tight bounds on large scheduling problems. |
| |
Keywords: | Scheduling Parallel processing Lower bounds |
本文献已被 ScienceDirect 等数据库收录! |
|