PLANNING OF DOWNLOAD PROCESSORS IN MULTIPROCESSOR SYSTEMS OF CRITICAL PURPOSE

At present, multiprocessor systems of a critical nature are widely used. Such systems are used for tracking, aiming, observing, etc. Such tasks, as a rule, require maximizing productivity and reducing the time to solve a problem. For these purposes, the initial selection of non-dependent linear, conditional and cyclic sections of sequential programs is used [1]. This is done to release fragments of programs that can be assigned to execution on processors in such a way that during execution they exchange data with neighboring processors as little as possible. Due to this, it is possible to partially improve the performance of a multiprocessor computing system, together with a decrease in the overall execution time of the entire task as a whole. For systems of the considered nature of the processor of the entire system, it is desirable to assign program fragments so that they are constantly loaded throughout the solution of the entire problem. This is another way to improve the performance of a multiprocessor system. It is obvious that the use of software for this purpose is not real due to the criticality of the time parameter. Therefore, it is relevant to use methods and corresponding hardwareoriented algorithms for scheduling processor loads, which is the subject of research in this article. The article shows the relevance of the constant loading of processors of multiprocessor systems with a high availability factor. The necessity of drawing up a plan for loading processors to support this coefficient is substantiated. An appropriate method and algorithm for multiprocessor systems for critical purposes (tracking systems, surveillance, aiming, etc.) are proposed.

1. Voevodin V.V. Parallel'nye vychislenija. Saint-Petersburg, BHV – Peterburg Publ., 2002, 608 p.

2. Trahtengerc Je.A. Vvedenie v teoriju analiza i rasparallelivanija programm JeVM v processe transljacii. Moscow, Nauka Publ., 1981, 254 p.

3. Korneev V.V. Parallel'nye vychislitel'nye sistemy. Moscow, Nolidzh Publ., 1999, 340 p.

4. Djubrjuks S.A., Borzov D.B. Metod vyjavlenija parallelizma vnutri linejnyh uchastkov posledovatel'nyh programm i ego apparatnaja realizacija. Izvestija vuzov. Priborostroenie, 2008, vol. 2, pp. 34–38.

5. Tkachev P.Ju., Borzov D.B. Metod i algoritm poiska linejnyh uchastkov vnutri ciklov s posledujushhem rasparallelivaniem. Izvestija Jugo-Zapadnogo gosudarstvennogo universiteta, 2015, no.5(62), pp. 16-21.

6. Borzov D.B., Djubrjuks S.A., Titov V.S. Vyjavlenie parallelizma vnutri linejnyh uchastkov posledovatel'nyh programm so svjazjami po upravleniju. Mashinostroenie i tehnosfera XXI veka. Sbornik trudov XIV Mezhdunarodnoj nauchno–tehnicheskoj konferencii. Doneck, 2007, vol. 2. pp. 26–30.

7. Babajan B.A., Bocharov A.V. Mnogoprocessornye JeVM i metody ih proektirovanija; ed. by Smirnov Ju.M. Moscow, Vysshaja shkola Publ., 1990, 142 p.

8. Tanaev V.S., Kovalev M.Ja. Teorija raspisanij. Gruppovye tehnologii. Minsk, 1998, 290 p.

9. Lazarev A.A., Gafarov E.R. Teorija raspisanij: zadachi i algoritmy. Moscow, 2011, pp.31-32.

10. Konvej R.V., Maksvell V.L., Miller L.V. Teorija raspisanij. Moscow, Nauka Publ., 1975, 365 p.

11. Antonov A. Pod zakonom Amdala (rus.). Komp'juterra. 11.02.2002, no. 430.

12. Amamija M., Tanaka Ju. Arhitektura JeVM i iskusstvennyj intellekt. Moscow, Mir Publ., 1993, 400 p.