Doubly Logarithmic Communication Algorithms for Optical Communication Parallel Computers (1994)
| Venue: | In Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures |
| Citations: | 38 - 4 self |
BibTeX
@INPROCEEDINGS{Goldberg94doublylogarithmic,
author = {Leslie Ann Goldberg and Mark Jerrum and Tom Leighton and Satish Rao and Tom Leighton Mit},
title = {Doubly Logarithmic Communication Algorithms for Optical Communication Parallel Computers},
booktitle = {In Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures},
year = {1994},
pages = {300--309}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper we consider the problem of interprocessor communication on parallel computers that have optical communication networks. We consider the Completely Connected Optical Communication Parallel Computer (OCPC), which has a completely connected optical network and also the Mesh of Optical Buses Parallel Computer (MOBPC) , which has a mesh of optical buses as its communication network. The particular communication problem that we study is that of realizing an h-relation. In this problem, each processor has at most h messages to send and at most h messages to receive. It is clear that any 1-relation can be realized in one communication step on an OCPC. However, the best previously known p-processor OCPC algorithm for realizing an arbitrary h-relation for h ? 1 requires \Theta(h + log p) expected communication steps. (This algorithm is due to Valiant and is based on earlier work of Anderson and Miller.) Valiant's algorithm is optimal only for h = \Omega\Gamma139 p) and it is an op...
