Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,733,654 papers from all fields of science
Search
Sign In
Create Free Account
Parallel random-access machine
Known as:
ERCW
, Exclusive read, concurrent write
, CRCW
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
21 relations
Abstract machine
Biconnected component
Central processing unit
Computer science
Expand
Broader (1)
Analysis of parallel algorithms
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Circuit for concurrent read operation and method therefor
쿠오 해리
,
하곱 나자리안
2011
Corpus ID: 69718190
Non-volatile memory device has a comprises a plurality of memory units, each memory unit includes a plurality of resistive memory…
Expand
2002
2002
The Pram Factory: The Australian Performing Group Recollected
Gabrielle C. Wolf
2002
Corpus ID: 116736554
1998
1998
Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains
O. Berkman
,
Yossi Matias
,
P. Ragde
J. Algorithms
1998
Corpus ID: 6420107
We consider the problem of computing the minimum ofnvalues, and several well-known generalizations prefix minima, range minima…
Expand
1996
1996
Optimal Parallel Superprimitivity Testing for Square Arrays
C. Iliopoulos
,
M. Korda
Parallel Processing Letters
1996
Corpus ID: 207109478
We present an optimal O(log log n) time algorithm on the CRCW PRAM which tests whether a square array, A, of size n×n, is…
Expand
1996
1996
Bandwidth, Space and Computation Efficient PRAM Programming: The BSP Approach
Alexandros G. Alexandrakis
,
A. Gerbessiotis
,
David Lecomber
1996
Corpus ID: 14653809
In this paper we investigate the tractability of PRAM simulations on the IBM SP2 system through the Bulk-Synchronous Parallel…
Expand
1995
1995
On the power of randomization for the common PRAM
O. Berkman
,
Phillip B. Gibbons
,
Yossi Matias
Proceedings Third Israel Symposium on the Theory…
1995
Corpus ID: 20130384
Recent years have seen a dramatic increase in the number of nearly-constant time parallel algorithms. Paradigms and techniques…
Expand
1994
1994
Parallel String Matching with Variable Length Don't Cares
A. Bertossi
,
Filippo Logi
J. Parallel Distributed Comput.
1994
Corpus ID: 6791354
Abstract String matching is the problem of finding all the occurrences of a pattern P in a text T, where P and T are strings over…
Expand
1993
1993
O(k) Parallel Algorithms for Approximate String Matching Approximate String Matching (proposed Running Head)
A. Wright
,
Yi Jiang
1993
Corpus ID: 14296690
Given a text string T of length n, a shorter pattern string A of length m, and an integer k, an simple straightforward O(k…
Expand
1991
1991
Fast hashing on a PRAM—designing by expectation
Joseph Gil
,
Yossi Matias
ACM-SIAM Symposium on Discrete Algorithms
1991
Corpus ID: 14897964
A hash table is a data structure for representing a set of n items that uses linear space and supports membership queries in O(1…
Expand
1986
1986
: Parallel Algorithms for Bucket Sorting and the Data Dependent Prefix Problem
Yijie Han
,
Robert A. Wagner
International Conference on Parallel Processing
1986
Corpus ID: 15460466
The data dependent prefix problem is to compute all the n initial products x1⃝x2⃝...⃝xk, 1 ≤ k ≤ n, where the order is specified…
Expand