A 3/2-approximation algorithm for scheduling independent monotonic malleable tasks

SIAM Journal on Computing

Volumn 37, Issue 2, 2007, Pages 401-412

  Mounie, Gregory ^a   Rapine, Christophe ^b   Trystram, Denis ^a  

^a ID IMAG   (France)

^b GRENOBLE INSTITUTE OF TECHNOLOGY   (France)

Author keywords

Malleable tasks; Performance guarantee; Polynomial approximation; Scheduling

Indexed keywords

COMPUTATIONAL METHODS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; PROGRAM PROCESSORS; RESOURCE ALLOCATION; SCHEDULING; SCHEDULING ALGORITHMS;

DUAL APPROXIMATION TECHNIQUES; KNAPSACK PROBLEMS; MALLEABLE TASKS; PERFORMANCE GUARANTEE;

APPROXIMATION ALGORITHMS;

EID: 38049155264     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539701385995     Document Type: Article

References (24)

1. B. S. BAKER, E. G. COFFMAN, JR., AND R. L. RIVEST, Orthogonal packings in two dimensions, SIAM J. Comput., 9 (1980), pp. 846-855.
2. R. P. BRENT, The parallel evaluations of general arithmetic expressions, J. ACM, 21 (1974), pp. 201-206.
3. E. G. COFFMAN, JR., M. R. GAREY, D. S. JOHNSON, AND R. E. TARJAN, Performance bounds for level-oriented two-dimensional packing algorithms, SIAM J. Comput., 9 (1980), pp. 808-826.
4. J. DU AND J. Y-T. LEUNG Complexity of scheduling parallel task systems, SIAM J. Discrete Math., 2 (1989), pp. 473-487.
5. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, New York, 1979.
6. A. GERASOULIS AND T. YANG, PYRROS: Static scheduling and code generation for message passing multiprocessors, in Proceedings of the 6th ACM International Conference on Supercomputiug, ACM, 1992, pp. 428-437.
7. R. L. GRAHAM, Bounds on multiprocessing timing anomalies, SIAM J. Appl. Math., 17 (1969), pp. 416-429.
8. C. HANEN AND A. MUNIER, An approximation algorithm for scheduling dependent tasks on m processors with smalt communication delays, Discrete Appl. Math., 108 (2001), pp. 239-257.
9. D. S. HOCHBAUM AND D. B. SHMOYS, Using dual approximation algorithms for scheduling problems: Theoretical and practical results, J. ACM, 34 (1987), pp. 144-162.
10. J. HOOGEVEEN, J.-K. LENSTRA. AND B. VELTMAN, Three, four, five, six, or the complexity of scheduling with communication delays, Oper. Res. Lett., 16 (1994), pp. 129-137.
11. K. JANSEN AND L. PORKOLAB, Linear-time approximation schemes for scheduling malleable parallel tasks, in Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 99), Baltimore, MD, 1999, pp. 490-498.
12. C. KENYON AND E. ERIC RÉMILA, Approximate strip packing, in 37th Annual Symposium on Foundations of Computer Science, (Burlington, VT 1996), IEEE Computer Society Press, Los Alamitos, CA, 1996, pp. 31-36.
13. W. T. LUDWIG, Algorithms for Scheduling Malleable and Nonmalleable Parallel Tasks, Ph.D. thesis, Department of Computer Sciences, University of Wisconsin-Madison, Madison, WI, 1995.
14. W. LUDWIG AND P. TIWARI, Scheduling malleable and nonmalleable parallel tasks, in Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, D. D. Sleator, ed., Arlington, VA, 1994, pp. 167-176.
15. S. MARTELLO AND P. TOTH, Knapsack Problems: Algorithms and Computer Implementations, Wiley, New York, 1990.
16. G. MOUNIÉ, C. RAPINE, AND D. TRYSTRAM, Efficient approximation algorithms for scheduling malleable tasks, in Proceedings of the Eleventh ACM Symposium on Parallel Algorithms and Architectures (SPAA'99), ACM Press, New York, 1999, pp. 23-32.
17. M. A. PALIS. J.-C. LIOU, AND D. S. L. WEI, Task clustering and scheduling for distributed memory parallel architectures, IEEE Trans. Parallel and Distributed Systems, 7 (1996), pp. 46-55.
18. C. H. PAPADIMITRIOU AND M. YANNAKAKIS, Towards an architecture-independent analysis of parallel algorithms, SIAM J. Comput., 19 (1990), pp. 322-328.
19. C. H. PAPADIMITRIOU, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
20. G. N. SRINIVASA PRASANNA AND B. R. MUSICUS, Generalised multiprocessor scheduling using optimal control, in Proceedings of the Third Annual ACM Symposium on Parallel Algorithms and Architectures, ACM Press, New York, 1991, pp. 216-228.
21. V. J. RAYWARD-SMITH, UET scheduling with unit interprocessor communication delays, Discrete Appl. Math., 18 (1987), pp. 55-71.
22. V. SARKAR, Partitioning and Scheduling Parallel Programs for Multiprocessors, Pitman, London, 1989.
23. A. STEINBERG, A strip-packing algorithm with absolute performance bound 2, SIAM J. Comput., 26 (1997), pp. 401-409.
24. J. TUREK, J. WOLF, AND P. YU, Approximate algorithms for scheduling parallelizable tasks, in Proceedings of the Fourth Annual ACM Symposium on Parallel Algorithms and Architectures, 1992, pp. 323-332.