Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,700,867 papers from all fields of science
Search
Sign In
Create Free Account
PRAM consistency
PRAM consistency (pipelined random access memory) also known as FIFO consistency. All processes see memory writes from one process in the order they…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
4 relations
Causal consistency
Consistency model
FIFO (computing and electronics)
Process (computing)
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Verifying PRAM Consistency over Read/Write Traces of Data Replicas
Hengfeng Wei
,
Yu Huang
,
Jiannong Cao
,
Xiaoxing Ma
,
Jian Lu
arXiv.org
2013
Corpus ID: 17934640
Data replication technologies enable efficient and highly-available data access, thus gaining more and more interests in both the…
Expand
2007
2007
Optimal Parallel Merging by Counting
H. M. Bahig
,
Hatem M. Bahig
International Conference on Information…
2007
Corpus ID: 14435137
We present a new optimal deterministic parallel algorithm for merging two sorted arrays A = (a<sub>0</sub>, a<sub>1</sub…
Expand
2007
2007
Eecient Parallel Computing with Memory Faults
P. Indyk
2007
Corpus ID: 17915958
In this paper we show two results on PRAM with constant fraction of memory faults. First we show how to preprocess (i.e. connect…
Expand
2001
2001
Restricted CRCW PRAMS
Naomi
,
Nishimura
2001
Corpus ID: 52885986
Nishimura, N., Restricted CRCW PRAMS, Theoretical Computer Science 123 (1994) 4155426. We introduce a restriction on PRAMS which…
Expand
1995
1995
A lower bound for the QRQW PRAM
P. MacKenzie
Proceedings.Seventh IEEE Symposium on Parallel…
1995
Corpus ID: 29386658
The queue-read, queue-write (QRQW) parallel random access machine (PRAM) model is a shared memory model which allows concurrent…
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
1992
1992
Optimal Deterministic Sorting in Parallel Memory Hierarchies
M. Nodine
,
J. Vitter
1992
Corpus ID: 59925640
We present a general deterministic sorting strategy that is applicable to a wide variety of parallel memory hierarchies with…
Expand
1992
1992
Connected components and the interval graph
Edward F. Grove
ACM Symposium on Parallelism in Algorithms and…
1992
Corpus ID: 14753555
We consider the problem of finding in parallel the connected components of an undirected graph when the computation is…
Expand
1990
1990
Parallel Algorithms for Labeling Image Components
W. Hsu
,
X. Lin
SIGAL International Symposium on Algorithms
1990
Corpus ID: 12300194
We study the problem of labeling connected components of an N1/2×N1/2 image using parallel computers. The following new results…
Expand
1988
1988
Valiant's maximum algorithm with sequential memory accesses. Technical report
Cypher
1988
Corpus ID: 59773863
This paper examines the performance of Valiant's PRAM algorithm for finding the maximum of a set of numbers, assuming that a…
Expand