The design and analysis of parallel algorithms
The design and analysis of parallel algorithms
Efficient parallel computations on the reduced mesh of trees organization
Journal of Parallel and Distributed Computing
Mesh-Connected Trees: A Bridge Between Grids and Meshes of Trees
IEEE Transactions on Parallel and Distributed Systems
Computer Vision and Image Understanding
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
A New Network Topology with Multiple Meshes
IEEE Transactions on Computers
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
Introduction to Algorithms
Broadcasting in all-output-port meshes of trees with distance-insensitive switching
Journal of Parallel and Distributed Computing
BPC Permutations on the OTIS-Mesh Optoelectronic Computer
MPPOI '97 Proceedings of the 4th International Conference on Massively Parallel Processing Using Optical Interconnections
Multi-mesh of trees with its parallel algorithms
Journal of Systems Architecture: the EUROMICRO Journal
Optical transpose k-ary n-cube networks
Journal of Systems Architecture: the EUROMICRO Journal
Lossless Image Compression by Block Matching on a Mesh of Trees
DCC '06 Proceedings of the Data Compression Conference
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
A Mesh-of-Trees Interconnection Network for Single-Chip Parallel Processing
ASAP '06 Proceedings of the IEEE 17th International Conference on Application-specific Systems, Architectures and Processors
Mesh of Tree: Unifying Mesh and MFPGA for Better Device Performances
NOCS '07 Proceedings of the First International Symposium on Networks-on-Chip
HOTI '07 Proceedings of the 15th Annual IEEE Symposium on High-Performance Interconnects
Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees
IEEE Transactions on Computers
The Hamiltonicity of swapped (OTIS) networks built of Hamiltonian component networks
Information Processing Letters
Mesh-of-trees and alternative interconnection networks for single-chip parallelism
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Paper: Asynchronous polynomial zero-finding algorithms
Parallel Computing
Parallel algorithm for conflict graph on OTIS-triangular array
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
| Hi-index | 0.00 |
Mesh of trees (MOT) is well known for its small diameter, high bisection width, simple decomposability and area universality. On the other hand, OTIS (Optical Transpose Interconnection System) provides an efficient optoelectronic model for massively parallel processing system. In this paper, we present OTIS-MOT as a competent candidate for a two-tier architecture that can take the advantages of both the OTIS and the MOT. We show that an $n^{4}_{-}$ processor OTIS-MOT has diameter 8log驴n 驴+1 (The base of the logarithm is assumed to be 2 throughout this paper.) and fault diameter 8log驴n+2 under single node failure. We establish other topological properties such as bisection width, multiple paths and the modularity. We show that many communication as well as application algorithms can run on this network in comparable time or even faster than other similar tree-based two-tier architectures. The communication algorithms including row/column-group broadcast and one-to-all broadcast are shown to require O(log驴n) time, multicast in O(n 2log驴n) time and the bit-reverse permutation in O(n) time. Many parallel algorithms for various problems such as finding polynomial zeros, sales forecasting, matrix-vector multiplication and the DFT computation are proposed to map in O(log驴n) time. Sorting and prefix computation are also shown to run in O(log驴n) time.