AbstractWe consider randomized simulations of shared memory on a distributed memory machine (DMM) where thenprocessors and thenmemory modules of the DMM are connected via a reconfigurable architecture. We first present a randomized simulation of a CRCW PRAM on a reconfigurable DMM having a complete reconfigurable interconnection. It guarantees delay O(log*n), with high probability. Next we study a reconfigurable mesh DMM (RM-DMM). Here thenprocessors andnmodules are connected via ann×nreconfigurable mesh. It was already known that ann×mreconfigurable mesh can simulate in constant time ann-processor CRCW PRAM with shared memory of sizem. In this paper we present a randomized step by step simulation of a CRCW PRAM with arbitrarily large share...
Abstract. The power of shared-memory in models of parallel computation is studied, and a novel distr...
AbstractWe present deterministic upper and lower bounds on the slowdown required to simulate an (n, ...
[[abstract]]In this paper, fast algorithms for simulating the CRCW shared-memory computer on reconfi...
AbstractWe consider randomized simulations of shared memory on a distributed memory machine (DMM) wh...
This paper studies relations between the parallel random access machine (pram) model, and the reconf...
We present algorithms for the randomized simulation of a shared memory machine (PRAM) on a Distribut...
The present paper provides a comprehensive study of the following problem. Consider algorithms which...
The Parallel Random Access Machine (PRAM) is an abstract parallel machine consisting of a synchrono...
Parallel Random Access Machine, PRAM, is the most popular abstract model of the parallel computation...
AbstractThis paper addresses the problem of simulating the CRCW PRAM on reconfigurable networks. Let...
AbstractAssume that a set U of memory locations is distributed among n memory modules, using some nu...
In this paper we present lower and upper bounds for the deterministic simulation of a Parallel Rando...
The Parallel Random Access Machine, \de{PRAM}, is the dominant theoretical parallel computer model. ...
[[abstract]]This paper addresses the problem of simulating the CRCW PRAM on reconfigurable networks....
We present deterministic upper and lower bounds on the slowdown required to simulate an (n;m)- PRAM ...
Abstract. The power of shared-memory in models of parallel computation is studied, and a novel distr...
AbstractWe present deterministic upper and lower bounds on the slowdown required to simulate an (n, ...
[[abstract]]In this paper, fast algorithms for simulating the CRCW shared-memory computer on reconfi...
AbstractWe consider randomized simulations of shared memory on a distributed memory machine (DMM) wh...
This paper studies relations between the parallel random access machine (pram) model, and the reconf...
We present algorithms for the randomized simulation of a shared memory machine (PRAM) on a Distribut...
The present paper provides a comprehensive study of the following problem. Consider algorithms which...
The Parallel Random Access Machine (PRAM) is an abstract parallel machine consisting of a synchrono...
Parallel Random Access Machine, PRAM, is the most popular abstract model of the parallel computation...
AbstractThis paper addresses the problem of simulating the CRCW PRAM on reconfigurable networks. Let...
AbstractAssume that a set U of memory locations is distributed among n memory modules, using some nu...
In this paper we present lower and upper bounds for the deterministic simulation of a Parallel Rando...
The Parallel Random Access Machine, \de{PRAM}, is the dominant theoretical parallel computer model. ...
[[abstract]]This paper addresses the problem of simulating the CRCW PRAM on reconfigurable networks....
We present deterministic upper and lower bounds on the slowdown required to simulate an (n;m)- PRAM ...
Abstract. The power of shared-memory in models of parallel computation is studied, and a novel distr...
AbstractWe present deterministic upper and lower bounds on the slowdown required to simulate an (n, ...
[[abstract]]In this paper, fast algorithms for simulating the CRCW shared-memory computer on reconfi...