Scheduling UET-UCT series-parallel graphs on two processors

Theoretical Computer Science

Volumn 162, Issue 2, 1996, Pages 323-340

  Finta, Lucian ^a   Liu, Zhen ^a   Mills, Ioannis ^a   Bampis, Evripidis ^b  

^a INRIA   (France)

^b UNIVERSITÉ D EVRY VAL D ESSONNE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; PARALLEL PROCESSING SYSTEMS; SCHEDULING;

IDENTICAL PROCESSORS; TASK GRAPHS; UNIT COMMUNICATION TIME DELAY; UNIT EXECUTION TIME DELAY;

COMPUTER SYSTEMS;

EID: 0030212249     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(96)00035-7     Document Type: Article

References (16)

1. H.M. Abdel-Wahab and T. Kameda, Scheduling to minimize maximum cumulative cost subject to series-parallel precedence constraints, Oper. Res. 26 (1978) 141-158.
2. P. Chretienne and C. Picouleau, Scheduling with communication delays: a survey, in: P. Chretienne et al. Eds., Scheduling Theory and Its Applications (Wiley, New York, 1995).
3. L. Finta and Z. Liu, Scheduling of parallel programs in single-bus multiprocessor systems, Rapport de Recherche INRIA, No. 2302, 1994, submitted.
4. R.L. Graham, E.L. Lawler, J.K. Lenstra and K. Rinnooy Kan, Optimization and approximation in deterministic scheduling: a survey, Ann. Discrete Math. 5 (1979) 287-326.
5. F. Guinand and D. Trystram, Optimal scheduling of UECT trees on two processors, Technical Report APACHE RR-93-03, IMAG, Grenoble, 1993.
6. E.L. Lawler, Sequencing jobs to minimize total weighted completion time subject to precedence constraints, Ann. Discrete Math. 2 (1978) 75-90.
7. E. Lawler, Scheduling trees on multiprocessors with unit communication delays, in: Proc. Workshop on Models and Algorithms for Planning and Scheduling Problems (Villa Vigoni, Lake Como, Italy, 1993).
8. C. Picouleau, Etude des problèmes d'optimisation dans les systèmes distribués, Ph.D. Thesis, Université Pierre et Marie Curie, France, 1992.
9. V.J. Rayward-Smith, UET scheduling with unit interprocessor communication delays, Discrete Appl. Math. 18 (1987) 55-71.
10. R.A. Sahner and K.S. Trivedi, SPADE: a tool for performance and reliability evaluation, in: Proc. Modelling Techniques and Tools for Performance Analysis'85, N. Abu El Ata, Ed. (1986) 147-163.
11. K. Takamizawa, T. Nishizeki and N. Saito, Linear-time computability of combinatorial problems on series-parallel graphs, J. ACM 18 (1982) 623-641.
12. J. Valdes, R.E. Tarjan and E.L. Lawler, The recognition of series parallel digraphs, SIAM J. Comput. 11 (1982) 298-313.
13. T. Varvarigou, V.P. Roychowdhury and T. Kailath, Scheduling in and out forests in the presence of communication delays, in: Proc. Internat. Parallel Processing Symp. (Newport Beach, CA, 1993) 222-229.
14. M. Veldhorst, A linear time algorithm to schedule trees with communication delays optimally on two machines, Technical Report COSOR 93-07, Dept. Math. Comput. Sci., Eindhoven Univ. Technology, 1993.
15. B. Veltman, Multiprocessor scheduling with communication delays, Ph.D. Thesis, CWI-Amsterdam, 1993.
16. B. Veltman, B.J. Lageweg and J.K. Lenstra, Multiprocessor scheduling with communication delays, Parallel Comput. 16 (1990) 173-182.