Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Pancyclism and bipancyclism of Hamiltonian graphs
Journal of Combinatorial Theory Series B
Basic Operations on the OTIS-Mesh Optoelectronic Computer
IEEE Transactions on Parallel and Distributed Systems
Randomized Routing, Selection, and Sorting on the OTIS-Mesh
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
ICPADS '96 Proceedings of the 1996 International Conference on Parallel and Distributed Systems
Polynomial interpolation and polynomial root finding on OTIS-mesh
Parallel Computing
The m-pancycle-connectivity of a WK-Recursive network
Information Sciences: an International Journal
Multicast communication in OTIS-hypercube multi-computer systems
International Journal of High Performance Computing and Networking
The load balancing problem in OTIS-Hypercube interconnection networks
The Journal of Supercomputing
Parallel algorithms for finding polynomial Roots on OTIS-torus
The Journal of Supercomputing
Panconnectivity and edge-pancyclicity of k-ary n-cubes with faulty elements
Discrete Applied Mathematics
On pancyclicity properties of OTIS-mesh
Information Processing Letters
On pancyclicity properties of OTIS networks
HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications
Dominating problems in swapped networks
Information Sciences: an International Journal
Hi-index | 0.89 |
The plausibility of embedding cycles of different lengths in the graphs of a network (known as the pancyclicity property) has important applications in interconnection networks, parallel processing systems, and the implementation of a number of either computational or graph problems such as those used for finding storage schemes of logical data structures, layout of circuits in VLSI, etc. In this paper, we present the sufficient condition of the pancyclicity property of OTIS networks. 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. Many properties of OTIS networks have been studied in the literature. In this work, we show that the OTIS networks have the pancyclicity property when the factor graph is Hamiltonian. More precisely, using a constructive method, we prove that if the factor graph G of an OTIS network contains cycles of length {3,4,5,l}, then all cycles of length {3,...,l^2}, can be embedded in the OTIS-G network. This result resolves the open question posed and tracked in Day and AlAyyoub (2002) [2], Hoseiny Farahabady and Sarbazi Azad (2007) [4] and Shafiei et al. (2011) [14].