Problemy Upravleniya
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


Probl. Upr.:
Year:
Volume:
Issue:
Page:
Find




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

Problemy Upravleniya, 2006, Issue 2, Pages 50–57 (Mi pu327)  
This article is cited in 3 scientific papers (total in 3 papers)

Information technologies controls

Scalable multiring fixed plants for multi-processor computation systems

V. S. Podlazov

Institute of Control Sciences, Russian Academy of Sciences
Full-text PDF (275 kB) Citations (3)
References:
PDF
HTML
Abstract: A concept of scalable multiring communications network whose throughput can be directly proportional to the number of network nodes at low ring count is offered.
Document Type: Article
UDC: 519.724.2
Language: Russian
Citation: V. S. Podlazov, “Scalable multiring fixed plants for multi-processor computation systems”, Probl. Upr., 2006, no. 2, 50–57
Citation in format AMSBIB
\Bibitem{Pod06}
\by V.~S.~Podlazov
\paper Scalable multiring fixed plants for multi-processor computation systems
\jour Probl. Upr.
\yr 2006
\issue 2
\pages 50--57
\mathnet{http://mi.mathnet.ru/pu327}
Linking options:
  • https://www.mathnet.ru/eng/pu327
  • https://www.mathnet.ru/eng/pu/v2/p50
    • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Проблемы управления
    Statistics & downloads:
    Abstract page:128
    Full-text PDF :57
    References:24
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024