Abstract
In this paper, we present a novel method to construct a Hamiltonian cycle for an n × n general OTIS network. Our method is common for both odd and even value of n in contrast to two separate schemes for odd and even n as described in [1]. We also provide an algorithm that generates a Hamiltonian cycle of a general (n + 2k) ( (n + 2k) OTIS network directly from a basic Hamiltonian cycle of an n ( n OTIS network.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Parhami, B.: The Hamlitonicity of swapped (OTIS) networks built of Hamiltonian component networks. Information Processing Letters 95, 441–445 (2005)
Marsden, G., Marchand, P., Harvey, P., Esener, S.: Optical transpose interconnection system architectures. Optics Letters 18, 1083–1085 (1993)
Day, K.: Topological properties of OTIS networks. IEEE Trans. Parallel and Distributed Systems 13, 359–366 (2002)
Day, K.: Optical transpose k-ary n-cube networks. J. of Systems Architecture. 50, 697–705 (2004)
Parhami, B.: Swapped interconnection networks: Topological, performance, and robustness attributes. J. of Parallel and Distributed Computing 65, 1443–1452 (2005)
Sahni, S.: Models and algorithms for optical and optoelectronic parallel computers. Intl. J. of Foundations of Computer Science 12, 249–264 (2001)
Zane, F., Marchand, P., Paturi, R., Esener, S.: Scalable network architectures using the optical transpose interconnection system (OTIS). J. of Parallel and Distributed Computing 60, 521–538 (2000)
Wang, C.F., Sahni, S.: Image processing on the OTIS-Mesh optoelectronic computer. IEEE Trans. Parallel and Distributed Systems 11, 9–109 (2000)
Wang, C.F., Sahni, S.: Matrix multiplication on the OTIS-Mesh optoelectronic computer. IEEE Trans. Computers 50, 635–646 (2001)
Wang, C.F., Sahni, S.: Basic operations on the OTIS-Mesh optoelectronic computer. IEEE Trans. Parallel and Distributed Systems 9, 1226–1236 (1998)
Jana, P.K.: Polynomial interpolation and polynomial root finding on OTIS-mesh. Parallel Computing 32, 301–312 (2006)
Jana, P.K., Sinha, B.P.: An Improved parallel prefix algorithm on OTIS-Mesh. Parallel Processing Letters 16, 429–440 (2006)
Osterloh, A.: Sorting on the OTIS–Mesh. In: 14th Intl. Parallel and Distributed Processing Symp (IPDPS 2000), pp. 269–274 (2000)
Fu, J.-S.: Conditional fault-tolerant Hamiltonicity of star graphs. Parallel Computing 33, 488–496 (2007)
Huang, H., Fu, J., Chen, G.: Fault-free Hamiltonian cycles in crossed cubes with conditional link faults. Information Sciences 177, 5590–5597 (2007)
Fu, J.S.: Conditional fault Hamiltonicity of the complete graph. Information Processing Letter 107, 110–113 (2008)
Fu, J.S.: Hamiltonicity of WK-Recursive network with and without Faulty nodes. IEEE Trans. on Parallel and Distributed Systems 16, 853–865 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kumar, N., Kumar, R., Mallick, D.K., Jana, P.K. (2010). Hamiltonicity of a General OTIS Network. In: Kant, K., Pemmaraju, S.V., Sivalingam, K.M., Wu, J. (eds) Distributed Computing and Networking. ICDCN 2010. Lecture Notes in Computer Science, vol 5935. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11322-2_43
Download citation
DOI: https://doi.org/10.1007/978-3-642-11322-2_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11321-5
Online ISBN: 978-3-642-11322-2
eBook Packages: Computer ScienceComputer Science (R0)