FAQ

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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1984-2016
02040608019842016

Related topics

Related topics

20 relations
Abstract machineBiconnected componentCentral processing unitComputer science
(More)

Broader (1)

Analysis of parallel algorithms

Related mentions per year

Related mentions per year

1950-2018
1960198020002020
Parallel random-access machine
Central processing unit
Synchronization
Field-programmable gate array
Computer science
Parallel programming model

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
TOTAL ECLIPSE—An Efficient Architectural Realization of the Parallel Random Access Machine
In the beginning of this millennium power density and related heating problems practically stopped the exponential frequency… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1997
1997
Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine
This note provides general transformations of lower bounds in Valiant's parallel comparison decision tree model to lower bounds… (More)
Is this relevant?
1996
1996
The Bulk-Synchronous Parallel Random Access Machine
The model of bulk-synchronous parallel (BSP) computation is an emerging paradigm of general-purpose parallel computing… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1996
1996
Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write Parallel Random-Access Machines
It was shown some years ago that the computation time for many important Boolean functions of n arguments on concurrent-read… (More)
  • figure 3.2
  • figure 3.3
  • figure 8.1
Is this relevant?
1992
1992
Multiplication, Division and Shift Instructions in Parallel Random Access Machines
Trahan, J.L., M.C. Loui and V. Ramachandran, Multiplication, division and shift instructions in parallel random access machines… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • table 1
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Scalability of Parallel Machines
~ calability is a common objective in the design ofmul-tiprocessors, judging by the number of parallel machine architectures… (More)
  • table 1
Is this relevant?
Highly Cited
1988
Highly Cited
1988
Removing Randomness in Parallel Computation Without a Processor Penalty
We develop some general techniques for converting randomized parallel algorithms into deterministic parallel algorithms without a… (More)
Is this relevant?
Highly Cited
1987
Highly Cited
1987
Scans as Primitive Parallel Operations
AbstmctIn most parallel random access machine (PRAM) models, memory references are assumed to take unit time. In practice, and in… (More)
Is this relevant?
1987
1987
Simultaneous WRITES of parallel random access machines do not help to compute simple arithmetic functions
The ability of the strongest parallel random access machine model WRAM is investigated. In this model different processors may… (More)
Is this relevant?
Highly Cited
1986
Highly Cited
1986
Parallel merge sort
  • Richard Cole
  • 27th Annual Symposium on Foundations of Computer…
  • 1986
We give a parallel implementation of merge sort on a CREW PRAM that uses n processors and O(logn) time; the constant in the… (More)
Is this relevant?