Scheduling multiprocessor tasks - An overview

European Journal of Operational Research

Volumn 94, Issue 2, 1996, Pages 215-230

  Drozdowski, Maciej ^a  

^a POZNAN UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Coscheduling; Gang scheduling; Multiprocessor tasks; Parallel processing; Scheduling

Indexed keywords

COMPUTER SYSTEMS; MULTIPROCESSING SYSTEMS; OPTIMIZATION; PROGRAM PROCESSORS; SCHEDULING; STRATEGIC PLANNING;

COSCHEDULING; GANG SCHEDULING; MULTIPROCESSOR TASKS; STANDARD THREE FIELD NOTATION;

PARALLEL PROCESSING SYSTEMS;

EID: 0030262783     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(96)00123-3     Document Type: Article

References (85)

1. 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 (1990) 7-11.
2. Atallah, M.J., Black, C.L., Marinescu, D.C., Siegel, H.J., and Casavant, T.L., "Models and algorithms for coscheduling compute-intensive tasks on a network of workstations", Journal of Parallel and Distributed Computing 16 (1992) 319-327.
3. 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/11 (1971) 1312-1321.
4. Bharadwaj, V., Ghose, D., and Mani, V., "Optimal sequencing and arrangement in distributed single-level tree networks with communication delays", IEEE Transactions on Parallel and Distributed Systems 5/9 (1994) 968-976.
5. Bianco, L., Błażewicz, J., Dell'Olmo, P., and Drozdowski, M., "Preemptive scheduling of multiprocessor tasks on the dedicated processors system subject to minimal lateness", Information Processing Letters 46 (1993) 109-113.
6. Bianco, L., Błażewicz, J., Dell'Olmo, P., and Drozdowski, M., "Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness", to appear in Discrete Applied Mathematics.
7. Bianco, L., Błażewicz, J., Dell'Olmo, P., and Drozdowski, M., "Scheduling preemptive multiprocessor tasks on dedicated processors", Performance Evaluation 20 (1994) 361-371.
8. Bianco, L., Błażewicz, J., Dell'Olmo, P., and Drozdowski, M., "Scheduling UET multiprocessor tasks", Foundations of Computing and Decision Sciences 19/4 (1994) 273-283.
9. Bianco, L., Błażewicz, J., Dell'Olmo, P., and Drozdowski, M., "Preemptive multiprocessor task scheduling with release times and time windows", to appear in Annals of Operations Research.
10. Bianco, L., Błażewicz, J., Dell'Olmo, P., and Drozdowski, M., "Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors", Annals of Operations Research 58 (1995) 493-517.
11. Bianco, L., Dell'Olmo, P., and Speranza, M.G., "Nonpreemptive scheduling of independent tasks with prespecified processor allocations", Naval Research Logistics Quarterly 41 (1994) 959-971.
12. Bianco, L., Dell'Olmo, P., and Speranza, M.G., "Scheduling independent tasks with multiple modes", Discrete Applied Mathematics 62 (1995) 35-50.
13. Błażewicz, J., Dell'Olmo, P., Drozdowski, M., and Speranza, M.G., "Scheduling multiprocessor tasks on three dedicated processors", Information Processing Letters 41 (1992) 275-280; Corrigendum: 49 (1994) 269-270.
14. Błażewicz, J., Drabowski, M., and Wȩglarz, J., "Scheduling multiprocessor tasks to minimize schedule length", IEEE Transactions on Computers 35/5 (1986) 389-393.
15. Błażewicz, J., and Drozdowski, M., "Scheduling divisible jobs on hypercubes", Parallel Computing 21 (1995) 1945-1956.
16. Błażewicz, J., Drozdowski, M., Schmidt, G., and de Werra, D., "Scheduling independent two processor tasks on a uniform duo-processor system", Discrete Applied Mathematics 28 (1990) 11-20.
17. Błażewicz, J., Drozdowski, M., Schmidt, G., and de Werra, D., "Scheduling independent multiprocessor tasks on a uniform k-processor system", Parallel Computing 20 (1994) 15-28.
18. Błażewicz, J., Drozdowski, M., Schmidt, G., and de Werra, D., "Scheduling independent multiprocessor tasks on a uniform k-processor system", Technical Report R92/030, Institute of Computing Science, Poznań University of Technology, 1992.
19. Błażewicz, J., Drozdowski, M., de Werra, D., and Wȩglarz, J., "Deadline scheduling of multiprocessor tasks", Discrete Applied Mathematics 65 (1996) 81-96.
20. Błażewicz, J., and Ecker, K., "Scheduling multiprocessor tasks under unit resource constraints", in: Proceedings of International Conference on Optimization Techniques and Applications, Singapore, Apr. 1987, 161-169.
21. Błażewicz, J., Ecker, K., Schmidt, G., and Wȩglarz, J., Scheduling in Computer and Manufacturing Systems, Springer-Verlag, Berlin, 1993.
22. Błażewicz, J., Lenstra, J.K., and Rinnooy Kan, A.H.G., "Scheduling subject to resource constraints: Classification and complexity", Discrete Applied Mathematics 5 (1983) 11-24.
23. Błażewicz, J., and Liu, Z., "Scheduling multiprocessor tasks with chain constraints", private communication, 1995.
24. Błażewicz, J., Wȩglarz, J., and Drabowski, M., "Scheduling independent 2-processor tasks to minimize schedule length", Information Processing Letters 18 (1984) 267-273.
25. Bozoki, G., and Richard, J.-P., "A branch-and-bound algorithm for the continuous-process job-shop scheduling problem", AIIE Transactions 2/3 (1970) 246-252.
26. Bönniger, T., Esser, R., and Krekel, D., "CM-5, KSR2, Paragon XP/S: A comparative description of massively parallel computers", Parallel Computing 21 (1995) 199-232.
27. Brucker, P., Scheduling Algorithms, Springer-Verlag, Berlin, 1995.
28. Brucker, P., and Krämer, A., "Polynomial algorithms for resource constrained and multiprocessor task scheduling problems with a fixed number of task types", Osnabrücker Schriften zur Mathematik, Reihe P Preprints, Heft 165, Fachbereich Mathematik/Informatik, Universität Osnabrück, May 1994.
29. Brucker, P., and Krämer, A., "Shop scheduling problems with multiprocessor tasks and dedicated processors", Annals of Operations Research. Mathematics of Industrial Systems I 57 (1995) 13-27.
30. Chang, R.S., and Lee, R.C.T., "On a scheduling problem where a job can be executed only by a limited number of processors", Computers & Operations Research 15/5 (1988) 471-478.
31. Chen, G.-I., and Lai, T.-H., "Preemptive scheduling of independent jobs on a hypercube", Information Processing Letters 28 (1988) 201-206.
32. Chen, G.-I., and Lai, T.-H., "Scheduling independent jobs on partitionable hypercubes", Journal of Parallel and Distributed Computing 12 (1991) 74-78.
33. Chen, Y.L., and Chin, Y.H., "Scheduling unit-time jobs on processors with different capabilities", Computers & Operations Research 16/5 (1989) 409-417.
34. Cheng, Y.C., and Robertazzi, T.G., "Distributed computation with communication delay", IEEE Transactions on Aerospace and Electronic Systems 24/6 (1988) 700-712.
35. 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/4 (1994) 439-445.
36. Chrétienne, P., "Tree scheduling with communication delays", Discrete Applied Mathematics 49 (1994) 129-141.
37. Coffman, Jr., E.G. (ed.). Computer and Job-shop Scheduling Theory, Wiley, New York, 1976.
38. Coffman, Jr., E.G., Garey, M.R., Johnson, D.S., and Lapaugh, A.S., "Scheduling file transfers", SIAM Journal on Computing 14/3 (1985) 744-780.
39. Colin, J.Y., and Chrétienne, P., "C.P.M. scheduling with small communciation delays and task duplication", Operations Research 39/4 (1991) 680-684.
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/9 (1988) 1099-1109.
41. Dell'Olmo, P., Speranza, M.G., and Tuza, Z., "Easy and hard cases of a scheduling problem on three dedicated processors", private communication, 1993.
42. Dobson, G., and Karmarkar, U.S., "Simultaneous resource scheduling to minimize weighted flow times", Operations Research 37/4 (1989) 592-600.
43. Drozdowski, M., "Scheduling multiprocessor tasks on hypercubes", Bulletin of the Polish Academy of Sciences. Technical Sciences 42/3 (1994) 437-445.
44. Drozdowski, M., "On complexity of multiprocessor tasks scheduling", Bulletin of the Polish Academy of Sciences. Technical Sciences 43/3 (1995) 381-392.
45. Drozdowski, M., "Real-time scheduling of linear speedup parallel tasks", Information Processing Letters 57 (1996) 35-40.
46. Drozdowski, M., and Kubiak, W., "Scheduling parallel tasks with sequential heads and tails", Working Paper, Faculty of Business Administration, Memorial University of Newfoundland, 1995.
47. Du, J., and Leung, J.Y-T., "Complexity of scheduling parallel task systems , SIAM Journal on Discrete Mathematics 2/4 (1989) 473-487.
48. Efe, K., and Krishnamoorthy, V., "Optimal scheduling of compute-intensive tasks on a network of workstations", IEEE Transactions on Parallel and Distributed Systems 6/6 (1995) 668-673.
49. Feitelson, D.G., and Rudolph, L., "Gang scheduling performance benefits for fine-grain synchronization", Journal of Parallel and Distributed Computing 16 (1992) 306-318.
50. Gehringer, E.F., Siewiorek, D.P., and Segall, Z., Parallel Processing: The Cm* Experience, Digital Press, Bedford, 1987.
51. Goemans, M.X., "An approximation algorithm for scheduling on three dedicated processors", Discrete Applied Mathematics 61 (1995) 49-60.
52. Graham, R.I., Lawler, E.L., Lenstra, J.K., and Rinnooy Kan, A.H.G., "Optimization and approximation in deterministic sequencing and scheduling: A survey", Annals of Discrete Mathematics 5 (1979) 287-326.
53. Hakimi, S.L., and Amin, A.T., "Characterization of the connection assignment of diagnosable systems", IEEE Transactions on Computers 23/1 (1974) 86-88.
54. van Hoesel, C.P.M., "Preemptive scheduling on a hypercube", Technical Report 8963/A, Erasmus University, Rotterdam, 1989.
55. Hoogeveen, J.A., van de Velde, S.L., and Veltman, B., "Complexity of scheduling multiprocessor tasks with prespecified processors allocations", Discrete Applied Mathematics 55 (1994) 259-272.
56. Hopkins, A.L., Lala, J.M., and Smith, T.B., "FTMP - A highly reliable fault-tolerant multiprocessor for aircraft", Proceedings of the IEEE 66/10 (1978).
57. 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 (1992) 352-362.
58. Jansen, K., "Scheduling with constrained processor allocation for interval orders", Computers & Operations Research 20/6 (1993) 587-595.
59. Kellerer, H., and Woeginger, G., "UET-scheduling with constrained processor allocations", Computers & Operations Research 19/1 (1992) 1-8.
60. Krawczyk, H., and Kubale, M., "An approximation algorithm for diagnostic test scheduling in multicomputer systems", IEEE Transactions on Computers 34/9 (1985) 869-872.
61. Krishnamurti, R., and Ma, E., "An approximation algorithm for scheduling tasks on varying partition sizes in partitionable multiprocessor systems", IEEE Transactions on Computers 41/12 (1992) 1572-1579.
62. 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/5 (1994) 488-497.
63. Kubale, M., "The complexity of scheduling independent two-processor tasks on dedicated processors", Information Processing Letters 24 (1987) 141-147.
64. Kubale, M., "Preemptive scheduling of two-processor tasks on dedicated processors" (in Polish), Zeszyty Naukowe Politechniki Śla̧skiej. Seria Automatyka 100/1082 (1990) 145-153.
65. Kubale, M., "File transfer scheduling within time windows" (in Polish), Zeszyty Naukowe Politechniki Śla̧skiej. Seria Automatyka 110/1176 (1992) 69-76.
66. Kubale, M., "Preemptive versus nonpreemptive scheduling of biprocessor tasks on dedicated processors", private communication, 1995.
67. Lin, J.F., and Chen, S.J., "Scheduling algorithm for nonpreemptive multiprocessor tasks", Computers and Mathematics with Applications 28/4 (1994) 85-92.
68. Lloyd, E.L., "Concurrent task systems", Operations Research 29/1 (1981) 189-201.
69. Markatos, E.P., and LeBlanc, T.J., "Using processor affinity in loop scheduling on shared-memory multiprocessors", IEEE Transactions on Parallel and Distributed Systems 5/4 (1994) 379-400.
70. Plehn, J., "Preemptive scheduling of independent jobs with release times and deadlines on a hypercube", Information Processing Letters 34 (1990) 161-166.
71. Preparata, F.P., Metze, G., and Chien, R., "On the connection assignment problem of diagnosable systems", IEEE Transactions on Electronic Computers 16/6 (1967) 848-854.
72. Rayward-Smith, V.J., "UET scheduling with interprocessor communication delays", Discrete Applied Mathematics 18 (1987) 55-71.
73. Sevcik, K.C., "Application scheduling and processor allocation in multiprogrammed parallel processing systems", Performance Evaluation 19 (1994) 107-140.
74. Shen, X., and Reingold, E.M., "Scheduling on a hypercube", Information Processing Letters 40 (1991) 323-328.
75. Srinivasa Prasanna, G.N., and Musicus, B.R., "Generalized multiprocessor scheduling for directed acyclic graphs", in: Proceedings of Supercomputing 1994, IEEE Press, New York, 1994, 237-246.
76. Veltman, B., Lageweg, B.J., and Lenstra, J.K., "Multiprocessor scheduling with communication delays", Parallel Computing 16 (1990) 173-182.
77. Vizing, V.G., "About schedules observing deadlines" (in Russian), Kibernetika 1 (1981) 128-135.
78. Vizing, V.G., "Optimal choice of task execution intensities with a convex penalty function for intensity" (in Russian), Kibernetika 3 (1982) 125-127.
79. Vizing, V.G., "Minimization of the maximum delay in servicing systems with interruption", U.S.S.R. Computational Mathematics and Mathematical Physics 22/3 (1982) 227-233.
80. Vizing, V.G., Komzakowa, L.N., and Tarchenko, A.V., "An algorithm for selecting the processing intensity" (in Russian), Kibernetika 5 (1981) 71-74.
81. Wang, Q., and Cheng, K.H., "List scheduling of parallel tasks", Information Processing Letters 37 (1991) 291-297.
82. Wang, Q., and Cheng, K.H., "A heuristic of scheduling parallel tasks and its analysis", SIAM Journal on Computing 21/2 (1992) 281-294.
83. Wȩglarz, J., "Scheduling under continuous performing speed vs. resource amunt activity models", in: R. Słowiński and J. Wȩglarz, Advances in Project Scheduling, Elsevier Science Publishers, Amsterdam, 1989, 273-295.
84. 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/2 (1991) 180-198.
85. Zhu, Y., and Ahuja, M., "On job scheduling on a hypercube", IEEE Transactions on Parallel and Distributed Systems 4/1 (1993) 62-69.