Loading...

On pancyclicity properties of OTIS networks

Hoseinyfarahabady, M. R ; Sharif University of Technology | 2007

196 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/978-3-540-75444-2_52
  3. Publisher: Springer Verlag , 2007
  4. Abstract:
  5. The OTIS-Network (also referred to as two-level swapped network) is composed of n clones of an n-node original network constituting its clusters. It has received much attention due to its many favorable properties such as high degree of scalability, regularity, modularity, package-ability and high degree of algorithmic efficiency. In this paper, using the construction method, we show that the OTIS-Network is Pancyclic if its basic network is Hamiltonian- connected. The study of cycle embeddings with different sizes arises naturally in the implementation of a number of either computational or graph problems such as those used for finding storage schemes for logical data structures, layout of circuits in VLSI, etc. Our result is resolving an open question posed in [6] and generalizing a number of proofs in the literature for specific Hamiltonian properties of similar networks. © Springer-Verlag Berlin Heidelberg 2007
  6. Keywords:
  7. Algorithms ; Computational methods ; Embedded systems ; Graph theory ; Hamiltonians ; Problem solving ; Algorithmic efficiency ; Hamiltonian properties ; OTIS networks ; Computer networks
  8. Source: 3rd International Conference on High Performance Computing and Communications, HPCC 2007, Houston, TX, 26 September 2007 through 28 September 2007 ; Volume 4782 LNCS , 2007 , Pages 545-553 ; 03029743 (ISSN); 9783540754435 (ISBN)
  9. URL: https://link.springer.com/chapter/10.1007%2F978-3-540-75444-2_52