Scaling Simulation of the Fusing-Restricted Reconfigurable Mesh
IEEE Transactions on Parallel and Distributed Systems
An efficient self-simulation algorithm for reconfigurable meshes
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
| Hi-index | 0.00 |
This paper studies relations between the parallel random access machine (PRAM) model, and the reconfigurable mesh (RMESH) model, by providing mutual simulations between the models. We present an algorithm simulating one step of an (nlglgn)-processor CRCW PRAM on an n/spl times/n RMESH with delay O(lglgn) with high probability. We use our PRAM simulation to obtain the first efficient self-simulation algorithm of an RMESH with general switches: An algorithm running on an n/spl times/n RMESH is simulated on a p/spl times/p RMESH with delay O((n/p)2+lgnlglg p) with high probability, which is optimal for all p/spl les/n//spl radic/(lgnlglgn). Finally, we consider the simulation of RMESH on the PRAM. We show that a 2/spl times/n RMESH can be optimally simulated on a CRCW PRAM in /spl theta/((/spl alpha/(n)) time, where /spl alpha/(/spl middot/) is the slow-growing inverse Ackermann function. In contrast, a PRAM with polynomial number of processors cannot simulate the 3/spl times/n RMESH in less than /spl Omega/(lgn/lglgn) expected time.