Skip to main content
SpringerLink
Log in

Algorithms for planning Resource-Intensive computing tasks in a hybrid supercomputer environment for simulating the characteristics of a quantum rotation sensor and performing engineering calculations

  • Published:
Automatic Control and Computer Sciences Aims and scope Submit manuscript

Abstract

The article considers the problem of planning computing tasks in hybrid supercomputer systems using the example of the Polytechnic Supercomputer Center. We have explored the classes of tasks using the distribution of calculations planning and shown their specific character when using hybrid supercomputer resources. With this in mind, we have developed the algorithms to optimize the use of resources of supercomputer systems. Furthermore, we have proposed an algorithm predicting task execution time taking into account the characteristics of the computation node and task parameters. Finally, after conducting the research we have compared the developed algorithms.

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. Popov, E.N., Barantsev, K.A., Litvinov, A.N., Kuraptsev, A.S., Voskoboinikov, S.P., Ustinov, S.M., Larionov, N.V., Liokumovich, L.B., Ushakov, N.A., and Shevchenko, A.N., Frequency line of nuclear magnetic resonance in quantum rotation sensor: Negative effect of detection circuit, Gyroscopy Navig., 2017, vol. 8, no. 2, pp. 91–96.

    Article  Google Scholar 

  2. Lukashin, Al. and Lukashin, An., Resource scheduler based on multi-agent model and intelligent control system for OpenStack, Lect. Notes Comput. Sci., 2014, vol. 8638, pp. 556–566.

    Article  Google Scholar 

  3. Ross, G.T. and Soland, R.M., A branch and bound algorithm for the generalized assignment problem, Math. Progr., 1975, no. 8, pp. 91–103.

    Article  MathSciNet  MATH  Google Scholar 

  4. Blazewicz, J., Ecker, K., and Pesch, E., Handbook on Scheduling, in From Theory to Applications, Berlin: Springer, 2007.

    Google Scholar 

  5. Leung, J.Y., Handbook of Scheduling. Algorithms, Models and Performance Analysis, Boca Raton: CRC Press, 2004.

    MATH  Google Scholar 

  6. Gergel, V.P. and Polezhaev, P.N., The study of parallel job scheduling algorithms for cluster computing systems using a simulator, Bull. Nizhni Novgorod Lobachevsky Univ., 2010, vol. 5, no. 1, pp. 201–208.

    Google Scholar 

  7. Martello, S. and Toth, P., Knapsack Problems, New York: Wiley, 1990.

    MATH  Google Scholar 

  8. Kolesar, P.J., A branch and bound algorithm for the knapsack problem, Manage. Sci., 1967, no. 13, pp. 723–735.

    Article  Google Scholar 

  9. Cohen, R., Katzir, L., and Raz, D., An efficient approximation for the generalized assignment problem, Inf. Process. Lett., 2006, vol. 100, no. 4, pp. 162–166.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Peter the Great St. Petersburg Polytechnic University, St. Petersburg, 195251, Russia

    A. S. Ilyashenko, Al. A. Lukashin, V. S. Zaborovsky & An. A. Lukashin

Authors
  1. A. S. Ilyashenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Al. A. Lukashin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. V. S. Zaborovsky
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. An. A. Lukashin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. S. Ilyashenko.

Additional information

The article is published in the original.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ilyashenko, A.S., Lukashin, A.A., Zaborovsky, V.S. et al. Algorithms for planning Resource-Intensive computing tasks in a hybrid supercomputer environment for simulating the characteristics of a quantum rotation sensor and performing engineering calculations. Aut. Control Comp. Sci. 51, 426–434 (2017). https://doi.org/10.3103/S0146411617060049

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation