Ercw prams and optical communication

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 recongurable optical networks, and of BFO circuits to the OCPC model with limited dynamic reconguration ability. Topics: Parallel Algorithms, Theory of Parallel and Distributed Computing.