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, imprecise computations and lot size scheduling. 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, 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, Berlin, 1972.
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.
J. B-Iaiewicz, W. Cellary, R. Sfiowifiski, J. Wgglarz, Deterministyczne prob-lemy szeregowania zadan na równoleglych procesorach, Cz. I. Zbiory zadan zaleznych, Podstawy Sterowania 6, 1976, 155–178.
J. Bfaiewicz, W. Cellary, R. Slowinski, J. Wgglarz, Deterministyczne prob-lemy szeregowania zadan na równoleglych procesorach, Cz. II. Zbiory zadafi zale2nych, Podstawy Sterowania 6, 1976, 297–320.
J. Blaiewicz, W. Cellary, J. Wgglarz, A strategy for scheduling splittable tasks to reduce schedule length, Acta Cybernet. 3, 1977, 99–106.
J. Blaiewicz, G. Finke, Minimizing mean weighted execution time loss on identical and uniform processors, Inform. Process. Lett. 24, 1987, 259–263.
P. Brucker, M. R. Garey, D. S. Johnson, Scheduling equal-length tasks undertreelike precedence constraints to minimize maximum lateness, Math. Oper. Res. 2, 1977, 275–284.
J. Bxaiewicz, D. Kobler, On the ties between different graph representation for scheduling problems, Report, Poznan University of Technology, Poznan, 2000.
J. Baiewicz, Simple algorithms for multiprocessor scheduling to meet deadlines, Inform. Process. Lett. 6, 1977, 162–164.
J. BXaiewicz, Scheduling preemptible tasks on parallel processors with information loss, Technique et Science Informatiques 3, 1984, 415–420.
J. Bruno, Scheduling algorithms for minimizing the mean weighted flow-time, in: E. G. Coffman, Jr. (ed.), Computer and Job-Shop Scheduling Theory, J. Wiley, New York, 1976.
P. J. Brucker, Sequencing unit-time jobs with treelike precedence on m processors to minimize maximum lateness, Proc. IX International Symposium on Mathematical Programming, Budapest, 1976.
B. Braschi, D. Trystram, A new insight into the Coffman-Graham algorithm, SIAM J. Comput. 23, 1994, 662–669.
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. Lueker, Probabilistic analysis of the LPT processor scheduling heuristic, unpublished paper, 1983.
E. G. Coffman, Jr., G. N. Frederickson, G. S. Lueker, 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, Approximation algorithms for bin packing–an updated survey, in: G. Ausiello, M. Lucertini, P. Serafini (eds.), Algorithm Design for Computer System Design, Springer, Vienna, 1984, 49–106.
N.-F. Chen, C. L. Liu, On a class of scheduling algorithms for multiprocessor computing systems, in: T.-Y. Feng (ed.), Parallel Processing, Lecture Notes in Computer Science 24, Springer, Berlin, 1975, 1–16.
J. Y. Chung, J. W. S. Liu, K. J. Lin, Scheduling periodic jobs that allow imprecise results, IEEE Trans.Comput. 19, 1990, 1156–1173.
R. W. Conway, W. L. Maxwell, L. W. Miller, Theory of Scheduling, Addison Wesley, Reading, Mass., 1967.
E. G. Coffman, Jr., A survey of mathematical results in flow-time scheduling for computer systems, GI–3. Jahrestagung, Hamburg, Springer, Berlin, 1973, 25–46.
E. G. Coffman, Jr. (ed.), Scheduling in Computer and Job Shop Systems, J. Wiley, New York, 1976.
E. G. Coffman, Jr., R. Sethi, A generalized bound on LPT sequencing, RAIRO- Informatique 10, 1976, 17–25.
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.
D. Dolev, M. K. Warmuth, Scheduling flat graphs, SIAM J. Comput. 14, 1985, 638–657.
K. H. Ecker, R. Hirschberg, Task scheduling with restricted preemptions. Proc. PARLE93 - Parallel Architectures and Languages, Munich, 1993.
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 uniform processors 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.
M. R. Garey, Unpublished result.
E. Horowitz, S. Sahni, Exact and approximate algorithms for scheduling nonidentical processors, J. Assoc. Comput. Mach. 23, 1976, 317–327.
M. R. Garey, Optimal task sequencing with precedence constraints, Discrete Math. 4, 1973, 37–56.
M. R. Garey, R. L. Graham, Bounds on scheduling with limited resources, Operating System Review, 1973, 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. Sahni, 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, SIAM J. Algebraic Discrete Meth. 4, 1983, 72–93.
R. L. Graham, E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy 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 Department, Pennsylvania State 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.
R. L. Graham, Chapter 5 in: E. G. Coffman, Jr. (ed.), Scheduling in Computer and Job Shop Systems, J. Wiley, New York, 1976.
T. Gonzalez, S. Sahni, Preemptive scheduling of uniform processor systems, J. Assoc. Comput. Mach. 25, 1978, 92–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 processors, Oper. Res. 21, 1973, 846–847.
W. A. Horn, Some simple scheduling algorithms, Naval Res. Logist. Quart. 21, 1974, 177–185.
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.
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, 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 processors, 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.
N. Karmarkar, R. M. Karp, The differing method of set partitioning, Report UCB/CSD 82/113, Computer Science Division, University of California, Berkeley, 1982.
M. Kunde, Beste Schranke beim LP-Scheduling, Bericht 7603, Institut für Informatik and Praktische Mathematik, Universität Kiel, 1976.
E. L. Lawler, Optimal sequencing of a single processor 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 processor scheduling, in: A. Bachem, M. Grötschel, B. Korte (eds.) Mathematical Programming: The State of Art, Springer, Berlin, 1982, 202–234.
E. L. Lawler, Preemptive scheduling in precedence-constrained jobs on parallel processors, 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 processor scheduling with nonsimultaneous processor available time, Discrete Appl. Math. 30, 1991, 53–61.
J. K. Lenstra, Sequencing by Enumerative Methods, Mathematical Centre Tract 69, Mathematisch Centrum, Amsterdam, 1977.
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, 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 programming, J. Assoc. Comput. Mach. 25, 1978, 612–619.
J. W. S. Liu, K. J. Lin, C. L. Liu, A position paper for the IEEE Workshop on real-time operating systems, Cambridge, Mass, 1987.
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. Pulley-blank (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, in: S. C. Graves, A. H. G. Rinnooy Kan, P. H. Zipkin (eds.), Handbook in Operations Research and Man- agement Science, Vol. 4: Logistics of Production and Inventory, Elsevier, Amsterdam, 1993.
J. W. S. Liu, K. J. Lin, W. K. Shih, A. C. Yu, J. Y. Chung, W. Zhao, Algorithms for scheduling imprecise computations, in: A. M. Van Tilborg, G. M. Koob (eds.) Foundations of Real-Time Computing: Scheduling and Resource Management, Kluwer, Boston, 1991.
K. J. Lin, S. Natarajan, J. W. S. Liu, Imprecise results: utilizing partial com-putations in real-time systems, Proc. of the IEEE 8th Real-Time Systems Symposium, San Jose, California, 1987.
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. O’h Eigearthaigh, J. K. Lenstra, A. H. G. Rinnooy Kan (eds.), Combinatorial Optimization: Annotated Bibliographies, J. Wiley, Chichester, 1984.
G. Schmidt, Scheduling independent tasks with deadlines on semi-identical processors, J. Oper. Res. Soc. 39, 1988, 271–277.
J. K. Lenstra, A. H. G. Rinnooy Kan, P. Brucker, Complexity of processor 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.
J. B. Orlin, A faster strongly polynomial minimum cost flow algorithm, Proc.20th ACM Symposium on the Theory of Computing, 1988, 377–387.
M. Pattloch, G. Schmidt, Lotsize scheduling of two job types on identical processors, Discrete Appl. Math., 1996, 409–419.
C. N. Potts, L. N. Van Wassenhove, Single processor scheduling to minimize total late work, Report 8938/A, Econometric Institute,Erasmus University, Rotterdam, 1989.
C. N. Potts, L. N. Van Wassenhove, Approximation algorithms for scheduling a single processor to minimize total late work, Oper. Res. Lett. 11, 1992, 261–266.
A. H. G. Rinnooy Kan, Processor 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.
P. Rosenfeld, unpublished result. Rot66 M. H. Rothkopf, Scheduling independent tasks on parallel processors, Management Sci. 12, 1966, 347–447.
H. Röck, G. Schmidt, Processor 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.
G. Schmidt, Scheduling on semi-identical processors, ZOR A28, 1984, 153–162.
R. Sethi, Chapter 2 in: E. G. Coffman, Jr. (ed.), Scheduling in Computer and Job Shop Systems, J. Wiley, New York, 1976.
R. Sethi, On the complexity of mean flow time scheduling, Math. Oper. Res. 2, 1977, 320–330.
S. V. Sevastjanov, Private communication, 1991.
R. Slowifiski, Scheduling preemptible tasks on unrelated processors with additional resources to minimise schedule length, in G. Bracci, R. C. Lockemann (eds.), Lecture Notes in Computer Science, vol. 65, Springer, Berlin, 1978, 536–547.
R. Síowifiski, J. Wgglarz, Minimalno-czasowy model sieciowy z róznymi sposobami wykonywania czynnosci, Przeglad Statystyczny 24, 1977, 409–416.
J. D. Ullman, Chapter 4 in: E. G. Coffman, Jr. (ed.), Scheduling in Computer and Job Shop Systems, J. Wiley, New York, 1976.
J. Wgglarz, J. Blazewicz, W. Cellary, R. Slowinski, 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 Discrete Math. 5, 1984, 11–20.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Błażewicz, J., Ecker, K.H., Pesch, E., Schmidt, G., Węglarz, J. (2001). Scheduling on Parallel Processors. In: Scheduling Computer and Manufacturing Processes. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04363-9_5
Download citation
DOI: https://doi.org/10.1007/978-3-662-04363-9_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07545-2
Online ISBN: 978-3-662-04363-9
eBook Packages: Springer Book Archive