Matrix Multiplication and Data Routing Using a Partitioned Optical Passive Stars Network
IEEE Transactions on Parallel and Distributed Systems
The Partitioned Optical Passive Stars Network: Simulations and Fundamental Operations
IEEE Transactions on Parallel and Distributed Systems
Basic Operations on a Partitioned Optical Passive Stars Network with Large Group Size
ICCS '02 Proceedings of the International Conference on Computational Science-Part I
Fast merging and sorting on a partitioned optical passive stars network
Computer Science in Perspective
Multiprocessor Architectures using Multi-Hop Multi-OPS Lightwave Networks and Distributed Control
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Packet routing and selection on the POPS network
Journal of Parallel and Distributed Computing
Hypercube Computations on Partitioned Optical Passive Stars Networks
IEEE Transactions on Parallel and Distributed Systems
Optimal hypercube simulation on the partitioned optical passive stars network
The Journal of Supercomputing
Optimal embedding of the hypercube on partitioned optical passive stars networks
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
| Hi-index | 0.01 |
In 1996 MPPOI, Gravenstreter and Melhem presented optimal embeddings of ring and torus communications on the POPS architecture, for the case where the number of nodes (n) and the optical passive star (OPS) coupler degree (d) are powers of two. In the same conference, Bourdin, Ferreira and Marcus; see massively parallel multiprocessing using optical interconnections, San Antonio, USA, Oct, 1995, IEEE press; proposed stack-graphs as a good model for OPS-based architectures. In this paper we show that directed stack-complete graphs with loops (stack-K/sup +//sub n/ for shown perfectly model POPS. As a consequence, we settle the question with respect to ring embeddings, presenting optimal embeddings for all values of n and d, based on Euler tours on K/sup +//sub n/. We also show how to optimally embeded Bruijn (B (g, D)) communications on POPS when g is the number of groups in the POPS topology, using the fact that K/sup +//sub g/ is also a B (g, 1).