Hostname: page-component-89b8bd64d-5bvrz Total loading time: 0 Render date: 2026-05-06T12:58:09.937Z Has data issue: false hasContentIssue false
  • English
  • Français

Scheduling multiprocessor taskson two parallel processors

Published online by Cambridge University Press:  15 July 2002

Jacek Błażewicz ,
Paolo Dell'Olmo  and
Maciej Drozdowski
Jacek Błażewicz
Affiliation:
Instytut Informatyki, Politechnika Poznańska, ul. Piotrowo 3a, 60-965 Poznań, Poland; blazewic@sol.put.poznan.pl.
Paolo Dell'Olmo
Affiliation:
Dipartimento di Statistica, Probabilita' e Statistiche Applicate Universita' di Roma “La Sapienza", Piazzale Aldo Moro 5, 00185 Roma, Italy; and Istituto di Analisi dei Sistemi ed Informatica C.N.R., Viale Manzoni 30, 00185 Roma, Italy.
Maciej Drozdowski
Affiliation:
Instytut Informatyki, Politechnika Poznańska, ul. Piotrowo 3a, 60-965 Poznań, Poland; blazewic@sol.put.poznan.pl.
Get access

Abstract

In this work scheduling multiprocessor tasks on two parallel identical processors is considered.Multiprocessor tasks can be executed by more than one processorat the same moment of time.We analyze scheduling unit execution time and preemptable tasks to minimize schedule length and maximum lateness.Cases with ready times, due-dates and precedence constraintsare discussed.

Keywords

Parallel processingdeterministic schedulingmultiprocessor taskscoschedulinggang schedulingconcurrent task systems.

Information

Type
Research Article
Information
RAIRO - Operations Research , Volume 36 , Issue 1 , January 2002 , pp. 37 - 51
Copyright
© EDP Sciences, 2002

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

P. Baptiste and B. Schieber, Scheduling tall/small multiprocessor tasks with unit processing time to minimize maximum tardiness, in Proc. of the VIII Int. Workshop On Project Management and Scheduling (2002) 55-58.
Błazewicz, J., Dell'Olmo, P., Drozdowski, M. and Speranza, M.G., Scheduling multiprocessor tasks on three dedicated processors. Inform. Process. Lett. 41 (1992) 275-280. Corrigendum: Inform. Process. Lett. 49 (1994) 269-270. CrossRef
Błazewicz, J., Drabowski, M. and Weglarz, J., Scheduling multiprocessor tasks to minimize schedule length. IEEE Trans. Comput. 35 (1986) 389-393. CrossRef
J. Błazewicz, K. Ecker, E. Pesch, G. Schmidt and J. Weglarz, Scheduling Computer and Manufacturing Processes. Springer-Verlag, Heidelberg (1996).
Błazewicz, J. and Liu, Z., Scheduling multiprocessor tasks with chain constraints. Eur. J. Oper. Res. 94 (1996) 231-241. CrossRef
Brucker, P. and Krämer, A., Shop scheduling problems with multiprocessor tasks and dedicated processors. Ann. Oper. Res. 57 (1995) 13-27. CrossRef
P. Brucker, S. Knust, D. Roper and Y. Zinder, Scheduling UET task systems with concurrency on two parallel identical processors. Math. Meth. Oper. Res. 52 , 369-387.
Coffman Jr, E.G.. and R.L. Graham, Optimal scheduling for two-processor systems. Acta Informatica 1 (1972) 200-213. CrossRef
Coffman Jr, E.G.., M.R. Garey, D.S. Johnson and A.S. Lapaugh, Scheduling file transfers. SIAM J. Comput. 14 (1985) 744-780. CrossRef
Coppersmith, D. and Winograd, S., Matrix multiplication via arithmetic progressions. J. Symb. Comput. 9 (1990) 251-280. CrossRef
Drozdowski, M., Scheduling multiprocessor tasks - An overview. Eur. J. Oper. Res. 94 (1996) 215-230. CrossRef
M. Drozdowski, Selected problems of scheduling tasks in multiprocessor computer systems. Poznan University of Technology Press, Series: Rozprawy, No. 321, Poznan (1997). See also: http://www.cs.put.poznan.pl/~maciejd/txt/h.ps
Du, J. and Leung, J.Y-T., Complexity of scheduling parallel task systems. SIAM J. Discrete Math. 2 (1989) 473-487. CrossRef
Garey, M.R. and Johnson, D.S., Scheduling tasks with nonuniform deadlies on two processors. J. ACM 23 (1976) 461-467. CrossRef
E.F. Gehringer, D.P. Siewiorek and Z. Segall, Parallel Processing: The Cm * Experience. Digital Press, Bedford (1987).
Graham, R.L., Lawler, E.L., Lenstra, J.K. and Rinnoy Kan, A.H.G., Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann. Discrete Math. 5 (1979) 287-326. CrossRef
Hoogeveen, J.A., van de Velde, S.L. and Veltman, B., Complexity of scheduling multiprocessor tasks with prespecified processors allocations. Discrete Appl. Math. 55 (1994) 259-272. CrossRef
Parallel, T.C. Hu sequencing and assembly line problems. Oper. Res. 9 (1961) 841-848.
R.M. Karp, Reducibility among combinatorial problems, edited by R.E. Miller and J.W. Thatcher, Complexity of Computer Computation. Plenum Press, New York (1972) 85-104.
Krawczyk, H. and Kubale, M., An approximation algorithm for diagnostic test scheduling in multicomputer systems. IEEE Trans. Comput. 34 (1985) 869-872. CrossRef
Kubale, M., The complexity of scheduling independent two-processor tasks on dedicated processors. Inform. Process. Lett. 24 (1987) 141-147. CrossRef
C.Y. Lee and X. Cai, Scheduling multiprocessor tasks without prespecified processor allocations. Private communication (1998).
Lloyd, E.L., Concurrent task systems. Oper. Res. 29 (1981) 189-201. CrossRef
McNaughton, R., Scheduling with deadlines and loss functions. Management Sci. 6 (1959) 1-12. CrossRef
Muntz, R. and Coffman Jr, E.G.., Preemptive scheduling of real time tasks on multiprocessor systems. J. Assoc. Comput. Machinery 17 (1970) 324-338. CrossRef
Veltman, B., Lageweg, B.J. and Lenstra, J.K., Multiprocessor scheduling with communications delays. Parallel Comput. 16 (1990) 173-182. CrossRef
Zahorjan, J., Lazowska, E.D. and Eager, D.L., The effect of scheduling discipline on spin overhead in shared memory parallel systems. IEEE Trans. Parallel Distributed Systems 2 (1991) 180-199. CrossRef