๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Simulating the CRCW PRAM on reconfigurable networks

โœ Scribed by Wang Biing-Feng

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
764 KB
Volume
205
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

โœฆ Synopsis

This paper addresses the problem of simulating the CRCW PRAM on reconfigurable networks. Let N and M, respectively, be the numbers of processors and memory cells contained in the CRCW PRAM. We firstly show that a two-dimensional N x MN"' reconfigurable network can simulate any operation performed on the CRCW PRAM in O(1) time, where r 2 2 and is a constant. Then, if N < M, we further show that any operation performed on the CRCW PRAM can be simulated as well as O(1) time on a r-dimensional N"('-') x N"('-') x . . . xN'"'-"

x(M/N"-2'/"-") reconfigurable network, where r 2 2 and is a constant.

๐Ÿ“œ SIMILAR VOLUMES

The Hough Transform on a Reconfigurable
The Hough Transform on a Reconfigurable Multi-Ring Network
โœ S.M. Bhandarkar; H.R. Arabnia ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 636 KB

A novel reconfigurable network referred to as the Reconfigurable Multi-Ring Network (RMRN) is described. The RMRN is shown to be a truly scalable network, in that each node in the network has a fixed degree of connectivity and the reconfiguration mechanism ensures a network diameter of \(O\left(\log