Scheduling parallel tasks — algorithms and complexity

Handbook of Scheduling: Algorithms, Models, and Performance Analysis

Volumn , Issue , 2004, Pages 25-1-25-25

  Drozdowski, Maciej ^a  

^a POZNAN UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (108)

1. Baker, K. R., Introduction to sequencing and scheduling, JohnWiley & Sons, New York, 1974.
2. Coffman E. G., Jr., ed., Scheduling in Computer and Job Shop Systems, J. Wiley, New York, 1976.
3. Conway, R. W., Maxwell, W. L., andMiller, L. W., Theory of Scheduling, Addison-Wesley, Reading MA, 1967.
4. Lloyd, E. L., Concurrent task systems, Operations Research, 29, 189–201, 1981.
5. Cirne, W., Using Moldability to Improve the Performance of Supercomputer Jobs, Ph. D. Thesis, Computer Science and Engineering, University of California, San Diego, 2001.
6. Cirne, W. and Berman, F., A model for moldable supercomputer jobs, Proceedings of 15th International Parallel & Distributed Processing Symposium, 2001.
7. Li, K. and Pan, Y., Probabilistic analysis of scheduling precedence constrained parallel tasks on multicomputers with contiguous processor allocation, IEEE Transactions on Computers, 49, 1021–1030, 2000.
8. Feitelson, D. G., Rudolph, L., Schwiegelshohn, U., Sevcik, K., and Wong, P., Theory and practice in parallel job scheduling, Lecture Notes in Computer Science 1291, Springer-Verlag, Berlin, 1–34, 1997.
9. Ratajczyk, E., Hybrid algorithms for scheduling multiprocessor tasks (in Polish), Ph. D. Thesis, Institute of Computing Science, Poznań University of Technology, 2001.
10. Dutot, P.-F., Ordonnancement de chaˆınes de tˆaches malléables, Proceedings of Ren Par’14, Hammamet, 2002.
11. Blażewicz, J., Ecker, K., Pesch, E., Schmidt, G., and Węglarz, J., Scheduling Computer andManufacturing Processes, Springer-Verlag, Berlin, 1996.
12. Brucker, P., Scheduling Algorithms, Springer-Verlag, Heidelberg, 1998.
13. Drozdowski, M., Scheduling multiprocessor tasks—an overview, European Journal of Operational Research, 94, 215–230, 1996.
14. Drozdowski, M., Selected problems of scheduling tasks in multiprocessor computer systems, Poznań University of Technology Press, Series: Monographs, No. 321, Poznań, 1997. http://www.cs.put.poznan.pl/~maciejd/txt/h.ps
15. Veltman, B., Lageweg, B. J., and Lenstra, J. K., Multiprocessor schedulingwith communication delays, Parallel Computing, 16, 173–182, 1990.
16. Feitelson, D. G., The forgotten factor: Facts on performance evaluation and its dependence on workloads, in B. Monien, R. Feldman, (eds.), Proceedings of Euro-Par 2002, Lecture Notes in Computer Science 2400, 49–60, 2002.
17. Parallel workload archive, http://www.cs.huji.ac.il/labs/parallel/workload
18. Coffman, E. G., Jr., Garey, M. R., and Johnson, D. S., Bin packing with divisible item sizes, Journal of Complexity, 3, 406–428, 1987.
19. Feitelson, D. G. and Rudolph, L., Distributed hierarchical control for parallel processing, IEEE Computer 23, 65–77, 1990.
20. Feitelson, D. G. and Rudolph, L., Evaluation of design choices for gang scheduling using distributed hierarchical control, Journal of Parallel and Distributed Computing, 35, 18–34, 1996.
21. Hori, A., Ishikawa, Y., Konaka, H., Maeda, M., and Tomokiyo, T., A scalable time-sharing scheduling for partitionable distributed memory parallel machines, in Proceedings of 28th Annual Hawaii International Conference on System Sciences (HICSS’95), 173–182, 1995.
22. Krueger, P., Lai, T.-H., and Dixit-Radiya, V. A., Job scheduling is more important than processor allocation for hypercube computers, IEEE Transactions on Parallel and Distributed Systems, 5, 488–497, 1994.
23. Ghosal, D., Serazzi, G., and Tripathi, S. K., The processor working set and its use in scheduling multiprocessor systems, IEEE Transactions on Software Engineering, 17, 443–453, 1991.
24. Kumar, M., Measuring parallelism in computation-intensive scientific/engineering applications, IEEE Transactions on Computers, 37, 1088–1098, 1988.
25. Choundhary, A. N., Narahari, B., Nicol, D. M., and Simha, R., Optimal processor assignment for a class of pipelined computations, IEEE Transactions on Parallel and Distributed Systems, 5, 439–445, 1994.
26. Ercan, M. F., Oguz, C., and Fung, Y. F., Performance evaluation of heuristics for scheduling pipelined multiprocessor tasks, in V. N. Alexandrov et al. (eds.), Proceedings of ICCS 2001, Lecture Notes in Computer Science 2073, 61–70, 2001.
27. Feitelson, D. G. and Rudolph, L., Gang scheduling performance benefits for fine-grain synchronization, Journal of Parallel and Distributed Computing, 16, 306–318, 1992.
28. Gehringer, E. F., Siewiorek, D. P., and Segall, Z., Parallel Processing: TheCm∗ Experience, Digital Press, 1987.
29. Ousterhout, J. K., Scheduling techniques for concurrent systems, in Proceedings of Third International Conference on Distributed Computing Systems, 22–30, 1982.
30. Zahorjan, J., Lazowska, E. D., and Eager, D. L., The effect of scheduling discipline on spin overhead in shared memory parallel systems, IEEE Transactions on Parallel and Distributed Systems, 2, 180–198, 1991.
31. Amdahl, G. M., Validity of the single processor approach to achieving large scale computing capabilities, in AFIPS Conference Proceedings (Atlantic City Apr. 18-20, 1967), vol. 30, AFIPS, 483–485, 1967.
32. Downey, A., Using queue time predictions for processor allocation, Lecture Notes in Computer Science 1291, Springer-Verlag, Berlin, 35–57, 1997.
33. Gustafson, J. L., Reevaluating Amdahl’s law, Communications of the ACM, 31, 532–533, 1988.
34. Avizienis, A., Gilley, G. C., Mathur, F. P., Rennels, D. A., Rohr, J. A., and Rubin, D. K., The STAR (self-testing and repairing) computer: An investigation of the theory and practice of fault-tolerant computer design. IEEE Transactions on Computers, 20, 1312–1321, 1971.
35. Hopkins, A. L., Lala, J. M., and Smith, T. B., FTMP—a highly reliable fault-tolerant multiprocessor for aircraft, in Proceedings of IEEE, 66, 1221–1239, 1978.
36. Kopetz, H. and Veríssimo, P., Real time and dependability concepts, in Mullender, S., (ed.), Distributed Systems, Addison-Wesley and ACM Press, Reading, MA, 411–446, 1994.
37. Czarnowski, J., Jȩdrzejowicz, P., and Ratajczyk, E., Scheduling fault-tolerant programs on multiple processors to maximize schedule reliability, in Felici, M., Kanoun, K. and Pasquini, A., (eds.), Computer Safety, Reliability and Security, Lecture Notes in Computer Science 1698, Springer, New York, 385–395, 1999.
38. Jędrzejowicz, P. and Wierzbowska, I., Scheduling multiple variant programs under hard real-time constraints, European Journal of Operational Research, 127, 458–465, 2000.
39. Drabowski M., Scheduling tasks in multimicroprocessor systems (in Polish), Ph. D. thesis, Poznań University of Technology, 1985.
40. Craig, G. L., Kime, C. R., and Saluja, K. K., Test scheduling and control for VLSI built-in self-test. IEEE Transactions on Computers, 37, 1099–1109, 1988.
41. Krawczyk, H. and Kubale, M., An approximation algorithm for diagnostic test scheduling in multicomputer systems, IEEE Transactions on Computers, 34, 869–872, 1985.
42. Bar-Noy, A., Canetti, R., Kutten, S., Mansour, Y., and Schieber, B., Bandwidth allocation with preemption, SIAM Journal on Computing, 28, 1806–1828, 1999.
43. Dharwadkar, P., Siegel, H. J., and Chong, E. K. P., A heuristic for dynamic bandwidth allocation with preemption and degradation for prioritized requests, in Proceedings of the 21st International Conference on Distributed Computing Systems (ICDCS’01), IEEE, 2001.
44. Krunz, M., Zhao, W., and Matta, I., Scheduling and bandwidth allocation for distribution of archived video inVoD systems, Journal of Telecommunication Systems, Special Issue on Multimedia, 9, 1998.
45. ATM Forum White Paper, ATM service categories: The benefits to the user. ATM Forum, San Francisco.
46. den Boef, E., Verhaegh, W., and Korst, J., Smoothing streams in an in-home digital network: Optimization of bus and buffer usage, Proceedings of 5th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP’01) Aussois, 2001.
47. Feng, W. and Rexford, J., Performance evaluation of smoothing algorithms for transmitting prerecorded variable-bit-rate video, IEEE Transactions on Multimedia 1, 302–313, 1999.
48. Zhang, Z.-L., Kurose, J., Salehi, J. D., and Towsley, D., Smoothing, statistical multiplexing and call admission control for stored video, IEEE Journal on Selected Areas in Communication, 15, 1997.
49. Coffman, E. G., Jr., Garey, M. R., Johnson, D. S. and Lapaugh, A. S., Scheduling file transfers, SIAM Journal on Computing, 14, 744–780, 1985.
50. Jain, R., Somalwar, K., Werth, J., and Browne, J. C., Scheduling parallel I/O operations in multiple bus systems, Journal of Parallel and Distributed Computing, 16, 352–362, 1992.
51. Serafini, P., Scheduling jobs on several machineswith the job splitting property, Operations Research, 44, 617–628, 1996.
52. Lee, C.-Y. and Cai, X., Scheduling one and two-processor tasks on two parallel processors, IEEE Transactions, 31, 445–455, 1999.
53. Coffman, E. G., Jr., An introduction to combinatorial models of dynamic allocation, SIAM Review, 25, 311–325, 1983.
54. Wilson, P., Johnstone, M., Neely, M., and Boles, D., Dynamic storage allocation: A survey and critical review, in Baker, H. G., (ed.), Memory Management, Proceedings of International Workshop IWMM 95, Lecture Notes in Computer Science 986, 1–116, 1995.
55. Herroelen, W., De Reyck, B., and Demeulemeester, E., Resource-constrained project scheduling: A survey of recent developments, Computers and Operations Research, 25, 279–302, 1997.
56. Węglarz, J., Scheduling under continuous performing speed vs. resource amount activity models, in Slowiński, R., andWęglarz, J., (eds.), Advances in Project Scheduling, Elsevier, Amsterdam, 273–295, 1989.
57. Blażewicz, J., Drabowski, M., andWęglarz, J., Schedulingmultiprocessor tasks to minimize schedule length, IEEE Transactions on Computers, 35, 389–393, 1986.
58. Du, J. and Leung, J. Y-T., Complexity of scheduling parallel task systems, SIAM Journal on Discrete Mathematics, 2, 473–487, 1989.
59. Blażewicz, J. and Liu, Z., Scheduling multiprocessor tasks with chain constraints, European Journal of Operational Research, 94, 231–241, 1996.
60. Coffman, E. G. Jr. andGraham, R. L., Optimal scheduling fortwo-processor systems, Acta Informatica, 1, 200–213, 1972.
61. Coppersmith, D. and Winograd, S., Matrix multiplication via arithmetic progressions, Journal of Symbolic Computation, 9, 251–280, 1990.
62. Amoura, A. K., A note on scheduling multiprocessor tasks with precedence constraints on parallel processors, Information Processing Letters, 63, 119–122, 1997.
63. Blażewicz, J. and Liu, Z., Linear and quadratic algorithms for scheduling chains and opposite chains, European Journal of Operational Research, 137, 248–264, 2002.
64. Brucker, P., Knust, S., Roper, D., and Zinder, Y., Scheduling UET task systems with concurrency on two parallel identical processors, Mathematical Methods of Operations Research 52, 369–387, 2000.
65. Baptiste, P. and Schieber, B., Anoteonscheduling tall/smallmultiprocessor taskswith unit processing time to minimize maximum tardiness, Journal of Scheduling, 6, 395–404, 2003.
66. Baptiste, P., A note on scheduling multi processor tasks with identical processing times, to appear in Computers and Operations Research, 30, 2071–2078, 2003.
67. McNaughton, R., Scheduling with deadlines and loss functions, Management Science, 6, 1–12, 1959.
68. Drozdowski, M., On complexity of multiprocessor tasks scheduling, Bulletin of the Polish Academy of Sciences, Technical Sciences, 43, 381–392, 1995.
69. Garey, M. R. and Johnson, D. S., Computers and Intractability:Aguide to the theory of NP-completeness, Freeman, San Francisco, 1979.
70. Blażewicz, J., Cellary, W., Slowiński, R., and Węglarz, J. Scheduling under resource constraints: deterministic models, Annals of Operations Research, vol. 7, 1986.
71. Blażewicz, J., Drozdowski, M., deWerra, D., and Węglarz, J., Deadline scheduling ofmultiprocessor tasks, Discrete Applied Mathematics, 65, 81–96, 1996.
72. Blażewicz, J., Dell’Olmo, P., Drozdowski, M., and Mączka, P., Scheduling multiprocessor tasks on parallel processors with limited availability, European Journal of Operational Research, 149, 377–389, 2003.
73. Jansen, K. and Porkolab, L., Preemptive parallel task scheduling in O(n)+Poly(m) time, in Lee, D. T., and Teng, S. H., (eds.), Proceedings of ISAAC 2000, Lecture Notes in Computer Science 1969, 398–409, 2000.
74. Gonzalez, T. and Sahni, S., Preemptive scheduling of uniformprocessor systems, Journal of the ACM, 25, 92–101, 1978.
75. Horvath, E. C., Lam, S., and Sethi, R., A level algorithm for preemptive scheduling, Journal of the ACM, 24, 32–43, 1977.
76. Blażewicz, J., Drozdowski, M., Schmidt, G., and deWerra, D., Scheduling independent two processor tasks on a uniform duo-processor system, Discrete Applied Mathematics 28, 11–20, 1990.
77. Blażewicz, J., Drozdowski, M., Schmidt, G., and de Werra, D., Scheduling independent multiprocessor tasks on a uniform k-processor system, Parallel Computing, 20, 15–28, 1994.
78. Drozdowski, M., Scheduling multiprocessor tasks on hypercubes, Bulletin of the Polish Academy of Sciences, Technical Sciences, 42, 437–445, 1994.
79. Ahuja, M. and Zhu, Y., An O(n log n) feasibility algorithm for preemptive scheduling of n independent jobs on a hypercube, Information Processing Letters, 35, 7–11, 1990.
80. Chen, G.-I. and Lai, T.-H., Preemptive scheduling of independent jobs on a hypercube, Information Processing Letters, 28, 201–206, 1988.
81. van Hoesel, C. P. M., Preemptive scheduling on a hypercube, Technical Report 8963/A, Erasmus University, Rotterdam, 1989.
82. Plehn, J., Preemptive scheduling of independent jobswith release timesanddeadlinesonahypercube, Information Processing Letters, 34, 161–166, 1990.
83. Shen, X. andReingold, E. M., Scheduling on a hypercube, Information Processing Letters, 40, 323–328, 1991.
84. Zhu, Y., and Ahuja, M., On job scheduling on a hypercube, IEEE Transactions on Parallel and Distributed Systems, 4, 62–69, 1993.
85. Dutt, S. and Hayes, J. P., Subcube allocation in hypercube computers, IEEE Transactions on Computers, 40, 341–352, 1991.
86. Ghonien, S. A., and Fahny, H. M. A., Job preemption, fast subcube compaction, or waiting in hypercube systems? A selection methodology, Parallel Computing, 29, 111–134, 2003.
87. Silberschatz, A., Peterson, J. L., and Galvin, P. B., Operating System Concepts, Addison-Wesley Publishing Co., Reading, MA, 1991.
88. Drozdowski, M. and Dell’Olmo, P., Scheduling multiprocessor tasks for mean flow time criterion, Computers and Operations Research, 27, 571–585, 2000.
89. Brucker, P. and Krämer, A., Polynomial algorithms for resource constrained andmultiprocessor task scheduling problems, European Journal of Operational Research, 90, 214–226, 1996.
90. Krishnamurti, R. andMa, E., An approximation algorithm for scheduling tasks on varying partition sizes in partitionablemultiprocessor systems, IEEE Transactions on Computers, 41, 1572–1579, 1992.
91. Wang, Q. and Cheng, K. H., List scheduling of parallel tasks, Information Processing Letters, 37, 291–297, 1991.
92. Efe, K. and Krishnamoorthy, V., Optimal scheduling of compute-intensive tasks on a network of workstations, IEEE Transactions on Parallel and Distributed Systems, 6, 668–673, 1995.
93. Wang, Q. and Cheng, K. H., A heuristic of scheduling parallel tasks and its analysis, SIAM Journal on Computing, 21, 281–294, 1992.
94. Baumgarten, K., Static scheduling of parallel modules with series-parallel dependence, Proceedings of New Trends in Scheduling for Parallel and Distributed Systems, CIRM, Marseille, 2001.
95. Blażewicz, J., Machowiak, M., Węglarz, J., Mounie, G., and Trystram, D., Scheduling malleable tasks with convex processing speed functions, Computación y Sistemas, 4, 158–165, 2000.
96. Prasanna, G. N. S. and Musicus, B. R., Generalized multiprocessor scheduling using optimal control, in Proceedings of Third Annual ACM Symposium on Parallel Algorithms and Architectures, 216–228, 1991.
97. Prasanna, G. N. S. and Musicus, B. R., Generalized multiprocessor scheduling for directed acyclic graphs, in Proceedings of Supercomputing 1994, IEEE Press, 237–246, 1994.
98. Węglarz, J., Project scheduling with continuously-divisible, doubly constrained resources, Management Science, 27, 1040–1052, 1981.
99. Węglarz, J., Modelling and control of dynamic resource allocation project scheduling systems, in: Tzafestas, S. G., (ed.), Optimization and Control of Dynamic Operational Research Models, North- Holland, Amsterdam, 1982.
100. Prasanna, G. N. S., Agarwal, A. and Musicus, B. R., Hierarchical compilation of macro dataflow graphs for multiprocessors with local memory, IEEE Transactions on Parallel and Distributed Systems, 5, 720–736, 1994.
101. Drozdowski, M. and Kubiak, W., Scheduling parallel tasks with sequential heads and tails, Annals of Operations Research, 90, 221–246, 1999.
102. Vizing, V. G., Minimization of maximum delay in servicing systems with interruption, U. S. S. R. Computational Mathematics and Mathematical Physics, 22, 227–233, 1982.
103. Drozdowski, M., Real-time scheduling of linear speedup parallel tasks, Information Processing Letters, 57, 35–40, 1996.
104. Drozdowski, M., New applications of the Muntz and Coffman algorithm, Journal of Scheduling, 4, 209–223, 2001.
105. Muntz, R. R. andCoffman, E. G., Jr., Optimal preemptive scheduling on two-processor systems, IEEE Transactions on Computers, 18, 1014–1020, 1969.
106. Muntz, R. R. and Coffman, E. G., Jr., Preemptive scheduling of real-time tasks on multiprocessor systems, Journal of ACM, 17, 324–338, 1970.
107. Labetoulle, J., Lawler, E. L., Lenstra, J. K., and RinnoyKan, A. H. G., Preemptive scheduling of uniform processors subject to release dates, in: Pulleybank, W. R. (ed.), Progress in Combinatorial Optimization, Academic Press, New York, 245–261, 1984.
108. Machowiak, M., Scheduling malleable tasks in multiprocessor systems (in Polish), Ph. D. thesis, Institute of Computing Science, Poznań University of Technology, 2002.