I.D. Baev, W.M. Meleis, A. Eichenberger, "Lower bounds on precedence-constrained scheduling for parallel processors,"In Proc. of the 29th International Conference on Parallel Processing, 2000, pp. 549-553. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Dynamic, Reliability-driven Scheduling of Parallel Real-time.. - Qin, Jiang (2001) (Correct)
....their applications to offline scheduling only. Furthermore, most of these real time scheduling algorithms are designed for homogeneous systems, making them unsuitable for heterogeneous systems. In the literature, parallel tasks are often represented by a directed acyclic graph (DAG) 20] 27][2][4] 12] Paper [27] describes a runtime parallel incremental DAG scheduling approach. Paper [4] presents a scheduling algorithm for a parameterized DAG, which first derives symbolic linear clusters and then assigns task clusters to processors. The scheduling algorithms for DAGs in these two ....
I.D. Baev, W.M. Meleis, A. Eichenberger, "Lower bounds on precedence-constrained scheduling for parallel processors,"In Proc. of the 29th International Conference on Parallel Processing, 2000, pp. 549-553.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC