Optimal parallel processing of random task graphs

Journal of Scheduling

Volumn 4, Issue 3, 2001, Pages 139-156

  Liu, Zhen ^a   Righter, Rhonda ^b  

^a INRIA   (France)

^b SANTA CLARA UNIVERSITY   (United States)

Author keywords

Flowtime; Makespan; Parallel processing; Precedence constraints; Random task graph; Stochastic scheduling

Indexed keywords

EID: 0347752607     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1002/jos.70     Document Type: Article

References (9)

1. Chretienne P, Coffman EG, Lenstra JK, Liu Z (eds). Scheduling Theory and Its Applications. Wiley: New York, 1995.
2. Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB. Sequencing and scheduling: algorithms and complexity. Report BS-R8909, CWI, Amsterdam, The Netherlands, 1989.
3. Liu Z, Sanlaville E. Profile scheduling by list algorithms. In Scheduling Theory and Its Applications. Chretienne P et al. (eds). Wiley: New York, 1995; 95-114.
4. Pinedo M. Scheduling: Theory, Algorithms, and Systems. Prentice-Hall: Englewood Cliffs, NJ, 1995.
5. Liu Z, Righter R. Optimal scheduling on parallel processors with precedence constraints and general costs. Problems in the Engineering and Information Science 1997; 11:79-93.
6. Liu Z. Scheduling of random task graphs on parallel processors. MASCOTS '95 Workshop on Modeling and Analysis of Simulation of Computer and Telecommunication Systems. 1995; 143-147.
7. Garey MR, Johnson DS, Tarjan RE, Yannakakis M. Scheduling opposite forests. SIAM Journal of Algebraic and Discrete Methods 1983; 4:72-93.
8. Coffman EG, Liu Z. On the optimal stochastic scheduling of out-forests. Operations Research 1992; 40(S1): S67-S75.
9. Liu Z. Dynamic scheduling of parallel computations. Theoretical Computer Science 2000; 246:239-252.