Open AccessPLANNING OF DOWNLOAD PROCESSORS IN MULTIPROCESSOR SYSTEMS OF CRITICAL PURPOSE
Author(s) -
D.B. Borzov,
Ilya I. Masyukov
Publication year - 2019
Publication title -
izvestiâ ûgo-zapadnogo gosudarstvennogo universiteta
Language(s) - English
Resource type - Journals
eISSN - 2686-6757
pISSN - 2223-1560
DOI - 10.21869/2223-1560-2018-22-6-168-174
Subject(s) - multiprocessing , computer science , symmetric multiprocessor system , multiprocessor scheduling , scheduling (production processes) , parallel computing , task (project management) , distributed computing , operating system , dynamic priority scheduling , schedule , rate monotonic scheduling , operations management , management , economics
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.