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
Scalable network architectures using the optical transpose interconnection system (OTIS)
Journal of Parallel and Distributed Computing
Topological Properties of OTIS-Networks
IEEE Transactions on Parallel and Distributed Systems
Matrix Multiplication on the OTIS-Mesh Optoelectronic Computer
PI '99 Proceedings of the The 6th International Conference on Parallel Interconnects
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
ICPADS '96 Proceedings of the 1996 International Conference on Parallel and Distributed Systems
Edge-pancyclicity of recursive circulants
Information Processing Letters
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
The Grid-Pyramid: A Generalized Pyramid Network
The Journal of Supercomputing
Hamiltonian Path Embedding and Pancyclicity on the Möbius Cube with Faulty Nodes and Faulty Edges
IEEE Transactions on Computers
Polynomial interpolation and polynomial root finding on OTIS-mesh
Parallel Computing
Multicast communication in OTIS-hypercube multi-computer systems
International Journal of High Performance Computing and Networking
Node-pancyclicity and edge-pancyclicity of crossed cubes
Information Processing Letters
On pancyclicity properties of OTIS-mesh
Information Processing Letters
Pancyclicity of OTIS (swapped) networks based on properties of the factor graph
Information Processing Letters
| Hi-index | 0.00 |
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.