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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
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
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 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
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
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
~ 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
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
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
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
  • 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?