Synthesizing a Multiprocessor System for Scheduling with Interruptions and Execution Intervals

  • M. G. FurugyanEmail author


A problem of finding processor performances in a multiprocessor system is studied such that an admissible schedule with interruptions exists for the given set of jobs with execution intervals. Cases are considered when (1) the amounts of jobs are fixed and (2) linearly depend on the amount of extra resources allocated for them; (3) processor performances are bounded above and below. In all three cases, the original problem is reduced to the system of linear inequalities. The algorithm for finding Pareto optimal solutions is described.



  1. 1.
    V. S. Tanaev, V. S. Gordon, and Ya. M. Shafranskii, Scheduling Theory. Single Stage Systems (Nauka, Moscow, 1984; Kluwer Academic, Dordrecht, 1994).Google Scholar
  2. 2.
    T. Gonzales and S. Sahni, “Preemptive scheduling of uniform processor systems,” J. Assoc. Comput. Machin. 25, 92–101 (1978).MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    A. Federgruen and H. Groenevel, “Preemptive scheduling of uniform machines by ordinary network flow technique,” Manage. Sci. 32, 341–349 (1986).MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    C. Martel, “Preemptive scheduling with release times, deadlines, and due times,” J. ACM 29, 812–829 (1982).MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    P. Brucker, Scheduling Algorithms (Springer, Heidelberg, 2007).zbMATHGoogle Scholar
  6. 6.
    V. I. Tsurkov, “Decomposition principle for block-separable systems,” Dokl. Akad. Nauk SSSR 246, 27–31 (1979).MathSciNetzbMATHGoogle Scholar
  7. 7.
    A. A. Mironov and V. I. Tsurkov, “Transport problems with a minimax criterion,” Dokl. Akad. Nauk 346, 342 (1996).Google Scholar
  8. 8.
    A. A. Mironov and V. I. Tsurkov, “Minimax in transportation models with integral constraints: II,” J. Comput. Syst. Sci. Int. 42, 562 (2003).zbMATHGoogle Scholar
  9. 9.
    A. A. Mironov, V. V. Fedorchuk, and V. I. Tsurkov, “Minimax in transportation models with integral constraints: II,” J. Comput. Syst. Sci. Int. 44, 732 (2005).zbMATHGoogle Scholar
  10. 10.
    M. G. Furugyan, “Some algorithms for analysis and synthesis of real-time multiprocessor computing systems,” Program. Comput. Software 40, 21 (2012).MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    M. G. Furugyan, “Computation planning in multiprocessor real time automated control systems with an additional resource,” Autom. Remote Control 76, 487 (2015).MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    M. G. Furugyan, “Optimal correction of execution intervals for multiprocessor scheduling with additional resource,” J. Comput. Syst. Sci. Int. 54, 268 (2015).MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Pleiades Publishing, Ltd. 2019

Authors and Affiliations

  1. 1.Dorodnicyn Computing Center, Federal Research Center Computer Science and Control, Russian Academy of SciencesMoscowRussia

Personalised recommendations