Loading [MathJax]/jax/output/SVG/config.js
Upravlenie Bol'shimi Sistemami
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


UBS:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Upravlenie Bol'shimi Sistemami, 2014, Issue 47, Pages 212–246 (Mi ubs749)  
This article is cited in 3 scientific papers (total in 3 papers)

Hardware and Software Tools in Control

Embedding of subsystems limiting length and number of paths between vertexes of computing system graph

V. A. Melent'ev

Rzhanov Institute of Semiconductor Physics Siberian Branch of RAS
Full-text PDF (2248 kB) Citations (3)
References:
PDF
HTML
Abstract: We consider a problem of detecting computing system graph components which correspond to the embeddable computing subsystem with respect to reachability and connectivity of its vertexes, and suggest the method of such components’ detection based on projective description of graphs. The approach is illustrated with examples of components’ detection.
Keywords: reachability and connectivity of vertexes of the graph, embedding a subsystem into the computing system.
Document Type: Article
UDC: 004.722.2+004.272.3
BBC: 32.817: 32.973.202
Language: Russian
Citation: V. A. Melent'ev, “Embedding of subsystems limiting length and number of paths between vertexes of computing system graph”, UBS, 47 (2014), 212–246
Citation in format AMSBIB
\Bibitem{Mel14}
\by V.~A.~Melent'ev
\paper Embedding of subsystems limiting length and number of paths between vertexes of computing system graph
\jour UBS
\yr 2014
\vol 47
\pages 212--246
\mathnet{http://mi.mathnet.ru/ubs749}
Linking options:
  • https://www.mathnet.ru/eng/ubs749
  • https://www.mathnet.ru/eng/ubs/v47/p212
    • This publication is cited in the following 3 articles:
    1. V. A. Melentev, “O topologicheskoi otkazoustoichivosti masshtabiruemykh vychislitelnykh sistem”, UBS, 70 (2017), 58–86  mathnet  elib
    2. V. A. Melentev, “«Rebernoe» masshtabirovanie vychislitelnykh sistem”, UBS, 64 (2016), 81–111  mathnet  elib
    3. V. A. Melentev, “O topologicheskoi masshtabiruemosti vychislitelnykh sistem”, UBS, 58 (2015), 115–143  mathnet  elib
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Upravlenie Bol'shimi Sistemami
    Statistics & downloads:
    Abstract page:261
    Full-text PDF :61
    References:50
     
      Contact us:
    math-net2025_03@mi-ras.ru     		 Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025