Skip to main content
SpringerLink
Log in

Shaped lattice graphs as models of the multiprocessor computer systems

  • Technical Diagnostics
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

A new family of the uniform ordinary graphs named the shaped lattice graphs was proposed and studied. As applied to the structural modeling of the multiprocessor computer systems, they have two useful characteristics such as high flexibility at choosing their size (number of vertices) and possibility of obtaining small (down to d = 2) diameters independently of the graph size. The method of cycle definition and transformation by the ring sequences of edge weights, which was previously proposed for the binary hypercubes and other Cayley graphs, was extended to the shaped lattice graphs.

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. Chan, M.Y. and Lee, S.J., Distributed Fault-tolerant Embeddings of Rings in Hypercubes, J. Parallel Distributed Comput., 1991, vol. 11, no.1, pp. 63–71.

    Google Scholar 

  2. Tseng, Y.C., Embedding a Ring in a Hypercube with both Link and Node Failures, Inf. Proc. Lett., 1996, vol. 59, no.4, 217–222.

    Google Scholar 

  3. Akers, S.B., Marel, D., and Krishnamurthy, B., The Star Graph: An Attractive Alternative to the n-cube, Proc. Int. Conf. Parallel Proc., 1986, pp. 393–400.

  4. Day, K. and Tripathy, A., Arrangement Graphs: A Class Generalized Star Graphs, Inf. Proc. Letters, 1992, vol. 52, pp. 235–241.

    Google Scholar 

  5. Parkhomenko, P.P., Classification of the Hamiltonian Cycles in Binary Hypercubes, Avtom. Telemekh., 2001, no. 6, pp. 135–150.

  6. Parkhomenko, P.P., Construction Hamiltonian Cycles in Cayley Graphs Modeling Structures of the Multiprocessor Computer System, Avtom. Telemekh., 2002, no. 10, pp. 137–153.

  7. Zykov, A.A., Osnovy teorii grafov (Fundamentals of the Graph Theory), Moscow: Nauka, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    P. P. Parkhomenko

Authors
  1. P. P. Parkhomenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Avtomatika i Telemekhanika, No. 3, 2005, pp. 169–180.

Original Russian Text Copyright © 2005 by Parkhomenko.

This paper was recommended for publication by P.Yu. Chebotarev, a member of the Editorial Board

Rights and permissions

Reprints and permissions

About this article

Cite this article

Parkhomenko, P.P. Shaped lattice graphs as models of the multiprocessor computer systems. Autom Remote Control 66, 492–502 (2005). https://doi.org/10.1007/s10513-005-0078-1

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10513-005-0078-1

Keywords

Search

Navigation