Skip to main content
SpringerLink
Log in

Scheduling in Multiprocessor Systems with Additional Restrictions

  • Systems Analysis and Operations Research
  • Published:
Journal of Computer and Systems Sciences International Aims and scope

Abstract

An admissible multiprocessor preemptive scheduling problem is solved for the given execution intervals. In addition, a number of generalizations are considered—interprocessor communications are arbitrary and may vary in time; costs for processing interruptions and switches from one processor to another are taken into account; and besides the processors, additional resources are used. Algorithms based on reducing the original problem to finding paths of a specific length in a graph, a flow problem, and an integer system of linear restrictions are developed.

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

References

  1. V. S. Tanaev, V. S. Gordon, and Ya. M. Shafranskii, Scheduling Theory. One-Stage Systems (Nauka, Moscow, 1984) [in Russian].

    Google Scholar 

  2. T. Gonzales and S. Sahni, “Preemptive scheduling of uniform processor systems,” J. Assoc. Comput. Machin. 25, 92–101 (1978).

    Article  MathSciNet  MATH  Google Scholar 

  3. A. Federgruen and H. Groenevel, “Preemptive scheduling of uniform machines by ordinary network flow technique,” Manage. Sci. 32, 341–349 (1986).

    Article  MathSciNet  MATH  Google Scholar 

  4. P. Brucker, Scheduling Algorithms (Springer, Heidelberg, 2007).

    MATH  Google Scholar 

  5. D. S. Guz and M. G. Furugyan, “Computation scheduling in multiprocessor real-time automatic control systems with constrained processor memory,” Autom. Remote Control 66, 295 (2005).

    Article  MATH  Google Scholar 

  6. B. V. Grechuk and M. G. Furugyan, “Optimal preemptive scheduling in multiprocessor systems with incomplete communication graph,” Cybern. Syst. Anal. 41, 397–402 (2005).

    Article  MATH  Google Scholar 

  7. E. O. Kosorukov and M. G. Furugyan, “Some algorithms for resource allocation in multiprocessor systems,” Moscow Univ. Comput. Math. Cybernet. 33, 202 (2009).

    Article  MathSciNet  MATH  Google Scholar 

  8. M. G. Furugyan, “Computation planning in multiprocessor real time automated control systems with an additional resource,” Autom. Remote Control 76, 487 (2015).

    Article  MathSciNet  MATH  Google Scholar 

  9. M. G. Furugyan, “Making schedules in multiprocessing systems with several additional resources,” J. Comput. Syst. Sci. Int. 56, 227 (2017).

    Article  MATH  Google Scholar 

  10. M. G. Furugyan, “Computation scheduling in multiprocessor systems with several types of additional resources and arbitrary processors,” Moscow Univ. Comput. Math. Cybernet. 41, 145 (2017).

    Article  MathSciNet  MATH  Google Scholar 

  11. A. A. Mironov and V. I. Tsurkov, “Hereditarily minimax matrices in models of transportation type,” J. Comput. Syst. Sci. Int. 37, 927 (1998).

    MATH  Google Scholar 

  12. A. A. Mironov and V. I. Tsurkov, “Minimax under nonlinear transportation constraints,” Dokl. Math. 64, 351 (2001).

    MATH  Google Scholar 

  13. A. A. Mironov and V. I. Tsurkov, “Transportation problems with minimax criteria,” Dokl. Math. 53, 119 (1996).

    MATH  Google Scholar 

  14. A. A. Mironov and V. I. Tsurkov, “Minimax in transportation models with integral constraints: I,” J. Comput. Syst. Sci. Int. 42, 562 (2003).

    MATH  Google Scholar 

  15. 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).

    MATH  Google Scholar 

  16. A. A. Mironov and V. I. Tsurkov, “Network models with fixed parameters at the communication nodes. 1,” J. Comput. Syst. Sci. Int. 32 (6), 1–11 (1994).

    MathSciNet  MATH  Google Scholar 

  17. A. A. Mironov and V. I. Tsurkov, “Network models with fixed parameters at the communication nodes. 2,” J. Comput. Syst. Sci. Int. 33 (3), 107–116 (1995).

    MathSciNet  MATH  Google Scholar 

  18. Yu. E. Malashenko and N. M. Novikova, “Analysis of multiuser network systems taking into account uncertainty,” J. Comput. Syst. Sci. Int. 37, 292 (1998).

    MATH  Google Scholar 

  19. Yu. E. Malashenko and N. M. Novikova, “The analysis of multiuser network systems under uncertainty: 7. The problem of standard vulnerability analysis of a multicommodity flow network,” J. Comput. Syst. Sci. Int. 38, 589 (1999).

    MATH  Google Scholar 

  20. Th. H. Cormen, Ch. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms (The MIT Press, Cambridge, MA, 2009).

    MATH  Google Scholar 

  21. B. Korte and J. Vygen, Combinatorial Optimization. Theory and Algorithms (Springer, Berlin, Heidelberg, 2006).

    MATH  Google Scholar 

  22. D. T. Fillips and A. Garcia-Diaz, Fundamentals of Network Analysis (Prentice-Hall, Englewood Cliffs, NJ, 1981).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dorodnicyn Computing Center, Russian Academy of Sciences, Moscow, 119991, Russia

    M. G. Furugyan

Authors
  1. M. G. Furugyan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. G. Furugyan.

Additional information

Original Russian Text © M.G. Furugyan, 2018, published in Izvestiya Akademii Nauk, Teoriya i Sistemy Upravleniya, 2018, No. 2, pp. 52–59.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Furugyan, M.G. Scheduling in Multiprocessor Systems with Additional Restrictions. J. Comput. Syst. Sci. Int. 57, 222–229 (2018). https://doi.org/10.1134/S1064230718020077

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1064230718020077

Search

Navigation