Enhanced OTIS k-Ary n-Cube Networks

  • Rajib K. Das
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4317)


This paper presents a variation of OTIS-k-ary n-cube networks (OTIS-\(Q_{n}^{k}\)) which is called enhanced OTIS-\(Q_{n}^{k}\) or E-OTIS-\(Q_{n}^{k}\). E-OTIS-\(Q_{n}^{k}\) is defined only for even values of k and is obtained from the normal OTIS-k-ary n cube by adding some extra links without increasing the maximum degree of 2n+1. We have established an upper bound of \(\lfloor{2nk+5\over 3}\rfloor\) on the diameter of E-OTIS-\(Q_{n}^{k}\). We have also found the actual diameter using breadth first search for specific values of k and n. It was observed that this upper bound is quite tight, in the sense that it is either equal to the actual diameter or exceeds the diameter by one. We have also defined a classification of the nodes in E-OTIS-\(Q_{n}^{k}\) based on some properties and shown that the nodes in the same class have the same eccentricity. Finally, we have developed an algorithm for point-to-point routing in E-OTIS-\(Q_{n}^{k}\). It is proved that the algorithm always routes by the shortest path.


Short Path Topological Property Multiprocessor System Optical Link Optical Interconnection 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Nugent, S.F.: The iPSC/2 direct-connect communication technology. In: Proceedings of 3rd Conference on Hypercube Concurrent Computers and Applications, vol. 1, pp. 51–60 (1988)Google Scholar
  2. 2.
    Krishnamoorthy, A., Marchand, P., Kiamilev, F., Esener, S.: Grain-size considerations for optoelectronic multistage interconnection networks. Applied Optics 31, 5480–5507 (1992)CrossRefGoogle Scholar
  3. 3.
    Day, K., Al-Ayyoub, A.E.: Topological properties of OTIS-networks. IEEE Transactions on Parallel and Distributed Systems 13, 359–366 (2002)CrossRefGoogle Scholar
  4. 4.
    Vanvoorst, B., Seidel, S., Barscz, E.: Workload of an iPSC/860. In: Pro. Scalable High-performance Computing Conference, pp. 221–228 (1994)Google Scholar
  5. 5.
    Day, K., Al-Ayyoub, A.E.: Fault diameter of k-ary n-cube networks. IEEE Transactions on Parallel and Distributed Systems 8, 903–907 (1997)CrossRefGoogle Scholar
  6. 6.
    Rajasekaran, S., Sahni, S.: Randomized routing, selection, and sorting on the OTIS-Mesh. IEEE Transactions on Parallel and Distributed Systems 9, 833–840 (1998)CrossRefGoogle Scholar
  7. 7.
    Wang, C.: OTIS optoelectronic computers. In: Li, K., Pan, Y., Zhang, S.Q. (eds.) Parallel Computation Using Optical Interconnections, pp. 99–116 (1998)Google Scholar
  8. 8.
    Sahni, S., Wang, C.-F.: BPC permutations on the OTIS-Mesh optoelectronic computer. In: Proc. Fourth Int’l Conf. Massively Parallel Processing Using Optical Interconnections, pp. 130–135 (1997)Google Scholar
  9. 9.
    Wang, C.-F., Sahni, S.: Matrix multiplication on the OTIS-Mesh optoelectronic computer. IEEE Transactions on Computers 50, 635–646 (2001)CrossRefGoogle Scholar
  10. 10.
    Wang, C.-F., Sahni, S., Image, S.: processing on the OTIS-Mesh optoelectronic computer. IEEE Transactions on Parallel and Distributed Systems 11, 97–109 (2000)CrossRefGoogle Scholar
  11. 11.
    Day, K.: Optical transpose k-ary n-cube networks. Journal of System Architecture: the Euromicro Journal 50, 697–705 (2004)CrossRefGoogle Scholar
  12. 12.
    Zane, F., Marchand, P., Paturi, R., Esener, S.: Scalable network architectures using the Optical Transpose Interconnection Systems (OTIS). Journal of Parallel and Distributed Computing 60, 521–538 (2000)MATHCrossRefGoogle Scholar
  13. 13.
    Das, R.K.: Routing and topological properties of Enhanced OTIS Cube. In: Proc. ADCOM 2005 (2005)Google Scholar
  14. 14.
    Bose, B., Broeg, B., Kwon, Y., Ashir, Y.: Lee distance and topological properties of k-ary n-cubes. IEEE Transactions on Computers 44, 1021–1030 (1995)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Rajib K. Das
    • 1
  1. 1.Tezpur UniversityAssamIndia

Personalised recommendations