Scheduling parallel tasks approximation algorithms

Handbook of Scheduling: Algorithms, Models, and Performance Analysis

Volumn , Issue , 2004, Pages 26-1-26-24

  Dutot, Pierre François ^a   Mounié, Grégory ^b   Trystram, Denis ^c  

^a CNRS   (France)

^b INP Grenoble ENSIMAG   (France)

^c GRENOBLE INSTITUTE OF TECHNOLOGY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84880858792     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Chapter

References (46)

1. J. Blażewicz, K. Ecker, E. Pesch, G. Schmidt, and J. W glarz. Scheduling in Computer andManufacturing Systems. Springer-Verlag, Heidelberg, 1996.
2. M. Pinedo. Scheduling: Theory, Algorithms, and Systems. Prentice-Hall, Englewood Cliffs, 1995.
3. P. Brucker. Scheduling. Akademische Verlagsgesellschaft, Wiesbaden, 1981.
4. A. Gerasoulis and T. Yang. PYRROS: static scheduling and code generation for message passing multiprocessors. In Proceedings of the 6th ACM International Conference on Supercomputing, pages 428–437, ACM, July 1992.
5. M.-Y. Wu and D. Gajski, Hypertool: A programming aid for message-passing systems. IEEE Transactions on Parallel and Distributed Systems, 1(3):330–343, 1990.
6. D. E. Culler, J. P. Singh, and A. Gupta, Parallel Computer Architecture: A Hardware/Software Approach. Morgan Kaufmann Publishers, Inc., San Francisco, CA, 1999.
7. 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):244–257, April 1989.
8. D. Culler, R. Karp, D. Patterson, A. Sahay, E. Santos, K. Schauser, R. Subramonian, and T. von Eicken. Log P: A practical model of parallel computation. Communications of the ACM, 39(11):78–85, 1996.
9. T. Kalinowski, I. Kort, and D. Trystram, List scheduling of general task graphs under LogP. Parallel Computing, 26(9):1109–1128, July 2000.
10. D. Trystram and W. Zimmermann. On multi-broadcast and scheduling receive-graphs under logp with long messages. In S. Jaehnichen and X. Zhou, editors, The Fourth International Workshop on Advanced Parallel Processing Technologies—APPT 01, pages 37–48, Ilmenau, Germany, September 2001.
11. E. Bampis, A. Giannakos, and J.-C. König. On the complexity of scheduling with large communication delays. European Journal of Operational Research, 94(2):252–260, 1996.
12. D. G. Feitelson. Scheduling parallel jobs on clusters. In Rajkumar Buyya, editor, High Performance Cluster Computing, Vol. 1, Chap. 21, Architectures and Systems, pages 519–533. PrenticeHall, Upper Saddle River, NJ, 1999.
13. A. Lodi, S. Martello, and M. Monaci, Two-dimensional packing problems: A survey. European Journal of Operational Research, 141(2):241–252, 2002.
14. I. Foster. Designing and Building Parallel Programs: Concepts and Tools for Parallel Software Engineering. Addison-Wesley, Reading, MA, 1995.
15. A. S. Tanenbaum and M. van Steen. Distributed Systems: Principles and Paradigms. Prentice Hall, Upper Saddle River, NJ, 2002.
16. E. G. Coffman and P. J. Denning, Operating System Theory. Prentice Hall, New York 1972.
17. E. Jeannot. Allocation de graphes de tˆaches paramétrés et génération de code. PhD thesis, Ecole Normale Supérieure de Lyon et Ecole Doctorale Informatique de Lyon, 1999.
18. H. Shachnai and J. Turek, Multiresource malleable task scheduling to minimize response time. Information Processing Letters, 70:47–52, 1999.
19. F. Afrati, E. Bampis, A. V. Fishkin, K. Jansen, and C. Kenyon, Scheduling to minimize the average completion time of dedicated tasks. Lecture Notes in Computer Science, 1974, 2000.
20. D. Hochbaum, editor. Approximation Algorithms for NP-hard Problems. PWS, September 1996.
21. R. P. Brent. The parallel evaluation of general arithmetic expressions. Journal of the ACM, 21(2):201–206, July 1974.
22. R. L. Graham. Bounds onmultiprocessing timing anomalies. SIAM Journal on AppliedMathematics, 17(2):416–429, March 1969.
23. M. Drozdowski. Scheduling multiprocessor tasks—an overview. European Journal of Operational Research, 94(2):215–230, 1996.
24. B. Monien, T. Decker, and T. Lücking. A 5/4-approximation algorithm for scheduling identical malleable tasks. Technical Report tr-rsfb-02-071, University of Paderborn, 2002.
25. J. Turek, J. Wolf, and P. Yu, Approximate algorithms for scheduling parallelizable tasks. In 4th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 323–332, 1992.
26. A. Steinberg. A strip-packing algorithm with absolute performance bound 2. SIAM Journal on Computing, 26(2):401–409, 1997.
27. M. R. Garey and R. L. Graham, Bounds on multiprocessor scheduling with resource constraints. SIAM Journal on Computing, 4:187–200, 1975.
28. G. Mounié. Ordonnancement efficace d’application parallèles: les tˆaches malléables monotones. PhD thesis, INP Grenoble, juin 2000.
29. D. S. Hochbaum and D. B. Shmoys, Using dual approximation algorithms for scheduling problems: theoretical and practical results. Journal of the ACM, 34:144–162, 1987.
30. G. Mounié, C. Rapine, and D. Trystram. A 3/2-dual approximation algorithm for scheduling independent monotonic malleable tasks. Technical report, ID-IMAGLaboratory, 2000. http://wwwid.imag.fr/~trystram/publismalleable.
31. K. Jansen and L. Porkolab, Linear-time approximation schemes for scheduling malleable parallel tasks. Algorithmica, 32(3):507, 2002.
32. R. Lepère, D. Trystram, and G. J. Woeginger, Approximation scheduling for malleable tasks under precedence constraints. In 9th Annual European Symposium on Algorithms — ESA 2001, number 2161 in LNCS, pages 146–157, Springer-Verlag, Heidelberg, 2001.
33. G. N. S. Prasanna and B. R. Musicus, Generalisedmultiprocessor scheduling using optimal control. In 3rd Annual ACMSymposium on Parallel Algorithms and Architectures, pages 216–228, ACM, 1991.
34. J. W glarz. Modelling and control of dynamic resource allocation project scheduling systems, in Optimization and Control of Dynamic Operational Research Models. North-Holland, Amsterdam, 1982.
35. A. Feldmann, M-Y. Kao, and J. Sgall, Optimal on-line scheduling of parallel jobs with dependencies. In 25th Annual ACM Symposium on Theory of Computing, pages 642–651, San Diego, CA, 1993. url: http://www.ncstrl.org, CS-92-189.
36. J. Blażewicz, M. Machowiak, G. Mounié, and D. Trystram. Approximation algorithms for scheduling independent malleable tasks. In Europar 2001, number 2150 in LNCS, pages 191–196. Springer- Verlag, Heidelberg, 2001.
37. J. Sgall. On-line scheduling. Lecture Notes in Computer Science, 1442:196–231, 1998, chap. 9.
38. D. B. Shmoys, J. Wein, and D. P. Williamson, Scheduling parallel machine on-line. SIAM Journal on Computing, 24(6):1313–1331, 1995.
39. J. Blażewicz, K. Ecker, B. Plateau, and D. Trystram, Handbook on Parallel and Distributed Processing. International handbooks on information systems. Springer, New York, 2000.
40. C. Rapine, I. Scherson, and D. Trystram, On-line scheduling of parallelizable jobs. In Proceedings of EUROPAR’98, number 1470 in LNCS, pages 322–327, Springer Verlag, Heidelberg, 1998.
41. A. Tchernykh and D. Trystram, On-line scheduling of multiprocessor jobs with idle regulation. In Proceedings of PPAM’03, 2003 (Unpublished).
42. U. Schwiegelshohn, W. Ludwig, J. Wolf, J. Turek, and P. Yu, Smart SMART bounds for weighted response time scheduling. SIAM Journal on Computing, 28, 1998.
43. C. A. Phillips, C. Stein, E. Torng, and J. Wein, Optimal time-critical scheduling via resource augmentation (extended abstract). In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 140–149, El Paso, TX, 1997.
44. L. A. Hall, A. S. Schulz, D. B. Shmoys, and J. Wein, Scheduling to minimize average completion time: Off-line and on-line approximation algorithms. Mathematics of Operations Research, 22:513–544, 1997.
45. P.-F. Dutot and D. Trystram. Scheduling on hierarchical clusters using malleable tasks. In Proceedings of the 13th annual ACM symposium on Parallel Algorithms and Architectures — SPAA 2001, pages 199–208, SIGACT/SIGARCH and EATCS, ACM Press, Crete Island, July 2001.
46. D. G. Feitelson and L. Rudolph, Parallel job scheduling: Issues and approaches. Lecture Notes in Computer Science, 949:1–18, 1995.