General purpose parallel architectures
Handbook of theoretical computer science (vol. A)
Efficient optical communication in parallel computers
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Direct bulk-synchronous parallel algorithms
Journal of Parallel and Distributed Computing
Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers
SIAM Journal on Computing
ERCW PRAMs and optical communication
Theoretical Computer Science - Special issue on parallel computing
Routing on networks of optical crossbars
Theoretical Computer Science - Special issue on parallel computing
An $\Omega(\sqrt{\,\log\log n}\,)$ Lower Bound for Routing in Optical Networks
SIAM Journal on Computing
An Optical Simulation of Shared Memory
SIAM Journal on Computing
Efficient communication using total-exchange
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Constant Thinning Protocol for Routing h-Relations in Complete Networks
Euro-Par '98 Proceedings of the 4th International Euro-Par Conference on Parallel Processing
Simulations of PRAM on Complete Optical Networks
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing-Volume II
"Balls into Bins" - A Simple and Tight Analysis
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Parallelism in random access machines
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
Optical communication offers huge bandwidth and makes it possible to build communication networks of very high bandwidth and connectivity. We study routing of the h-relations in optical communication pararallel computer under so called OCPC or 1-collision assumption. In an h-relation each processor is the origin and the destination of at most h-messages. In this paper we study the case where h is much larger than the number of the processors. Our algorithm uses total-exchange primitive to route packets. Our algorithm routes random h-relations in a p-processor network using $\frac{h}{p}(1+o(1))+O(\sqrt{\frac{h}{p}log p})$ total-exchange rounds with high probability. The algorithm attempts to balance the number of packets between origin-destination pairs. The experiments show that when h is large compared to the number of processors, the algorithm achieves simulation cost which is very close to 1. I.e. the h-relation is routed in the ch, where c is only little more than 1.