Hamiltonicity of a general OTIS network

Authors:
Nagendra Kumar;Rajeev Kumar;Dheeresh K. Mallick;Prasanta K. Jana
Affiliations:
Department of Computer Science and Engineering, Indian School of Mines University, Dhanbad, India;Department of Computer Science and Engineering, Indian School of Mines University, Dhanbad, India;Birla Institute of Technology, Mesra, India;Department of Computer Science and Engineering, Indian School of Mines University, Dhanbad, India
Venue:
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Year:
2010

Citing 14
Cited 0

Basic Operations on the OTIS-Mesh Optoelectronic Computer

IEEE Transactions on Parallel and Distributed Systems
Image Processing on the OTIS-Mesh Optoelectronic Computer

IEEE Transactions on Parallel and Distributed Systems
Scalable network architectures using the optical transpose interconnection system (OTIS)

Journal of Parallel and Distributed Computing
Matrix Multiplication on the OTIS-Mesh Optoelectronic Computer

IEEE Transactions on Computers
Topological Properties of OTIS-Networks

IEEE Transactions on Parallel and Distributed Systems
Sorting on the OTIS-Mesh

IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Optical transpose k-ary n-cube networks

Journal of Systems Architecture: the EUROMICRO Journal
Hamiltonicity of the WK-Recursive Network with and without Faulty Nodes

IEEE Transactions on Parallel and Distributed Systems
Swapped interconnection networks: Topological, performance, and robustness attributes

Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part II
Polynomial interpolation and polynomial root finding on OTIS-mesh

Parallel Computing
Conditional fault-tolerant hamiltonicity of star graphs

Parallel Computing
Fault-free Hamiltonian cycles in crossed cubes with conditional link faults

Information Sciences: an International Journal
Conditional fault Hamiltonicity of the complete graph

Information Processing Letters
The Hamiltonicity of swapped (OTIS) networks built of Hamiltonian component networks

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

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.