Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist gegebenenfalls nur via VPN oder Shibboleth (DFN-AAI) möglich. mehr Informationen...
The paper deals with a distributed approach for optimization problems based on the use of bioinspired algorithms. This class of algorithms allows us to split solutions into independent subsets and process it in separate streams. One of the main problems is a decomposition and subsequent convolution of the solution. The problem becomes more complex in those cases when several decomposition levels are required. From the point of view of computing power, the simultaneous processing of parallel threads requires significant CPU time and RAM resources. In this regard, the use of several compute nodes that interact via network interfaces contributes to an increase in computational resources and an enhance fault tolerance of the system. The paper proposes the distributed subsystem for NP-complete optimization problems solving, which allows to split a set of input data into subsets in an automated mode, distribute subtasks between computational nodes, and collect the results to solve the original problem. To confirm the system performance, a software implementation was developed in the Java and the message broker RabbitMQ to ensure the interaction of software agents with each other. A series of experiments were carried out, in which studies were conducted with several simultaneously running tasks and agents.