Skip to search formSkip to main contentSkip to account menu

Parallel random-access machine

Known as: ERCW, Exclusive read, concurrent write, CRCW 
In computer science, a parallel random-access machine (PRAM) is a shared-memory abstract machine. As its name indicates, the PRAM was intended as the… 
Wikipedia (opens in a new tab)

Related topics

Related topics

21 relations
Abstract machineBiconnected componentCentral processing unitComputer science

Broader (1)

Analysis of parallel algorithms

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
Efficient algorithms for constructing (1+∊,β)-spanners in the distributed and streaming models
For an unweighted undirected graph G = (V,E), and a pair of positive integers α ≥ 1, β ≥ 0, a subgraph G′ = (V,H), H ⊂eqE, is… 
1994
1994
Parallel Random Access Machines without Boolean Operations
The class of problems solved within given time and processor bounds on a Parallel Random Access Machine (PRAM) varies with the… 
1993
1993
Simulating Enhanced Meshes, with Applications
The purpose of this paper is to present non-trivial lower bounds for two classes of enhanced meshes. To achieve this goal we… 
1992
1992
Sorting on PRAMs with Reconfigurable Buses
1991
1991
Achieving Optimal CRCW PRAM Fault-Tolerance
1991
1991
Parallel construction of trees with optimal weighted path length
This paper deals with the problem of parallel construction of trees with optimal weighted path length. We study both the… 
1990
1990
Two-Dimensional Processor Array with a Reconfigurable Bus System is at Least as Powerful as CRCW Model
1989
1989
The Role of Evolved Predispositions in Cultural Evolution Or , Human Sociobiology Meets Pascal ' s Wager
Much human khavinr o R k t d by culturally t rann l t tcd E d e a w . ~ . , rttlglour smtl. ment.q-does not apptar t n make… 
1989
1989
An EREW PRAM Algorithm for Image Component Labeling
An important midlevel task for computer vision is addressed. The problem consists of labeling connected components in N/sup 1/2… 
Highly Cited
1988
Highly Cited
1988
Almost-optimum speed-ups of algorithms for bipartite matching and related problems
We present algorithms for matching and related problems that run on an EREW PRAM with <italic>p</italic> processors. Given is a… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)