Approximation algorithms for scheduling malleable tasks under precedence constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2161, Issue , 2001, Pages 146-157

  Lepère, Renaud ^a   Trystram, Denis ^a   Woeginger, Gerhard J ^b  

^a Équipe VAlidation Spécification et COnstruction de logiciels   (France)

^b GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION; SCHEDULING ALGORITHMS;

MALLEABLE TASKS; OBJECTIVE CRITERIA; PARALLEL APPLICATION; PERFORMANCE GUARANTEES; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; PRECEDENCE CONSTRAINTS; SCHEDULING PROBLEM; TASK COMPLETION TIME;

APPROXIMATION ALGORITHMS;

EID: 84943254220     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44676-1_12     Document Type: Conference Paper

References (14)

1. E. Blayo, L. Debreu, G. Mounié, and D. Trystram [1999]. Dynamic load balancing for ocean circulation with adaptive meshing. Proceedings of the 5th European Conference on Parallel Computing, Springer LNCS 1685, 303-312.
2. M. Cosnard and D. Trystram [1995]. Parallel Algorithms and Architectures. International Thomson Publishing.
3. D. Culler, R. Karp, D. Patterson, A. Sahay, E. Santos, K. Schauser, R. Subramanian, and T. von Eicken [1996]. LogP: A practical model of parallel computation. Communications of the ACM 39, 78-85.
4. P. De, E.J. Dunne, J.B. Gosh, and C.E. Wells [1995]. The discrete time-cost tradeoff problem revisited. European Journal of Operational Research 81, 225-238.
5. P. De, E.J. Dunne, J.B. Gosh, and C.E. Wells [1997]. Complexity of the discrete time-cost tradeoff problem for project networks. Operations Research 45, 302-306.
6. M. Drozdowski [1996]. Scheduling multiprocessor tasks-An overview. European Journal of Operational Research 94, 215-230.
7. J. Du and J.Y.-T. Leung [1989]. Complexity of scheduling parallel task systems. SIAM Journal on Discrete Mathematics 2, 473-487.
8. A. Gerasoulis and T. Yang [1992]. PYRROS: Static scheduling and code generation for message passing multiprocessors. Proceedings of the 6th ACM International Conference on Supercomputing, 428-437.
9. R.L. Graham [1966]. Bounds for certain multiprocessing anomalies. Bell System Technical Journal 45, 1563-1581.
10. J.K. Lenstra and A.H.G. Rinnooy Kan [1978]. Complexity of scheduling under precedence constraints. Operations Research 26, 22-35.
11. R. Lepère, G. Mounié, B. Robič, and D. Trystram [1999]. Malleable tasks: An electromagnetic efficient model for solving actual parallel applications. Proceedings of the International Conference on Parallel Computing 99 (Parco'99), Imperial College Press, 598-605.
12. G.N.S. Prasanna and B.R. Musicus [1991]. Generalized multiprocessor scheduling using optimal control. Proceedings of the 3rd Annual Symposium on Parallel Algorithms and Architectures (SPAA'91), 216-228.
13. M. Skutella [1998]. Approximation algorithms for the discrete time-cost tradeoff problem. Mathematics of Operations Research 23, 909-929.
14. J. Turek, J. Wolf, and P. Yu [1992]. Approximate algorithms for scheduling parallelizable tasks. Proceedings of the 4th Annual Symposium on Parallel Algorithms and Architectures (SPAA'92), 323-332.