Skip to main content
SpringerLink
Log in

Planning computations in a multiprocessor system with unfixed parameters

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

Abstract

The problem of constructing a feasible preemptive multiprocessor schedule is considered for a case where directive intervals are assigned, processors can have arbitrary performance, and the amount of tasks depends linearly on the volume of additional resources allocated for them. In cases where a feasible schedule is not found with an allocated volume of additional resources, the problem of optimally correcting the directive intervals is considered. The solution is based on an analysis of the necessary and sufficient conditions of a feasible schedule’s existence.

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 (Nauka, Moscow, 1984; Kluwer, Dordrecht, 1994).

    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  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  4. E. G. Davydov, Operations Research (Vysshaya 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. Cybernet. 33, 202–205 (2009).

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  7. M. G. Furugyan, “Optimal correction of execution intervals for multiprocessor scheduling with additional resource,” J. Comput. Syst. Sci. Int. 54, 268–277 (2015).

    Article  MathSciNet  MATH  Google Scholar 

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

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

    Article  MathSciNet  MATH  Google Scholar 

  10. C. Martel, “Preemptive scheduling with release times, deadlines, and due times,” J. Assoc. Comput. Mach. 29, 812–829 (1982).

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computational Mathematics and Cybernetics, Moscow State University, Moscow, 119899, Russia

    M. G. Furugyan

  2. Dorodnitsyn Computing Center, 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, 2016, published in Vestnik Moskovskogo Universiteta, Seriya 15: Vychislitel’naya Matematika i Kibernetika, 2016, No. 1, pp. 40–45.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Furugyan, M.G. Planning computations in a multiprocessor system with unfixed parameters. MoscowUniv.Comput.Math.Cybern. 40, 41–46 (2016). https://doi.org/10.3103/S0278641915040044

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation