Search

Search Results

• A MODEL OF RESOURCES ALLOCATION INFORMATION PROCESS IN DYNAMIC DISTRIBUTED COMPUTING ENVIRONMENTS

  А.B. Klimenko

  110-120

  2025-10-01

  Abstract ▼

  The article considers the issue of modeling the information process of distributing computing resources in geo-distributed heterogeneous dynamic computing environments. The relevance of the work is due to the fact that by now "cloud" data processing systems are becoming insufficient due to the need to process large volumes of data in real time regime. In this regard, the  "fog" and "edge" computing are in use. This implies localization of data processing in order to reduce the time required for this, on the one hand, and on the other hand, limitations on the computing power of devices leads to the need for a distributed solution of computing problems in a heterogeneous, dynamic and geographically distributed environment. This entails the need to develop new methods and algorithms for computing resources allocation, since previously developed methods did not take into account the properties of geographic distribution and dynamics of computing environments. The model of the information process of computing resources allocation proposed in this work includes the parameters of the resource cost of data transfers over the network individually for the nodes participating in the data transfer route, as well as the process of distribution of computing resources, which is what distinguishes it from analogs. The conducted experimental studies confirm the feasibility of the proposed model usage for the computing resources allocation in geo-distributed heterogeneous dynamic computing environments. The practical significance lies in reducing the resource intensity of the process of distribution of computing resources and the process of solving a computing problem

• THE USE OF HETEROGENEOUS COMPUTING NODES IN GRID SYSTEMS IN SOLVING COMBINATORIAL PROBLEMS

  А.М. Albertian, I. I. Kurochkin, E.I. Vatutin

  142-153

  2021-10-05

  Abstract ▼

  The main goal of this work is to create a parallel application that performs computations using a multithreaded execution model, optimized to make the best utilization of all available hardware resources. One of the main implementation requirements is to optimize application per-formance on different computer architectures, and to enable parallel execution of the application on various computing devices that are part of a heterogeneous computing system. The possibility of applying various methods of software and algorithmic optimization on multiprocessor architec-tures of different generations was investigated as well as the effectiveness of their use for highly loaded multithreaded applications was estimated. The problem of quasi-optimal dynamic distribu-tion of computational tasks among all currently available computing devices of a heterogeneous computing system was also solved. Currently, not only multiprocessor computing systems are used to solve large computational problems, but also various types of distributed systems. Distributed computing systems have a number of features: possible failures of nodes and communication channels, unstable operating time of nodes, possible errors in calculations, heterogeneity of com-puting nodes. By heterogeneity of computing nodes, we will understand not only the different com-puting capacity and different architectures of central processors, but also the presence of other devices on the node capable of performing calculations. Such devices include video cards and mathematical coprocessors. A node of a distributed computing system will be called heterogene-ous if, in addition to one or more central processing units, it contains additional computing devic-es. When solving a computational problem on a distributed system, it is necessary to maximize the utilization of all available computing resources. To do this, it is necessary not only to distribute computing subtasks to nodes in accordance with their computing capacity, but also to take into account the features of additional computing devices. This work is devoted to the study of methods for maximizing the resources utilization of heterogeneous nodes.

• BIOINSPIRED METHOD FOR CLASSIFICATION OF DISTRIBUTED RESOURCES FOR DISPATCHING IN GRID-COMPUTING

  D.Y. Kravchenko , Y.A. Kravchenko, V.V. Markov , A. E. Saak

  2021-11-14

  Abstract ▼

  The article is devoted to solving the problem of scheduling distributed computing resources
  based on their classification by the bioinspired search method to improve the efficiency of gridcomputing
  functioning. The relevance of the problem is justified by a significant increase in the
  demand for the paradigm of distributed computing in conditions of information overflow and uncertainty.
  The article deals with the problems of scheduling heterogeneous computing resources
  when solving complex professional and scientific problems arriving at different points in time,
  based on the classification according to significant signs of resource compliance and readiness. A
  comparative review of existing analogues is carried out. The formulation of the problem to be
  solved in the context of the selected research topic is formulated. The strategy of choosing
  bioinspired modeling for solving the problem has been substantiated. The aspects of various decentralized
  bioinspired methods effectiveness of the use are analyzed. It is proposed to solve the
  problem of scheduling computational resources based on determining the correspondence of the
  resource to the required class. The classification is carried out on the basis of the bioinspired
  optimization method application, built on the basis of the Fish School Search algorithm. The use of
  the population bioinspired method allows us to provide unprecedented parallelism in obtaining
  alternative solutions and to optimize the distribution of available computing resources depending
  on the sets of significant features. The object of the research is the processes of data classification,
  which include ordered sequences of actions aimed at the distribution of computing resources by
  classes of problems to be solved. The subject of the research is bioinspired methods for solving the
  problem of data classification in grid-computing. To evaluate the effectiveness of the proposed
  method, a software application was developed and a computational experiment was carried outwith a different number of computing resources generated classes. Each computing resource has a
  certain set of attributes, which is a vector of its features. The cosine measure of the similarity between
  a resource attributes vector and a certain class attributes vector is a classification criterion.
  To improve the quality of the dispatching process, the task of classifying computing resources is
  solved for a variety of options for organizing the flows of complex tasks to be solved in gridcomputing.
  The obtained quantitative estimates demonstrate the time savings in solving the problems
  of scheduling distributed computing resources based on their classification by the bioinspired
  search method at least 7 %. The time complexity in the considered examples was . The described
  studies have a high level of theoretical and practical significance and are directly related
  to the solution of artificial intelligence classical problems.

• CENTRAL-RING POLYNOMIAL ALGORITHM FOR DISTRIBUTION OF COMPUTATION-TIME RESOURCES IN GRID SYSTEMS

  D.Y. Kravchenko, Y.A. Kravchenko, E.V. Kuliev, A.E. Saak

  2022-08-09

  Abstract ▼

  The article is devoted to solving the problem of computational and time resources distribution
  in grid systems based on the adaptation of polynomial algorithms to quadratic types of user applications.
  The relevance of demand distribution validity problem for the distributed computing paradigm
  in the context of information redistribution and uncertainty. The article deals with the problems of
  scheduling heterogeneous computing resources in solving complex professional and scientific problems
  achieved at different points in time, based on identifying resources by significant manifestations
  of commitment and probability. A comparative review of consumption has been carried out. The
  statement of the problem to be solved in the chosen research area is formulated. The problem of
  scheduling a grid system with a centralized multiarchitecture, which uses the task solution of a
  group-site, is substantiated. The use of this architecture requires the development of heuristic algorithms
  for the distribution of computing resources, taking into account the properties of application
  arrays and assessing the schedule compliance. Eliminating the occurrence of scheduling errors requires
  the development of a formal apparatus that will identify the prospects of the application, introduce
  their typing and build heuristic algorithms with quality assessment, selected for certain types.
  The development of such a formal apparatus is an urgent task. An equally important task within the
  framework of this mechanism is the construction of resource parity models and interaction between
  users and the computing system models. The authors proposed to solve the problem of scheduling
  computing resources based on the development and study of polynomial scheduling algorithms for
  arrays of hyperbolic applications. The main theoretical accuracy of this study is the creation of a
  formal scheduling apparatus, including the definition of resource sugar, as a model of user applications,
  based on the performance of an operation in the scheduling environment on a set of resource
  muscles. The scientific novelty of the research lies in the development of a central-ring polynomial
  algorithm for the distribution of computational time resources in grid systems, which involves an
  automatic scheduling algorithm for computing systems, adaptation to quadratic types of user applications
  and improves the efficiency of computational time resources distribution. To evaluate the
  developed efficiency of the software application algorithm and the conducted computational experiment
  with rapidly generated classes of computational resources. Obtained comparative results of the
  proposed algorithm practical efficiency experimental studies for the distribution of computational
  and time resources. The described studies have a high level of theoretical and practical significance
  and are directly related to the solution of artificial intelligence classical problems.

• ESTIMATION OF THE PROBABILITY OF DETECTING A FALSE RESULT OF DISTRIBUTED CALCULATIONS PERFORMED BY A CENTRALIZED MULTI-AGENT SYSTEM

  V. A. Litvinenko, S.A. Khovanskov , V. S. Khovanskovа

  2021-11-14

  Abstract ▼

  We consider the issues of protection of distributed computing organized on the basis of a multiagent
  system for solving problems of multivariate modeling. When modeling, choosing one of the many
  options may require going through a huge set of parameters that are not available for a high-speed
  computer. Distributed computing is used to reduce the time needed to solve such problems. There are
  many different approaches for organizing distributed computing in a computer network: grid technology,
  metacomputing (BOINC, PVM, and others). All of them are intended for creating centralized distributed
  computing systems. Distributed computing is organized on the basis of a multi-agent system on
  the computing nodes of any computer network. When using a large-scale computer network as a computing
  environment, there may be security threats to distributed computing. One of these threats is getting
  a false result from hackers during calculations. A false result may lead to making an inappropriate or
  incorrect decision during the simulation process. Managing agents of a centralized distributed computing
  system, in addition to managing a distributed system, are forced to detect false results of the calculation
  process. A method has been developed for calculating the probability of detecting a false result
  depending on the total number of agents in a multi-agent system and the number of control agents. Examples
  of calculating the number of control agents that provide the required probability of detecting
  false results in a multi-agent system are given.

• THE METHOD OF SOLVING THE PROBLEM OF THE DISTRIBUTION OF GOALS IN THE GROUP OF UAVS BY NETWORK-CENTRIC CONTROL SYSTEM

  I. А. Shipov

  2022-04-21

  Abstract ▼

  The aim of the work is to create a productive computing device for a strapdown inertial navigation
  system (SINS) of a ground-based robotic complex (RTC) on a domestic element base.
  A formal description of the typical sufficient functions performed by SINS is given and the basicprinciples of the algorithms are described from the point of view of the requirements for computing
  resources. A description of domestic microcontrollers available on the market and a comparison with
  the closest foreign analogue are given. The results of the prototyping carried out showed the fundamental
  possibility, but the low prospects of creating computing devices on a single microcontroller.
  In this regard, technical proposals were developed and implemented to increase the computing power
  by means of building the architecture of a multiprocessor computer. As a result, it was necessary
  to develop special approaches to the design of algorithms and software. The organization of distributed
  computing is one of the most optimal methods for ensuring the calculation of functioning algorithms.
  The introduction of additional microprocessors into the calculator circuit made it possible not
  only to increase the computing power, but also to introduce additional interfaces for interaction with
  both the consumer and primary information sensors. The proposed variant of the distribution of SINS
  operation algorithms made it possible to create a reserve for the development prospects and system
  scalability. The most resource-intensive algorithm is the calculation of inertial coordinates, implemented
  as an iterative calculation for determining the latitude component of the location. Also, the
  performance margin may allow the implementation of additional adaptive algorithms for filtering
  and processing data based on the results of testing and operation of a ground moving object.
  The choice of on-board exchange interface between controllers is substantiated and its practical
  application is described. The creation of a closed loop of information exchange made it possible to
  implement additional parallel calculations of secondary information and to calculate an autonomous
  reckoning of the object's location coordinates. The described technical solutions can be used in the
  design of embedded calculators for objects for various purposes operating on the basis of hard logic.
  As the main drawback of the presented approach to designing a calculator, one can designate a limited
  functionality when working with ROMs.