Abstract
This chapter is devoted to the analysis of scheduling problems in parallel processor environment. As before the three main criteria to be analyzed are schedule length, mean flow time and lateness. Then, some more developed models of multiprocessor systems are described, including semi-identical processors and uniform k-processor systems. Corresponding results are presented in the four following sections.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Adolphson, and T. C. Hu, Optimal linear ordering,SIAM J. Appl. Math. 25, 1973, 403–423.
A. V. Aho, J. E. Hoperoft, J D Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974.
S. Ashour,Sequencing Theory, Springer Verlag Berlin, 1972.
A. Avizienis, Fault tolerance: the survival attribute of digitalsystems, Proc. IEEE 66, 1978, 1109–1125.
K. Baker,Introduction to Sequencing and Scheduling, J. Wiley, New York, 1974.
J. Bruno, E. G. Coffman, Jr., R. Sethi, Scheduling independent tasks to reduce mean finishing time,Comm. ACM 17, 1974, 382–387.
BCSW76a J. Bxazewicz, W. Cellary, R. Slowifiski, and J. Wçglarz, Deterministyczne problemy szeregowania zadafi na równoleglych procesorach. Cz. I.Zbiory zadati niezaleinych, Podstawy Sterowania 6, 1976, 155–178.
BCSW76b J. BIazewicz, W. Cellary, R. Slowifski, and J. Wçglarz, Deterministyczne problemy szeregowania zadafi na równoleglych procesorach, Cz. II.Zbiory zadaft niezaletnych, Podstawy Sterowania 6, 1976, 297–320.
J. Bxazewicz, W. Cellary, and J. Wçglarz, A strategy for scheduling splittable tasks to reduce schedule length,Acta Cybernet. 3, 1977, 99–106.
BDOS92 J. Bdazewicz, M. Drozdowski, P. dell’Olmo, M. G. Speranza, Scheduling multiprocessor tasks on three dedicated processors, Inform. Process. Lett, 1992, to appear.
J. Blazewicz, M. Drozdowski, G. Schmidt, D. de Werra, Scheduling independent two processor tasks on a uniform duo-processor system,Discrete App1. Math. 28, 1990, 11–20.
J. Bfazewicz, M. Drabowski, J. Wçglarz, Scheduling independent 2-processor tasks to minimize schedule length,Inform. Process. Lett. 18, 1984, 267–273.
J. Blazewicz, M. Drabowski, J. Wçglarz, Scheduling multiprocessor tasks to minimize schedule length,IEEE Trans. Comput. C-35, 1986, 389–393.
J. Blazewicz, K. Ecker, A linear time algorithm for restricted bin packing and scheduling problems,Oper. Res. Lett. 2, 1983, 80–83.
P. Brucker, M. R. Carey, and D. S. Johnson, Scheduling equal-length tasks under treelike precedence constraints to minimize maximum lateness,Math. Oper. Res. 2, 1977, 275–284.
J. Blazewicz, Simple algorithms for multiprocessor scheduling to meet deadlines,Inform. Process. Lett. 6, 1977, 162–164.
Bru76a J. Bruno, Scheduling algorithms for minimizing the mean weighted flow-time,E. G. Coffman, Jr. (ed.),Computer and Job-Shop Scheduling Theory, John Wiley & Sons, New York, 1976.
Bru76b P. J. Brucker, Sequencing unit-time jobs with treelike precedence on m machines to minimize maximum lateness,Proceedings IX International Symposium on Mathematical Programming, Budapest, 1976.
E. G. Coffman, Jr., P. J. Denning,Operating Systems Theory, Prentice-Hall, Englewood Cliffs, N. J., 1973.
E. G. Coffman, Jr., G. N. Frederickson, G. S. Luecker, Probabilistic analysis of the LPT processor scheduling heuristic, (unpublished paper ), 1983.
E. G. Coffman, Jr., G. N. Frederickson, G. S. Luecker, A note on expected makespans for largest-first sequences of independent task on two processors,Math. Oper. Res. 9, 1984, 260–266.
E. G. Coffman, Jr., R. L. Graham, Optimal scheduling for two-processor systems,Acta Inform. 1, 1972, 200–213.
E. G. Coffman, Jr., M. R. Garey, Proof of the 4/3 conjecture for preemptive versus nonpreemptive two-processor scheduling, Report Bell Laboratories, Murray Hill, 1991.
E. G. Coffman, Jr., M. R. Garey, D. S. Johnson, An application of bin-packing to multiprocessor scheduling,SIAM J.Comput. 7, 1978, 1–17.
E. G. Coffman, Jr., M. R. Garey, D. S. Johnson, Appoximation algorithms for bin packing - an updated survey, in: G. Ausiello, M. Lucertini, P. Serafini (eds.),Algorithm Design for Computer System Design, Springer Verlag, Vienna, 1984, 49106.
N.-F. Chen, C. L. Liu, On a class of scheduling algorithms for multiprocessors computing systems, in: T.-Y. Feng (ed.),Parallel Processing, Lecture Notes in Computer Science 24, Springer Verlag, Berlin, 1975, 1–16.
R. W. Conway, W. L. Maxwell, and L. W. Miller,Theory of Scheduling, AddisonWesley, Reading, Mass., 1967.
E. G. Coffman, Jr., A survey of mathematical results in flow-time scheduling for computer systems,GI - 3. Jahrestagung, Hamburg, Springer Verlag Berlin, 1973, 2546.
E. G. Coffman, Jr. (ed.),Scheduling in Computer and Job Shop Systems, J. Wiley, New York, 1976.
E. G. Coffman, Jr., and R. Sethi, A generalized bound on LPT sequencing,RAIROInformatique 10, 1976, 17–25.
M. Dal Cin, E. Dilger, On the diagnostability of self-testing multimicroprocessor systems,Microprocessing and Microprogramming 7, 1981, 177–184.
J. Du, J. Y-T. Leung, Scheduling tree-structured tasks with restricted execution times,Inform. Process. Lett. 28, 1988, 183–188.
J. Du, J. Y-T. Leung, Scheduling tree-structured tasks on two processors to minimize schedule length,SIAM J. Discrete Math. 2, 1989, 176–196.
J. Du, J. Y-T. Leung, G. H. Young, Scheduling chain structured tasks to minimize makespan and mean flow time,Inform. and Comput. 92, 1991, 219–236.
DW85 D. Dolev, M. K. Warmuth, Scheduling flat graphs, SIAM J.Comput. 14, 1985, 638–657.
E. B. Fernandez, B. Bussel, Bounds on the number of processors and time for multiprocessor optimal schedules,IEEE Trans. Comput. C22, 1973, 745–751.
A. Federgruen, H. Groenevelt, Preemptive scheduling of niform machines by ordinary network flow techniques,Management Sci. 32, 1986, 341–349.
M. Fujii, T. Kasami, K. Ninomiya, Optimal sequencing of two equivalent processors,SIAM J. Appl. Math. 17, 1969, 784–789, Err:SIAM J. Appl. Math. 20, 1971, 141.
S. French,Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop, Horwood, Chichester, 1982.
J. B. G. Frenk, A. H. G. Rinnooy Kan, The rate of convergence to optimality of the LPT rule,Discrete Appl. Math. 14, 1986, 187–197.
J. B. G. Frenk, A. H. G. Rinnooy Kan, The asymptotic optimality of the LPT rule,Math. Oper. Res. 12, 1987, 241–254.
H. N. Gabow, An almost linear algorithm for two-processor scheduling,J. Assoc. Comput. Mach. 29, 1982, 766–780.
Gar - M. R. Garey, Unpublished result.
M. R. Garey, Optimal task sequencing with precedence constraints,Discrete Math. 4, 1973, 37–56.
M. R. Garey, R. L. Graham, Bounds for multiprocessor scheduling with limited resources,4th Symposium on Operating System Principles, 1966, 104–111.
M. R. Garey, R. L. Graham, Bounds for multiprocessor scheduling with resource constraints,SIAM J.Comput. 4, 1975, 187–200.
T. Gonzalez, O. H. Ibarra, S. Salmi, Bounds for LPT schedules on uniform processors,SIAM J.Comput. 6, 1977, 155–166.
M. R. Garey, D. S. Johnson, Scheduling tasks with nonuniform deadlines on two processors,J. Assoc. Comput. Mach. 23, 1976, 461–467.
M. R. Garey, D. S. Johnson, Two-processor scheduling with start-times and deadlines,SIAM J.Comput. 6, 1977, 416–426.
M. R. Garey, D. S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco, 1979.
M. R. Garey, D. S. Johnson, B. B. Simons, R. E. Tarjan, Scheduling unit time tasks with arbitrary release times and deadlines,SIAM J.Comput. 10, 1981, 256–269.
M. R. Garey, D. S. Johnson, R. E. Tarjan, M. Yannakakis, Scheduling opposing forests, SIAMJ. Algebraic and Discrete Meth. 4, 1983, 72–93.
R. L. Graham, E. L. Lawler, J. K. Lenstra, A. H. G. Rinnoy Kan, Optimization and approximation in deterministic sequencing and scheduling theory: a survey,Ann. Discrete Math. 5, 1979, 287–326.
T. Gonzalez, Optimal mean finish time preemptive schedules, Technical Report 220, Computer Science Depatment, Pennsylvania Stat Univ. 1977.
R. L. Graham, Bounds for certain multiprocessing anomalies,Bell System Tech. J. 45, 1966, 1563–1581.
R. L. Graham, Bounds on multiprocessing timing anomalies,SIAM J. Appl. Math. 17, 1969, 263–269.
Gra76 R. L. Graham, Bounds on performance of scheduling algorithms, Chapter 5 in [Cof76].
T. Gonzalez, S. Salmi, Preemptive scheduling of uniform processor systems,J. Assoc. Comput. Mach. 25, 1978, 92–101.
T. Gonzalez, S. Salmi, Preemptive scheduling for uniform processor systems,J. Assoc. Comput. Mach. 25, 1978, 81–101.
E. G. Horvath, S. Lam, R. Sethi, A level algorithm for preemptive scheduling,J. Assoc. Comput. Mach. 24, 1977, 32–43.
W. A. Horn, Minimizing average flow time with parallel machines,Oper. Res. 21, 1973, 846–847.
W. A. Horn, Some simple scheduling algorithms,Naval Res. Logist. Quart. 21, 1974, 177–185.
E. Horowitz, S. Salmi, Exact and aproximate algorithms for scheduling non-identical processors,J. Assoc. Comput. Mach. 23, 1976, 317–327.
D. S. Hochbaum, D. B. Shmoys, Using dual approximation algorithms for scheduling problems: theoretical and practical results,J. Assoc. Comput. Mach. 34, 1987, 144–162.
Hu61 T. C. Hu, Parallel sequencing and assembly line problems, Oper. Res.9, 1961, 841–848.
O. H. Ibarra, C. E. Kim, Heuristic algorithms for scheduling independent tasks on nonidentical processors,J. Assoc. Comput. Mach. 24, 1977, 280–289.
J. R. Jackson, Scheduling a production line to minimize maximum tardiness, Res.
Report 43, Management Research Project, University of California, Los Angeles, 1955.
D. S. Johnson, C. L. Monma, A scheduling problem with simultaneous machine requirement, TIMS XXVI, Copenhagen, 1984.
D. S. Johnson, The NP-completeness column: an ongoing guide,J. Algorithms 4, 1983, 189–203.
R. M. Karp, Reducibility among combinatorial problems, in: R. E. Miller, J. W. Thatcher (eds.),Complexity of Computer Computations, Plenum Press, New York, 1972, 85–104.
A. W. Karzanov, Determining the maximal flow in a network by the method of preflows,Soviet Math. Dokl. 15, 1974, 434–437.
N. Karmarkar, A new polynomial-time algorithm for linear programming,Combinatorica 4, 1984, 373–395.
O. Kariv, S. Even. An 0(n2.5) algorithm for maximum matching in general graphs,16th Annual Symposium on Foundations of Computer Science IEEE, 1975, 100–112.
S. K. Kedia, A job scheduling problem with parallel machines, Unpublished Report, Dept. of Ind. Eng. University of Michigan, Ann Arbor, 1970.
L. G. Khachiyan, A polynomial algorithm for linear programming (in Russian),Dokl. Akad. Nauk SSSR, 244, 1979, 1093–1096.
KK82 N. Karmarkar, R. M. Karp, The differing method of set partitioning, Report
UCB/CSD 82/113, Computer Science Division, University of California, Berkeley, 1982.
H. Krawczyk, M. Kubale, An approximation algorithm for diagnostic test scheduling in multicomputer systems,IEEE Trans. Comput. C-34, 1985, 869–872.
M. Kubale, The complexity of scheduling independent two-processor tasks on dedicated processors,Inform. Proc. Lett. 24, 1987, 141–147.
M. Kunde, Beste Schranke beim LP-Scheduling, Bericht 7603, Institut fir Informatik und Praktische Mathematik, University Kiel, 1976.
E. L. Lawler, Optimal sequencing of a single machine subject to precedence constraints,Management Sci. 19, 1973, 544–546.
E. L. Lawler,Combinatorial optimization: Networks and Matroids, Holt, Rinehart and Winston, New York, 1976.
Law82a E. L. Lawler, Recent results in the theory of machine scheduling, in: A. Bachem, M. Grötschel, B. Korte (eds.)Mathematical Programing: The State of Art, Bonn 1982, Springer Verlag, Berlin, 1982, 202–234.
Law82b E. L. Lawler, Preemptive scheduling in precedence-constrained jobs on parallel machines, in: M. A. H. Dempster, J. K. Lenstra, A. H. G. Rinnooy Kan (eds.),Deterministic and Stochastic Scheduling, Reidel, Dordrecht, 1982, 101–123.
C.-Y. Lee, Parallel machine scheduling with nonsimultaneous machine availabletime, Discrete Appl. Math. 30, 1991, 53–61.
Len8lb J. K. Lenstra, Sequencing by enumerative methods, Mathematical Centre Tracte 69, Mathematisch Centrum, Amsterdam, 1981.
LL74a J. W. S. Liu, C. L. Liu, Performance analysis of heterogeneous multiprocessor computing systems, in E. Gelenbe, R. Mahl (eds.),Computer Architecture and Networks, North Holland, Amsterdam, 1974, 331–343.
J. W. S. Liu, C. L. Liu, Performance analysis of heterogeneous multiprocessor computing systems, in: E.Gelenbe, R. Mahl (eds ),Computer Architecture and Networks, North Holland, Amsterdam, 1974, 331–343.
LL74c J.W.S. Liu, C.L. Liu, Bounds on scheduling algorithms for heterogeneous computing systems, Technical Report UIUCDCS-R-74–632, Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1974.
E. L. Lawler, J. Labetoulle, Preemptive scheduling of unrelated parallel processors by linear programing,J. Assoc. Comput. Mach. 25, 1978, 612–619.
J. Lageweg, J. K. Lenstra, E. L. Lawler, A. H. G. Rinnooy Kan, Computer Aided complexity classification of combinatorial problems,Comm. ACM 25, 1982, 817–822.
J. Labetoulle, E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, Preemptive scheduling of uniform processors subject to release dates, in: W. R. Pulleyblank (ed.),Progress in Combinatorial Optimization, Academic Press, New York, 1984, 245–261.
E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, Recent developments in deterministic sequencing and scheduling: a survey, in M. A. H. Dempster, J. K. Lenstra, A. H. G. Rinnooy Kan (eds.),Deterministic and Stochastic Scheduling, Reidel, Dordrecht, 1982, 35–73.
E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys, Sequencing and scheduling: algorithms and complexity, Report Centre Mathematics and Computer Science, Amsterdam, 1989.
J. K. Lenstra, A. H. G. Rinnooy Kan, Complexity of scheduling under precedence constraints,Oper. Res. 26, 1978, 22–35.
J. K. Lenstra, A. H. G. Rinnooy Kan, Scheduling theory since 1981: an annotated bibliography, in M. Oh Eigearthaigh, J. K. Lenstra, A. H. G. Rinnooy Kan (eds.),Combinatorial Optimization: Annotated Bibliographies, J. Wiley, Chichester, 1984.
J. K. Lenstra, A. H. G. Rinnooy Kan, P. Brucker, Complexity of machine scheduling problems,Ann. Discrete Math. 1, 1977, 343–362.
S. Lam, R. Sethi, Worst case analysis of two scheduling algorithms,SIAM J.Comput. 6, 1977, 518–536.
R. Muntz, E. G. Coffman, Jr., Optimal preemptive scheduling on two-processor systems,IEEE Trans. Comput. C-18, 1969, 1014–1029.
R. Muntz, E. G. Coffman, Jr., Preemptive scheduling of real time tasks on multiprocessor systems,J. Assoc. Comput. Mach. 17, 1970, 324–338.
R. McNaughton, Scheduling with deadlines and loss functions,Management Sci. 6, 1959, 1–12.
K. Nakajima, J. Y-T. Leung, S. L. Hakimi, Optimal two processor scheduling of tree precedence constrained tasks with two execution times,Performance Evaluation 1, 1981, 320–330.
A. H. G. Rinnooy Kan,Machine Scheduling Problems: Classification, Complexity and Computations, Nijhoff, The Hague, 1978.
C. V. Ramamoorthy, M. J. Gonzalez, A survey of techniques for recognizing parallel processable streams in computer programs, AFIPS Conference Proceedings, Fall Joint Computer Conference, 1969, 1–15.
Ros unpublished result.
M. H. Rothkopf, Scheduling independent tasks on parallel processors,Management Sci. 12, 1966, 347–447.
H. Rtick, G. Schmidt, Machine aggregation heuristics in shop scheduling,Methods Oper. Res. 45, 1983, 303–314.
S. Sahni, Preemptive scheduling with due dates,Oper. Res. 5, 1979, 925–934.
S. Sahni, Y. Cho, Scheduling independent tasks with due times on a uniform processor system,J. Assoc. Comput. Mach. 27, 1980, 550–563.
Sch84 G. Schmidt, Scheduling on semi-identical processors, Z. Oper Res. A28, 1984, 153–162.
G. Schmidt, Scheduling independent tasks with deadlines on semi-identical processors, J. Opl. Res. Soc. 39, 1988, 271–277.
Set76 R. Sethi, Algorithms for minimal-length schedules, Chapter 2 in [Cof76].
R. Sethi, On the complexity of mean flow time scheduling,Math. Oper. Res. 2, 1977, 320–330.
S. V. Sevastjanov, Private communication, 1991.
S1o78 R. Slowifiski, Scheduling preemptible tasks on unrelated processors with additional resources to mionimize schedule length, in G. Bracci, R. C. Lockemann (eds.), Lecture Notes in Computer Science, vol 65, Springer Verlag, Berlin, 1978, 536–547.
R. Slowifiski, J. Wgglarz, Minimalno-czasowy modelsieciowy z roznymi sposobami wykonywania czynnosci,Przeglad Statystyczny 24, 1977, 409–416.
U1176 J. D. Ullman, Complexity of sequencing problems, Chapter 4 in [Cof76].
B. Veltman, B. J. Lageweg, J. K. Lenstra, Multiprocessor scheduling with communication delays, Centre for Mathematics and Computer Science, Report BS - R9018, 1990.
J. Wgglarz, J. BlaZewicz, W. Cellary, and R.Slowifiski, An automatic revised simplex method for constrained resource network scheduling,ACM Trans. Math. Software 3, 1977, 295–300.
D. de Werra, Preemptive scheduling linear programming and network flows,SIAM J. Algebra and Discrete Math. 5, 1984, 11–20.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin · Heidelberg
About this chapter
Cite this chapter
Blazewicz, J., Ecker, K., Schmidt, G., Wȩglarz, J. (1993). Parallel Processor Scheduling. In: Scheduling in Computer and Manufacturing Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-00074-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-662-00074-8_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-00076-2
Online ISBN: 978-3-662-00074-8
eBook Packages: Springer Book Archive