RELATING TWO-DIMENSIONAL RECONFIGURABLE MESHES WITH OPTICALLY PIPELINED BUSES
Abstract
Recently, researchers have proposed many models using reconfigurable optically pipelined buses. 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 CF-LR-Mesh.
A preliminary version of portions of this paper appeared in the Proceedings of the International Parallel & Distributed Processing Symposium, 2000.