''Relating Two-Dimensional Reconfigurable Meshes with Optically Pipelined Buses''

Anu G. Bourgeois

Jerry L. Trahan

Proc. 14th Int'l. Parallel and Distributed Processing Symposium, 2000, pp. 747-752.


Recently, many models using reconfigurable optically pipelined buses have been proposed in the literature. We present simulations for a number of these models and establish that they possess the same complexity, so that any of these models can simulate a step of one of the other models in constant time with a polynomial increase in size. Specifically, we determine the complexity of three optical models (the PR-Mesh, APPBS, and AROB) to be the same as the well-known LR-Mesh and the cycle-free LR-Mesh.