Skip to main content
SpringerLink
Log in

Computation scheduling in multiprocessor systems with several types of additional resources and arbitrary processors

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

Abstract

The problem of feasible preemptive scheduling in a multiprocessor system is considered for when scheduled intervals are assigned, processor performance can be arbitrary, there are several types of additional resources, and the time for executing tasks depends linearly on the amount of additional resources allocated to them. Polynomial algorithms based on reducing the original problem to a flow problem and a linear programming problem 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. Single-Stage Systems (Kluwer Academic, Dordrecht, 1994; Nauka, Moscow, 1984).

    Book  Google Scholar 

  2. 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 

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

    Article  MathSciNet  MATH  Google Scholar 

  4. E. G. Davydov, Study of Operations (Vyssh. Shkola, Moscow, 1990) [in Russian].

    Google Scholar 

  5. 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 

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

    Article  MathSciNet  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  Google Scholar 

  8. M. G. Furugyan, “Planning computations in a multiprocessor system with unfixed parameters,” Moscow Univ. Comput. Math. Cybern. 33, 41–46 (2016).

    Article  MathSciNet  MATH  Google Scholar 

  9. V. A. Kostenko and A. V. Plakunov, “An algorithm for constructing single machine schedules based on ant colony approach,” J. Comput. Syst. Sci. Int. 52, 928–937 (2013).

    Article  MathSciNet  MATH  Google Scholar 

  10. V. A. Kostenko, “Scheduling algorithms for real-time computing systems admitting simulation models,” Programming Comput. Software 39, 255–267 (2013).

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    M. G. Furugyan

  2. Dorodnitsyn Computing Center, Federal Research Center “Computer Science and Control,”, Russian Academy of Sciences, Moscow, 119333, 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, 2017, published in Vestnik Moskovskogo Universiteta, Seriya 15: Vychislitel’naya Matematika i Kibernetika, 2017, No. 3, pp. 38–45.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Furugyan, M.G. Computation scheduling in multiprocessor systems with several types of additional resources and arbitrary processors. MoscowUniv.Comput.Math.Cybern. 41, 145–151 (2017). https://doi.org/10.3103/S0278641917030049

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation