Skip to main content
SpringerLink
Log in

Extended block designs for ideal system area networks

  • Control Sciences
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

This paper considers a certain method of constructing 1-extended block designs; they generalize the concept of symmetrical block designs studied in combinatorial calculus. The definition of 1-extended block designs is provided and an algorithm of their construction is suggested. Finally, we analyze their application for building distributed full switches as “ideal” system area networks in multiprocessor computer systems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Kumar, A., Peh, L.-S., Kundu, P., and Jha, N.K., Toward Ideal On-chip Communication Using Express Virtual Channels, IEEE Micro, 2008, vol. 28, no. 1, pp. 80–90.

    Article  Google Scholar 

  2. Podlazov, V.S. and Sokolov, V.V., The Method for Homogeneous Expansion of System Area Network in Multiprocessor Computing Systems, Probl. Upravlen., 2007, no. 2, pp. 22–27.

    Google Scholar 

  3. Nikolaev, A.B. and Podlazov, V.S., Fault-tolerant Expansion of System Area Networks in Multiprocessor Computer Systems, Autom. Remote Control, 2008, vol. 69, no. 1, pp. 150–157.

    Article  MATH  MathSciNet  Google Scholar 

  4. Karavay, M.F. and Podlazov, V.S., Distributed Full Switch as Ideal System Area Network for Multiprocessor Computers, Upravlen. Bol’sh. Sist., 2011, no. 34, pp. 92–116.

    Google Scholar 

  5. Hall, M., Combinatorial Theory, Waltham: Blaisdell, 1967. Translated under the title Kombinatorika, Moscow: Mir, 1970.

    MATH  Google Scholar 

  6. Karavay, M.F., Parkhomenko, P.P., and Podlazov, V.S., Simple Methods for Constructing Quasifully Connected Graphs (Symmetric Block Designs), Proc. IV Intern. Conf. “Parallel Computing and Control Problems” (PACO’2008), Moscow: Inst. Probl. Upravlen., 2008, pp. 232–249.

    Google Scholar 

  7. Karavay, M.F., Parkhomenko, P.P., and Podlazov, V.S., Combinatorial Methods for Constructing Bipartite Uniform Minimal Quasicomplete Graphs (Symmetrical Block Designs), Autom. Remote Control, 2009, vol. 70, no. 2, pp. 312–327.

    Article  MathSciNet  Google Scholar 

  8. Karavay, M.F., Podlazov, V.S., and Sokolov, V.V., The Way of Full Switches Extension in Circuit Basic, Proc. V Int. Conf. “Parallel Computing and Control Problems” (PACO’2010), Moscow: Inst. Probl. Upravlen., 2010, pp. 295–305.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, Russia

    M. F. Karavay & V. S. Podlazov

Authors
  1. M. F. Karavay
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. S. Podlazov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text © M.F. Karavay, V.S. Podlazov, 2012, published in Problemy Upravleniya, 2012, No. 4, pp. 45–51.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Karavay, M.F., Podlazov, V.S. Extended block designs for ideal system area networks. Autom Remote Control 74, 2180–2188 (2013). https://doi.org/10.1134/S0005117913120205

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117913120205

Keywords

Search

Navigation