Scheduling malleable tasks with precedence constraints

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2005, Pages 86-95

  Jansen, Klaus ^a   Zhang, Hu ^b  

^a UNIVERSITY OF KIEL   (Germany)

^b MCMASTER UNIVERSITY   (Canada)

Author keywords

Approximation algorithms; Malleable tasks; Prece dence constraints; Scheduling

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; PROGRAM PROCESSORS;

APPROXIMATION ALGORITHMS; MALLEABLE TASKS;

SCHEDULING;

EID: 32144440468     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1073970.1073983     Document Type: Conference Paper

References (27)

1. A. Agarwal, D. Chaiken, K. Johnson, D. Kranz, J. Kubiatowicz, K. Kurihara, B.-H. Lim, G. Maa, and D. Nussbaum, The MIT Alewife machine: a large-scale distributed-memory multiprocessor, Proceedings of the 1st Workshop on Scalable Shared Memory Multiprocessors, 1991.
2. E. Blayo, L. Debrue, G. Mounié and D. Trystram, Dynamic load balancing for ocean circulation with adaptive meshing, Proceedings of the 5th European Conference on Parallel Computing, Euro-Par 1999, LNCS 1685, 303-312.
3. D. E. Culler, R. Karp, D. Patterson, A. Sahay, E.Santos, K. Schauser, R. Subramonian and T. von Eicken, LogP: A practical model of parallel computation, Communications of the ACM, 39 (11), (1996), 78-85.
4. D. E. Culler, J. P. Singh and A. Gupta, Parallel computer architecture: A hardware/software approach, Morgan Kaufmann Publishers, San Francisco, 1999.
5. J. Du and J. Leung, Complexity of scheduling parallel task systems, SIAM Journal on Discrete Mathematics, 2 (1989), 473-487.
6. P.-F. Dutot, G. Mounié and D. Trystram, Scheduling parallel tasks - approximation algorithms, in Handbook of Scheduling: Algorithms, Models, and Performance Analysis, J. Y.-T. Leung (Eds.), CRC Press, Boca Raton, 2004.
7. M. Garey and R. Graham, Bounds for multiprocessor scheduling with resource constraints, SIAM Journal on Computing, 4 (1975), 187-200.
8. R. L. Graham, Bounds for certain multiprocessing anomalies, Bell System Technical Journal, 45 (1966), 1563-1581.
9. J. J. Hwang, Y. C. Chow, F. D. Anger and C. Y. Lee, Scheduling precedence graphs in systems with interprocessor communication times, SIAM Journal on Computing, 18(2), (1989), 244-257.
10. K. Jansen, Scheduling malleable parallel tasks: an asymptotic fully polynomial-time approximation scheme, Proceedings of the 10th European Symposium on Algorithms, ESA 2002, LNCS 2461, 562-573.
11. K. Jansen and L. Porkolab, Linear-time approximation schemes for scheduling malleable parallel tasks, Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1999, 490-498.
12. K. Jansen and H. Zhang, Improved approximation algorithms for scheduling malleable tasks with precedence constraints, Technical Report, http://www.informatik.uni-kiel.de/~hzh/malle.ps.
13. K. Jansen and H. Zhang, An approximation algorithm for scheduling malleable tasks under general precedence constraints, manuscript.
14. T. Kalinowski, I. Kort and D. Trystram, List scheduling of general task graphs under LogP, Parallel Computing, 26(9), (2000), 1109-1128.
15. J. K. Lenstra and A. H. G. Rinnooy Kan, Complexity of scheduling under precedence constraints, Operations Research, 26 (1978), 22-35.
16. R. Lepère, G. Mounié and D. Trystram, An approximation algorithm for scheduling trees of malleable tasks, European Journal of Operational Research, 142(2), (2002), 242-249.
17. R. Lepère, D. Trystram and G. J. Woeginger, Approximation algorithms for scheduling malleable tasks under precedence constraints, International Journal of Foundations of Computer Science, 13(4), (2002), 613-627.
18. W. Ludwig and P. Tiwari, Scheduling malleable and nonmalleable parallel tasks, Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms, SODA 1994, 167-176.
19. G. Mounié, C. Rapine and D. Trystram, Efficient approximation algorithms for scheduling malleable tasks, Proceedings of the 11th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1999, 23-32.
20. G. Mounié, C. Rapine and D. Trystram, A 3/2-dual approximation algorithm for scheduling independent monotonic malleable tasks, manuscript.
21. G. N. S. Prasanna, Structure Driven Multiprocessor Compilation of Numeric Problems, Technical Report MIT/LCS/TR-502, Laboratory for Computer Science, MIT, April 1991.
22. G. N. S. Prasanna and B. R. Musicus, Generalised multiprocessor scheduling using optimal control, Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1991, 216-228.
23. G. N. S. Prasanna and B. R. Musicus, Generalized multiprocessor scheduling for directed acyclic graphs, Proceedings of Supercomputing 1994, 237-246.
24. G. N. S. Prasanna and B. R. Musicus, The Optimal Control Approach to Generalized Multiprocessor Scheduling, Algorithmica, 15(1), (1996), 17-49.
25. M. Skutella, Approximation algorithms for the discrete time-cost tradeoff problem, Mathematics of Operations Research, 23 (1998), 909-929.
26. J. Turel, J. Wolf and P. Yu, Approximate algorithms for scheduling parallelizable tasks, Proceedings of the 4th Annual Symposium on Parallel Algorithms and Architectures, SPAA 1992, 323-332.
27. H. Zhang, Approximation Algorithms for Min-Max Resource Sharing and Malleable Tasks Scheduling, PhD thesis, University of Kiel, Germany, 2004.