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


UBS, 2011, Issue 32, Pages 241–261 (Mi ubs536)  

This article is cited in 3 scientific papers (total in 3 papers)

Hardware and Software Tools in Control

Compact structures of computer systems and their synthesis

V. A. Melent'ev

A. V. Rzhanov Institute of Semiconductor Physics of SB RAS

Abstract: One of essential issues in computer systems (CS) control is limited decision-making time. Timing of control actions in the process of computer system functioning is in many respects determined by compactness of its structure providing the minimal number of transits at realization of intermodule communications. Compact structures ŃS are defined as regular graphs of an order n with the minimum diameter. These graphs are compared with $(s,g)$-cage graphs. The method of compact graphs synthesis is suggested. The method is based on the representation of compact graphs by the set of vertex-complete projections with minimally possible number of levels. Examples of $n(s)$-compact graphs built are given.

Keywords: compact structures of computer systems, compact graphs, projection of the graph, synthesis of compact structures

Full text: PDF file (1381 kB)
References: PDF file   HTML file
UDC: 519.17: 681.3
BBK: 78.34

Citation: V. A. Melent'ev, “Compact structures of computer systems and their synthesis”, UBS, 32 (2011), 241–261

Citation in format AMSBIB
\Bibitem{Mel11}
\by V.~A.~Melent'ev
\paper Compact structures of computer systems and their synthesis
\jour UBS
\yr 2011
\vol 32
\pages 241--261
\mathnet{http://mi.mathnet.ru/ubs536}


Linking options:
  • http://mi.mathnet.ru/eng/ubs536
  • http://mi.mathnet.ru/eng/ubs/v32/p241

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. V. A. Melentev, “Ogranicheniya na obkhvaty v kompaktnykh grafakh”, PDM, 2011, prilozhenie № 4, 96–98  mathnet
    2. V. A. Melentev, “«Rebernoe» masshtabirovanie vychislitelnykh sistem”, UBS, 64 (2016), 81–111  mathnet  elib
    3. V. A. Melentev, “O topologicheskoi otkazoustoichivosti masshtabiruemykh vychislitelnykh sistem”, UBS, 70 (2017), 58–86  mathnet  elib
  • Upravlenie Bol'shimi Sistemami
    Number of views:
    This page:178
    Full text:43
    References:23
    First page:2

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020