Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

21 relations
Abstract machineBiconnected componentCentral processing unitComputer science
Expand

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
Linear work suffix array construction
Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences… Expand
  • table 1
  • figure 1
Is this relevant?
1998
1998
The Bulk-Synchronous Parallel Random Access Machine
Abstract The model of bulk-synchronous parallel (BSP) computation is an emerging paradigm of general-purpose parallel computing… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1996
1996
The Bulk-Synchronous Parallel Random Access Machine
The model of bulk-synchronous parallel (BSP) computation is intended to provide a simple and realistic framework for general… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Parallel Algorithms for Hierarchical Clustering
Hierarchical clustering is common method used to determine clusters of similar data points in multi-dimensional spaces. $O(n^2… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1992
Highly Cited
1992
An Introduction to Parallel Algorithms
Written by an authority in the field, this book provides an introduction to the design and analysis of parallel algorithms. The… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1992
1992
Multiplication, Division and Shift Instructions in Parallel Random Access Machines
Abstract We prove that polynomial time on a parallel random access machine (PRAM) with unit-cost multiplication and division or… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • table 1
Is this relevant?
Highly Cited
1987
Highly Cited
1987
Scans as Primitive Parallel Operations
A study of the effects of adding two scan primitives as unit-time primitives to PRAM (parallel random access machine) models is… Expand
Is this relevant?
Highly Cited
1986
Highly Cited
1986
Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
One of the frequently used models for a synchronous parallel computer is that of a parallel random access machine, where each… Expand
Is this relevant?
Highly Cited
1986
Highly Cited
1986
Parallel Merge Sort
We give a parallel implementation of merge sort on a CREW PRAM that uses n processors and O(logn) time; the constant in the… Expand
Is this relevant?
Highly Cited
1985
Highly Cited
1985
A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem
Abstract A simple parallel randomized algorithm to find a maximal independent set in a graph G = ( V , E ) on n vertices is… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE