Dmitry A. Trokoz
Penza State University

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

Using queuing theory to describe adaptive mathematical models of computing systems with resource virtualization and its verification using a virtual server with a configuration similar to the configuration of a given model Alexey I. Martyshkin; Dmitry V. Pashchenko; Dmitry A. Trokoz; Mihail P. Sinev; Boris L. Svistunov
Bulletin of Electrical Engineering and Informatics Vol 9, No 3: June 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1795.918 KB) | DOI: 10.11591/eei.v9i3.1714

Abstract

The article describes the issues of preparation and verification of mathematical models of computing systems with resource virtualization. The object of this study is to verify of mathematical models of computer systems with virtualization experimentally by creating a virtual server on the host platform and monitoring its characteristics under load. Known models cannot be applied to the aircraft with virtualization, because they do not allow a comprehensive analysis to determine the most effective option for the implementation of the initial allocation of resources and its optimization for a specific sphere and task of use. The article for the study used a closed queueing network. Simple models for the analysis of various structures of computer systems are experimentally obtained. To implement the properties of adaptability in the models, triggers are used that monitor and adjust the power of the processing channel in individual Queuing systems, depending on the specified conditions. Experiments prove the obtained results reliable and usable as a flexible tool for studying the virtualization properties when structuring computing systems. This knowledge could be of use for businesses interested in optimizing the server configuration for their IT infrastructure.
Search for a substring of characters using the theory of non-deterministic finite automata and vector-character architecture Dmitry V. Pashchenko; Dmitry A. Trokoz; Alexey I. Martyshkin; Mihail P. Sinev; Boris L. Svistunov
Bulletin of Electrical Engineering and Informatics Vol 9, No 3: June 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (892.714 KB) | DOI: 10.11591/eei.v9i3.1720

Abstract

The paper proposed an algorithm which purpose is searching for a substring of characters in a string. Principle of its operation is based on the theory of non-deterministic finite automata and vector-character architecture. It is able to provide the linear computational complexity of searching for a substring depending on the length of the searched string measured in the number of operations with hyperdimensional vectors when repeatedly searching for different strings in a target line. None of the existing algorithms has such a low level of computational complexity. The disadvantages of the proposed algorithm are the fact that the existing hardware implementations of computing systems for performing operations with hyperdimensional vectors require a large number of machine instructions, which reduces the gain from this algorithm. Despite this, in the future, it is possible to create a hardware implementation that can ensure the execution of operations with hyperdimensional vectors in one cycle, which will allow the proposed algorithm to be applied in practice.