ISSN 0021-3454 (print version)
ISSN 2500-0381 (online version)

vol 64 / July , 2021

DOI 10.17586/0021-3454-2019-62-6-517-523

UDC 681.3


D. B. Borzov
Kursk State Technical University, Department Computational Sciences;

V. S. Titov
Southwest State University, Department of Computer Science, Kursk; Professor, Head of Department

R. G. Basov
Southwest State University ;

Read the full article 

Abstract. The problem of scheduling processor loading in multiprocessor systems of critical purpose is con-sidered. The proposed method of the load planning is focused on hardware realization in connection with impossibility of application of software. A specialized device for the load planning is developed; functional scheme of the device is described, analysis of its hardware and time complexity is presented. By summing up the execution time of operations by the elements of the device, taking into account the increase in the possible number of processors in the system, a dependency diagram is obtained. Analysis of the diagram allows to conclude that the operating time of the processor load planning device grows exponentially with the number of processors in the multiprocessor system, i.e. with the increase in the size of the load queue.
Keywords: multiprocessor system, critical system, processor, schedule, load plan, algorithm, functional scheme

  1. Voyevodin V. V., Voyevodin Vl. V. Parallel'nyye vychisleniya (Parallel Computing), St. Petersburg, 2002, 60S р. (in Russ.)
  2. Korneyev V.V. Parallel'nyye vychislitel'nyye sistemy (Parallel Computing Systems), Moscow, 1999, 340 р. (in Russ.)
  3. Flynn М. Prос. IEEE, 1966, no. 54, pp. 1901–1909.
  4. Flynn M. IEEE Trans. Computers, 1972, no. 9(21), pp. 94S–960.
  5. Thurber K.J. Large Scale Computer Architecture, Hayden Book Company, Rochelle Park, New Jersey, 1976.
  6. Tanayev V.S., Kovalev M.Ya. Teoriya raspisaniy. Gruppovyye tekhnologii (Scheduling Theory. Group Technology), Minsk, 1998, 290 р. (in Russ.)
  7. Lazarev A.A., Gafarov E.R. Teoriya raspisaniy. Zadachi i algoritmy (Scheduling Theory. Tasks and Al-gorithms), Moscow, 2011, 222 р. (in Russ.)
  8. Conway R.W., Maxwell W.L., Miller L.W. Theory of Scheduling, Addison-Wesley, 1967, 294 p.
  9. Shilo V.L. Populyarnyye tsifrovyye mikroskhemy: Spravochnik (Popular Digital ICs: Handbook), Chelyabinsk, 1988, 352 р. (in Russ.)
  10. Batushev V.A., Veniaminov V.N., Kovalev V.G. Mikroskhemy i ikh primeneniye (ICs and Their Applica-tion), Moscow, 1978, 248 р. (in Russ.)
  11. Tarabrin B.V., Lunin L.F., Smirnov Yu.N. Integral'nyye mikroskhemy. Spravochnik (Integrated Circuits. A Handbook), Moscow, 1984, 528 р. (in Russ.)
  12. Petrovskiy I.I. et al. Logicheskiye IS KR1533, KR1554. Spravochnik (Logic IC KR1533, KR1554. A Handbook), Moscow, 1993. (in Russ.)
  13. Makarova N.V. Statistika v Excel (Excel Statistics), Moscow, 2009, 368 р. (in Russ.)
  14. Sachs L. Statistische Auswertungsmethoden, Berlin, Springer-Verlag, 1968.
  15. Kobzar' A.I. Prikladnaya matematicheskaya statistika (Applied Mathematical Statistics), Moscow, 2006, 816 р. (in Russ.)