Swarm algorithm for scheduling of multiprocessor systems

Abstract

Swarm algorithm for scheduling of multiprocessor systems

Lebedev B.K., Lebedev O.B., Lebedeva E.O.

Incoming article date: 16.09.2017

We consider the problem of drawing up the implementation plan of the complex programs in multiprocessor computer systems (MCS). MCS is composed of several processors working in parallel. On MCS is input multiple independent streams of applications (programs) to be distributed among the processors. The computing system may consist of identical or different from the performance of processors. Taken into account when switching between different classes of applications received by the processor. The solution is presented as a job application distribution planning problem for processors and determining a queue of requests for service processor. Optimization of planning in the case of multi-level stage is to minimize the execution time of all applications. The basis of the work of the algorithm put the mechanisms of adaptive behavior of an ant colony. The time complexity of this algorithm depends on the lifetime of colonies (number of iterations) and the number of works and performers.

Keywords: multiprocessor system, planning, multi-level part, distribution task optimization, ant algorithm