Skip to main content
SpringerLink
Log in

An Algorithm for Constructing Single Processor Static–Dynamic Schedules

  • Published:
Moscow University Computational Mathematics and Cybernetics Aims and scope Submit manuscript

Abstract

An extended approach is proposed for using algorithms to find the maximum flow in a transport network when constructing schedules for performing work with interruptions in a new class of problems of creating static–dynamic schedules. This is accomplished by projecting realtime systems with the architecture of integrated module avionics. The results from an experimental study confirm the high accuracy of the proposed algorithm.

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. A. Kostenko, “Hardware-software complexes architecture of airborne equipment,” Izv. Vyssh. Uchebn. Zaved., Priborostroen. 60, 229–233 (2017).

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  4. M. G. Furugyan, “Some algorithms for analysis and synthesis of real-time multiprocessor computing systems,” Program. Comput. Software 40, 21–27 (2014).

    Article  MathSciNet  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–303 (2005).

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  7. M. G. Furugyan, “Making schedules in multiprocessing systems with several Additional Resources,” J. Comput. Syst. Sci. Int. 56, 227–235 (2017).

    Article  MATH  Google Scholar 

  8. Th. Cormen, Ch. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms (MIT, Boston,MA, 2009).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Computational Mathematics and Cybernetics, Moscow State University, Moscow, 119991, Russia

    V. A. Kostenko & A. S. Smirnov

Authors
  1. V. A. Kostenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. S. Smirnov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V. A. Kostenko.

Additional information

Original Russian Text © V.A. Kostenko, A.S. Smirnov, 2018, published in Vestnik Moskovskogo Universiteta, Seriya 15: Vychislitel’naya Matematika i Kibernetika, 2018, No. 1, pp. 45–52.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kostenko, V.A., Smirnov, A.S. An Algorithm for Constructing Single Processor Static–Dynamic Schedules. MoscowUniv.Comput.Math.Cybern. 42, 44–50 (2018). https://doi.org/10.3103/S0278641918010053

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0278641918010053

Keywords

Search

Navigation