Skip to main content

On Pancyclicity Properties of OTIS Networks

  • Conference paper
High Performance Computing and Communications (HPCC 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4782))

  • 947 Accesses

Abstract

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.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Marsden, G., Marchand, P., Harvey, P., Esener, S.: Optical transpose interconnection system architectures. Optics Lett. 18, 1083–1085 (1993)

    Article  Google Scholar 

  2. Yeh, C.-H., Parhami, B.: Swapped networks: unifying the architectures and algorithms of a wide class of hierarchical parallel processors. In: Proc. Int’l Conf. Parallel and Distributed Systems, pp. 230–237 (1996)

    Google Scholar 

  3. Zane, F., Marchand, P., Paturi, R., Esener, S.: Scalable network architectures using the optical transpose interconnection system. J. Parallel Distribute Computing 60, 521–538 (2000)

    Article  MATH  Google Scholar 

  4. Krishnamoorthy, P., Marchand, F., Kiamilev, F., Esener, S.: Grain–size considerations for optoelectronic multistage interconnection networks. Applied Optics 31(26), 5480–5507 (1992)

    Google Scholar 

  5. Wang, C., Sahni, S.: Basic operations on the OTIS-mesh optoelectronic computer. IEEE Transactions on Parallel and Distributed Systems 9(12), 1226–1236 (1998)

    Article  Google Scholar 

  6. Day, K., Al-Ayyoub, A.: Topological properties of OTIS-networks. IEEE Trans. Parallel Distrib. Systems 13, 359–366 (2002)

    Article  Google Scholar 

  7. HoseinyFarahabady, M., Sarbazi-Azad, H.: The grid-pyramid: A generalized pyramid network. Journal of Supercomputing 37(1), 23–45 (2006)

    Article  Google Scholar 

  8. Rajasekaran, S., Sahni, S.: Randomized routing, selection, and sorting on the OTIS-mesh. IEEE Trans. on Parallel and Distributed Systems 9(9), 833–840 (1998)

    Article  Google Scholar 

  9. Parhami, B.: Swapped interconnection networks: Topological, performance, and robustness attributes. J. Parallel Distrib. Comput. 65(11), 1443–1452 (2005)

    Article  MATH  Google Scholar 

  10. Hoseiny Farahabady, M., Sarbazi-Azad, H.: Algorithmic Construction of Hamiltonian Cycles in OTIS-Networks. In: IASTED 2005 Networks and Communication Systems, pp. 464–110 (2005)

    Google Scholar 

  11. Osterloh, A.: Sorting on the OTIS-mesh. In: IPDPS 2000, pp. 269–274 (2000)

    Google Scholar 

  12. Prasanta, K.: Polynomial interpolation and polynomial root finding on OTIS-mesh. Parallel Computing 32, 301–312 (2006)

    Article  MathSciNet  Google Scholar 

  13. Wang, C.-F., Sahni, S.: Matrix multiplication on the OTIS-mesh optoelectronic computer. In: MPPOI 1999. Proc. of the 6th intl. Conf. on Massively Paral. Processing using Optical Interconnections, pp. 131-138 (1999)

    Google Scholar 

  14. Hoseiny Farahabady, M., Imani, N., Sarbazi-Azad, H.: Some Topological and Combinatorial Properties of WK-Recursive Mesh and WK-Pyramid Interconnection Networks. Technical Report, IPM School of Computer Science, Tehran, Iran (2007)

    Google Scholar 

  15. Hashemi Najaf-abadi, H., Sarbazi-Azad, H.: Comparative Evaluation of Adaptive and Deterministic Routing in the OTIS-Hypercube. In: Yew, P.-C., Xue, J. (eds.) ACSAC 2004. LNCS, vol. 3189, pp. 349–362. Springer, Heidelberg (2004)

    Google Scholar 

  16. Hashemi Najaf-abadi, H., Sarbazi-Azad, H.: Multicast communication in OTIS-hypercube multi-computer systems. International Journal of High Performance Computing and Networking 4(3-4), 161–173 (2006)

    Google Scholar 

  17. Hashemi Najaf-abadi, H., Sarbazi-azad, H.: On routing capabilities and performance of cube-based OTIS-systems. In: SPECTS 2004, pp. 161–166 (2004)

    Google Scholar 

  18. Xu, J., Ma, M.: Cycles in folded hypercubes. Applied Mathematics Letters 19, 140–145 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  19. Araki, T.: Edge-pancyclicity of recursive circulants. Information Processing Letters 88(6), 287–292 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  20. Hsieh, S., Chang, N.: Hamiltonian Path Embedding and Pancyclicity on the Mobius Cube with Faulty Nodes and Faulty Edges. IEEE Transactions on Computers 55(7), 854–863 (2006)

    Article  Google Scholar 

  21. Flandrin, E., Li, H., Marczyk, L., Schiermeyer, I., Wo´zniak, M.: Chvtal–Erdos condition and pancyclism. Disc. Math. Graph Theory 26, 335–342 (2006)

    MATH  MathSciNet  Google Scholar 

  22. Li, T.: Cycle embedding in star graphs with edge faults. Applied Mathematics and Computation 167, 891–900 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  23. Fan, J., Lin, X., Jia, X.: Node-Pancyclicity and edge-Pancyclicity of crossed cubes. Information Processing Letters 93, 133–138 (2005)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Ronald Perrott Barbara M. Chapman Jaspal Subhlok Rodrigo Fernandes de Mello Laurence T. Yang

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hoseinyfarahabady, M.R., Sarbazi-Azad, H. (2007). On Pancyclicity Properties of OTIS Networks. In: Perrott, R., Chapman, B.M., Subhlok, J., de Mello, R.F., Yang, L.T. (eds) High Performance Computing and Communications. HPCC 2007. Lecture Notes in Computer Science, vol 4782. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75444-2_52

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75444-2_52

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75443-5

  • Online ISBN: 978-3-540-75444-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics