Skip to main content
SpringerLink
Log in

A survey of scheduling methods for multiprocessor systems

  • Published:
Journal of Soviet Mathematics Aims and scope Submit manuscript

Abstract

The survey paper is devoted to the present state of scheduling methods for multiprocess or systems. A number of precise and heuristic methods, anomalies in the heuristic methods, and results of computational experiments are considered.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Literature cited

  1. A. B. Barskii, “Automatic distribution of work between two computing devices of the same productivity,” Izv. Akad. Nauk SSSR, Tekh. Kibern., No. 4, 38–51 (1968).

    Google Scholar 

  2. A. B. Barskii, “Minimization of the number of computers in the realization of a computational process in given time,” Izv. Akad. Nauk SSSR, Tekh. Kibern., No. 6, 69–74 (1968).

    Google Scholar 

  3. A. B. Barskii, “Extremal problems of planning the operation of computing complexes,” Kibernetika, No. 3, 69–73 (1970).

    Google Scholar 

  4. A. B. Barskii, “On the construction of dispatchers for computing systems,” Izv. Akad. Nauk SSSR, Tekh. Kibern., No. 1, 113–118 (1971).

    Google Scholar 

  5. A. B. Barskii, “Two optimization problems for using inhomogeneous computing systems,” Izv. Akad. Nauk SSSR, Tekh. Kibern., No. 4, 119–125 (1971).

    Google Scholar 

  6. G. A. Bekishev, “On a problem of partitioning vertices of an oriented graph into classes,” Diskretn. Anal.,8, 165–172 (1966).

    Google Scholar 

  7. N. J. Brain, “The theory of enumerations of Polya,” in: Applied Combinatorial Math., Moscow (1968).

  8. B. A. Golovkin, “Statistical methods of formalization and dispatching parallel computational processors,” Avtom. Telemekh., No. 2, 163–169 (1974).

    Google Scholar 

  9. T. M. Goloskokova and V. G. Khoroshev, “Algorithms for the functioning of homogeneous universal computing systems in the simplest situations,” Vychisl. Sistemy, No. 39, 15–28 (1970).

    Google Scholar 

  10. D. N. Kiknadze, “A method of analysis of the structure of parallel algorithms realizable on a homogeneous computing system,” in: Computing Systems [in Russian], Novosibirsk (1967), pp. 89–96.

  11. E. A. Kopninskii, “An algorithm for the parallel execution of a program,” Zh. Vychisl. Mat. Mat. Fiz., 9, No. 5, 1137–1144 (1969).

    Google Scholar 

  12. V. E. Kotov, “The theory of parallel programming. Applied aspects,” Kibernetika, No. 1, 1–16 (1974).

    Google Scholar 

  13. V. S. Linskii and M. D. Kornev, “Formation of optimal schedulings for parallel operating processors,” Izv. Akad. Nauk SSSR, Tekh. Kibern., No. 3, 160–167 (1972).

    Google Scholar 

  14. D. A. Pospelov, Introduction to the Theory of Computing Systems [in Russian], Moscow (1972).

  15. V. S. Sokhranskaya, “Solutions on the computer of problems of parallel sequencing,” Zap. Nauchn. Sem. Leningr. Otd. Mat. Inst. Akad. Nauk SSSR,35, 138–141 (1973).

    Google Scholar 

  16. V. F. Turchin, “Programming in the language REFAL,” Preprint Inst.Prikl. Mekh. ANSSSR, Nos. 41,43, 46,47, 49, Moscow (1971).

  17. T. A. Tushkina and K. V. Shakhbazyan,, “Solution of some problems of parallel sequencing,” Zap. Nauchn. Sem. Leningr. Otd. Mat. Inst. Akad. Nauk SSSR,18, 16–26 (1970).

    Google Scholar 

  18. L. R. Ford and D. R. Fulkerson, Flows in Networks [in Russian], Moscow (1966).

  19. F. Harary, “Combinatorial problems of enumerating graphs,” in: Applied Combinatorial Mathematics [in Russian], Moscow (1968), pp. 107–140.

  20. T. S. Khu, “Parallel sequencing and problems of line assembly,” Kibern. Sb., Nov. Ser., No. 4, 41–56 (1967).

    Google Scholar 

  21. K. V. Shakhbazyan, “The choice of enumeration in problems of parallel sequencing,” Zap. Nauchn. Sem. Leningr. Otd. Inst. Akad. Nauk SSSR,18, 27–30 (1970).

    Google Scholar 

  22. K. V. Shakhbazyan and T. A. Tushkina, “Parallel sequencing of several processors,” Kibernetika, No. 5, 38–42 (1971).

    Google Scholar 

  23. K. V. Shakhbazyan and T. A. Tushkina, “The method of branches and boundaries for problems of parallel sequencing,” Zap. Nauchn. Sem. Leningr. Otd. Mat. Inst. Akad. Nauk SSSR,35, 146–155 (1973).

    Google Scholar 

  24. K. V. Shakhbazyan, T. A. Tushkina, and N. B. Lebedinskaya, “Optimal schedulings for computing processes with the structure of parallel-sequential grids,” System and Theoretical Programming, Vol. 1, Texts of Reports of the Third All-Union Symposium, Kishinev (1974), pp. 239–244.

    Google Scholar 

  25. K. V. Shakhbazyan, T. A. Tushkina, and N. B. Lebedinskaya, “An algorithm for composing an optimal scheduling for parallel-sequential grids,” Zap. Nauchn. Sem. Leningr. Otd. Mat. Inst. Akad. Nauk SSSR, 48, 200–204 (1974).

    Google Scholar 

  26. K. V. Shakhbazyan, T. A. Tushkina, and N. B. Lebedinskaya, “On the optimal execution of computing processes by two processors,” Upr. Sistemy Mashiny, No. 1, 93–94 (1975).

    Google Scholar 

  27. K. V. Shakhbazyan, T. A. Tushkina, V. S. Sokhranskaya, and L. M. Tovkach, “An experiment on the realization of dispatcher algorithms for multiprocessor systems,” Upr. Sistemy Mashiny, No. 3, 84–85 (1975).

    Google Scholar 

  28. Yu. S. Shvarts, “An automatic process for sequencing modules and its application to parallel programming,” Kibern. Sb., No. 9, 240–269 (1964).

    Google Scholar 

  29. E. C. Coffman, “A survey of mathematical results in flow-time scheduling for computer systems,” Lect. Notes Computer Sci., No. 1, 111–141 (1973).

    Google Scholar 

  30. W. L. Eastman, S. Even, and I. M. Isaacs, “Bounds for the optimal scheduling of jobs on processors,” Manag. Sci.,11, No. 2, 268–279 (1964).

    Google Scholar 

  31. G. Estrin and R. Turn, “Automatic assignment of computations in a variable structure computer system,” IEEE Trans. Electron. Comput.,EC-12, No. 6, 755–773 (1963).

    Google Scholar 

  32. E. B. Fernandez and B. Buspell, “Bounds on the number of processors and time for multiprocessor optimal schedules,” IEEE Trans. Comput.,C-22, No. 8, 745–754 (1973).

    Google Scholar 

  33. M. Fuii, T. Kasami, and K. Ninomiya, “Optimal sequencing of the equivalent processors,” SIAM J. Appl. Math.,17, No. 4, 784–789 (1969).

    Google Scholar 

  34. R. L. Graham, “Bounds on multiprocessing timing anomalies,” SIAM J. Appl. Math.,17, No. 2, 416–429 (1969).

    Google Scholar 

  35. M. Held and R. M. Karp, “A dynamic programming approach to sequencing problems,” J. Soc. Industr. Appl. Math.,10, No. 1, 196–210 (1962).

    Google Scholar 

  36. R. M. Karp and R. E. Miller, “Properties of a model for parallel computations determinacy, termination, queueing,” SIAM J. Appl. Math.,14, No. 6, 1390–1411 (1966).

    Google Scholar 

  37. M. T. Kaufman, “An almost-optimal algorithm for the assembly line scheduling problem,” IEEE Trans. Comput.,C-23, No. 11, 10–50 (1974).

    Google Scholar 

  38. M. T. Kaufman, “Anomalies in scheduling unit-time tasks,” Stanford Univ. Techn., No. 34, 1–22 (1972).

    Google Scholar 

  39. J. D. C. Little, K. G. Murty, D. W. Sweeney, and C. Karel, “An algorithm for the traveling salesman problem,” Oper. Res.,11, No. 6, 972–989 (1963).

    Google Scholar 

  40. D. Martin and G. Estrin, “Models of computations and systems-evaluation of vertex probabilities in graph models of computations,” J. Assoc. Comput. Mach.,14, No. 2, 281–299 (1967).

    Google Scholar 

  41. D. F. Martin and G. Estrin, “Experiments on models of computations and systems,” IEEE Trans. Electron. Comput.,EC-16, No. 1, 59–69 (1967).

    Google Scholar 

  42. D. F. Martin and G. Estrin, “Models of computational systems-cyclic to acyclic graph transformation,” IEEE Trans. Electron. Comput.,EC-16, No. 1, 70–79 (1967).

    Google Scholar 

  43. D. F. Martin and G. Estrin, “Path length computations on graph models of computations,” IEEE Trans. Comput.,C-18, No. 6, 530–536 (1969).

    Google Scholar 

  44. R. McNaughton, “Scheduling with deadlines and loss functions,” Manag. Sci.,6, No. 1, 1–12 (1959).

    Google Scholar 

  45. R. R. Muntz and E. G. Coffman, “Optimal preemptive scheduling on two-processor systems,” IEEE Trans. Comput.,C-18, No. 11, 1014–1020 (1969).

    Google Scholar 

  46. R. R. Muntz and E. G. Coffman, “Preemptive scheduling of real-time tasks on multiprocessor systems,” J. Assoc. Comput. Mach.,17, No. 2, 324–338 (1970).

    Google Scholar 

  47. T. A. J. Nicolson, A Sequential Method for Discrete Optimization Problems and Its Applications, Combinatorial Mathematics and Its Applications, Academic Press, New York (1971).

    Google Scholar 

  48. C. V. Ramamoorthy and M. J. Gonzalez, “Subexpression ordering in the execution of arithmetic expressions,” Commun. ACM,14, No. 7, 479–485 (1971).

    Google Scholar 

  49. C. V. Ramamoorthy, K. M. Chandy, and M. J. Gonzalez, “Optimal scheduling strategies in a multiprocessor system,” IEEE Trans. Comput.,C-21, No. 2, 137–146 (1972).

    Google Scholar 

  50. R. Reiter, “Scheduling parallel computations,” J. Assoc. Comput. Mach.,15, No. 4, 590–599 (1968).

    Google Scholar 

Download references

Authors
  1. K. V. Shakhbazyan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. T. A. Tushkina
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 54, pp. 229–258, 1975.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shakhbazyan, K.V., Tushkina, T.A. A survey of scheduling methods for multiprocessor systems. J Math Sci 15, 651–669 (1981). https://doi.org/10.1007/BF01086545

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01086545

Keywords

Search

Navigation