An approximation algorithm for scheduling malleable tasks under general precedence constraints

ACM Transactions on Algorithms

Volumn 2, Issue 3, 2006, Pages 416-434

  Jansen, Klaus ^a   Zhang, Hu ^b  

^a UNIVERSITY OF KIEL   (Germany)

^b MCMASTER UNIVERSITY   (Canada)

Author keywords

Approximation algorithms; Malleable tasks; Precedence constraints; Scheduling

Indexed keywords

APPROXIMATION ALGORITHM; MALLEABLE TASKS; PRECEDENCE CONSTRAINTS;

APPROXIMATION THEORY; CONSTRAINT THEORY; PROBLEM SOLVING; SCHEDULING;

ALGORITHMS;

EID: 33749000266     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1159892.1159899     Document Type: Article

References (22)

1. BLAYO, E., DEBRUE, L., MOUNIÉ, G., AND TRYSTRAM, D. 1999. Dynamic load balancing for ocean circulation with adaptive meshing. In Proceedings of the 5th European Conference on Parallel Computing (Euro-Par 1999). Lecture Notes in Computer Science, Vol. 1685. Springer-Verlag, New York, 303-312.
2. CULLER, D. E., KARP, R., PATTERSON, D., SAHAY, A., SANTOS, E., SCHAUSER, K., SUBRAMONIAN, R., AND VON EICKEN, T. 1996. LogP: A practical model of parallel computation. Commun. ACM 39, 11, 78-85.
3. CULLER, D. E., SINGH, J. P., AND GUPTA, A. 1999. Parallel Computer Architecture: A Hardware/Software Approach. Morgan, Kaufmann, San Francisco, CA.
4. DU, J., AND LEUNG, J. 1989. Complexity of scheduling parallel task systems. SIAM J. Disc. Math. 2, 473-487.
5. DUTOT, P.-F., MOUNIÉ, G., AND TRYSTRAM, D. 2004. Scheduling parallel tasks - Approximation algorithms. In Handbook of Scheduling: Algorithms, Models, and Performance Analysis, J. Y.-T. Leung, Eds. CRC Press, Boca Raton, FL.
6. GAREY, M., AND GRAHAM, R. 1975. Bounds for multiprocessor scheduling with resource constraints. SIAM J. Comput. 4, 187-200.
7. GRAHAM, R. L. 1966. Bounds for certain multiprocessing anomalies. Bell Syst. Tech. J. 45, 1563-1581.
8. HWANG, J. J., CHOW, Y. C., ANGER, F. D., AND LEE, C. Y. 1989. Scheduling precedence graphs in systems with interprocessor communication times. SIAM J. Comput. 18, 2, 244-257.
9. JANSEN, K. 2004. Scheduling malleable parallel tasks: An asymptotic fully polynomial-time approximation scheme. Algorithmica 39, 1, 59-81.
10. JANSEN, K., AND PORKOLAB, L. 2002. Linear-time approximation schemes for scheduling malleable parallel tasks. Algorithmica 32, 3, 507-520.
11. JANSEN, K., AND ZHANG, H. 2005. Scheduling malleable tasks with precedence constraints. In Proceedings of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), ACM, New York, 86-95.
12. KALINOWSKI, T., KORT, I., AND TRYSTRAM, D. 2000. List scheduling of general task graphs under LogP. Paral Comput. 26, 9, 1109-1128.
13. LENSTRA, J. K., and RINNOOY KAN, A. H. G. 1978. Complexity of scheduling under precedence constraints. Oper. Res. 26, 22-35.
14. LEPÈRE, R., MOUNIÉ, G., AND TRYSTRAM, D. 2002a. An approximation algorithm for scheduling trees of malleable tasks. Europ. J. Oper. Res. 142, 2, 242-249.
15. LEPÈRE, R., TRYSTRAM, D., AND WOEGINGER, G. J. 2002b. Approximation algorithms for scheduling malleable tasks under precedence constraints. Inter. J. Found. Comput. Sci. 13, 4, 613-627.
16. LUDWIG, W., AND TIWARI, P. 1994. Scheduling malleable and nonmalleable parallel tasks. In Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms (SODA 1994). ACM, New York, 167-176.
17. MOUNIÉ, G., RAPINE, C., AND TRYSTRAM, D. 1999. Efficient approximation algorithms for scheduling malleable tasks. In Proceedings of the 11th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 1999). ACM, New York, 23-32.
18. MOUNIÉ, G., RAPINE, C., AND TRYSTRAM, D. 2002. A 3/2-dual approximation algorithm for scheduling independent monotonie malleable tasks, manuscript. http://www.id.imag.fl/Laboratorie/Membres/Trystram_Denis/publis_mallen.
19. PRASANNA, G. N. S., and MUSICUS, B. R. 1991. Generalised multiprocessor scheduling using optimal control. In Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 1991). ACM, New York, 216-228.
20. SKUTELLA, M. 1998. Approximation algorithms for the discrete time-cost tradeoff problem. Math. Oper. Res. 23, 909-929.
21. TUREL, J., WOLF, J., and YU, P. 1992. Approximate algorithms for scheduling parallelizable tasks. In Proceedings of the 4th Annual Symposium on Parallel Algorithms and Architectures (SPAA 1992). ACM, New, York, 323-332.
22. ZHANG, H. 2004. Approximation algorithms for min-max resource sharing and malleable tasks scheduling, Ph.D. dissertation University of Kiel, Kiel Germany, 2004.