Contribution
ERCW PRAMs and optical communication

https://doi.org/10.1016/S0304-3975(97)00199-0Get rights and content
Under an Elsevier user license
Open archive

Abstract

This paper presents algorithms and lower bounds for several fundamental problems on the Exclusive Read, Concurrent Write Parallel Random Access Machine (ERCW PRAM) and some results for unbounded fan-in, bounded fan-out (or ‘BFO’) circuits. Our results for these two models are of importance because of the close relationship of the ERCW model to the OCPC model, a model of parallel computing based on dynamically reconfigurable optical networks, and of BFO circuits to the OCPC model with limited dynamic reconfiguration ability.

Keywords

Parallel algorithms
Optical communication
ERCW PRAM
Lower bounds
Bounded fan-out circuits

Cited by (0)

1
This research was performed at the University of Texas and supported by Texas Advanced Research Projects Grant 003658480.
2
This research was supported in part by Texas Advanced Research Projects Grants 003658480 and 003658386, and NSF Grant CCR 90-23059.
Copyright © 1998 Published by Elsevier B.V.