Towards a scalable and robust DHT
B Awerbuch, C Scheideler - Proceedings of the eighteenth annual ACM …, 2006 - dl.acm.org
The problem of scalable and robust distributed data storage has recently attracted a lot of
attention. A common approach in the area of peer-to-peer systems has been to use a …
attention. A common approach in the area of peer-to-peer systems has been to use a …
A survey of PRAM simulation techniques
TJ Harris - ACM Computing Surveys (CSUR), 1994 - dl.acm.org
The Parallel Random Access Machine (PRAM) is an abstract model of parallel computation
which allows researchers to focus on the essential characteristics of a parallel architecture …
which allows researchers to focus on the essential characteristics of a parallel architecture …
Deterministic Simulations of PRAMs on Bounded Degree Networks
KT Herley, G Bilardi - SIAM Journal on Computing, 1994 - SIAM
The problem of simulating a PRAM with n processors and memory size m\geqslantn on an n-
node bounded degree network is considered. A deterministic algorithm is presented that …
node bounded degree network is considered. A deterministic algorithm is presented that …
Efficient deterministic and probabilistic simulations of PRAMs on linear arrays with reconfigurable pipelined bus systems
In this paper, we present deterministic and probabilistic methods for simulating PRAM
computations on linear arrays with reconfigurable pipelined bus systems (LARPBS). The …
computations on linear arrays with reconfigurable pipelined bus systems (LARPBS). The …
Constructive deterministic PRAM simulation on a mesh-connected computer
A Pietracaprina, G Pucci, JF Sibeyn - Proceedings of the sixth annual …, 1994 - dl.acm.org
We present a constructive deterministic simulation of a PRAM with n processors and m= n α
shared variables, 1< α≤ 2, on an n-node mesh-connected computer where each node hosts …
shared variables, 1< α≤ 2, on an n-node mesh-connected computer where each node hosts …
[PDF][PDF] Deterministic P-RAM simulation with constant redundancy
SW Hornick, FP Preparata - Proceedings of the first annual ACM …, 1989 - dl.acm.org
In this paper, we show that distributing the memory of a parallel computer and, thereby,
decreasing its granularity allows a reduction in the redundancy required to achieve polylog …
decreasing its granularity allows a reduction in the redundancy required to achieve polylog …
The complexity of deterministic PRAM simulation on distributed memory machines
A Pietracaprina, G Pucci - Theory of Computing Systems, 1997 - Springer
In this paper we present lower and upper bounds for the deterministic simulation of a
Parallel Random Access Machine (PRAM) with n processors and m variables on a …
Parallel Random Access Machine (PRAM) with n processors and m variables on a …
A general PRAM simulation scheme for clustered machines
We present a general deterministic scheme to implement a shared memory abstraction on
any distributed-memory machine which exhibits a clustered structure. More specifically, we …
any distributed-memory machine which exhibits a clustered structure. More specifically, we …
RCC-full: An effective network for parallel computations
M Hamdi, RW Hall - Journal of Parallel and Distributed Computing, 1997 - Elsevier
A new interconnection network is proposed for the construction of a massively parallel
computer system. The systematic construction of this interconnection network, denoted RCC …
computer system. The systematic construction of this interconnection network, denoted RCC …
[PDF][PDF] A practical constructive scheme for deterministic shared-memory access
A Pietracaprina, FP Preparata - Proceedings of the fifth annual ACM …, 1993 - dl.acm.org
We present an explicit memory organization scheme for distributing hl data items among N
memory modules where M 6@(N15-o (lt'Og~ l). Each datum is replicated into a constant …
memory modules where M 6@(N15-o (lt'Og~ l). Each datum is replicated into a constant …