Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,518,178 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.
2017
2017
A novel write method for improving RESET distribution of PRAM
H. K. Park
,
K. W. Lee
,
+11 authors
K. Kyung
Symposium on VLSI Technology
2017
Corpus ID: 9948235
RESET distribution of phase-change random access memory (PRAM) is highly related to heat fluctuations during RESET write (RESET…
Expand
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
2008
2008
From t-Closeness to PRAM and Noise Addition Via Information Theory
David Rebollo-Monedero
,
J. Forné
,
J. Domingo-Ferrer
Privacy in Statistical Databases
2008
Corpus ID: 10834969
t-Closeness is a privacy model recently defined for data anonymization. A data set is said to satisfy t-closeness if, for each…
Expand
2007
2007
Optimal parallel selection
Yijie Han
ACM Trans. Algorithms
2007
Corpus ID: 9645870
We present an optimal parallel selection algorithm on the EREW PRAM. This algorithm runs in O(log n) time with n/log n processors…
Expand
2000
2000
A PRAM-on-chip vision
U. Vishkin
Proceedings Seventh International Symposium on…
2000
Corpus ID: 206581253
Explicit Multi-Threading (XMT) is a fine-grained computation framework introduced in our SPAA‘98 paper. XMT aims at faster single…
Expand
1996
1996
Constant Time BSR Solutions to Parenthesis Matching, Tree Decoding, and Tree Reconstruction From Its Traversals
I. Stojmenovic
IEEE Trans. Parallel Distributed Syst.
1996
Corpus ID: 26246429
Recently Akl et al. introduced a new model of parallel computation, called BSR (broadcasting with selective reduction) and showed…
Expand
1993
1993
Fast rehashing in PRAM emulations
J. Keller
Proceedings of 5th IEEE Symposium on Parallel…
1993
Corpus ID: 10187436
In PRAM emulations, universal hashing is a well-known method for distributing the address space among memory modules. However, if…
Expand
1991
1991
Achieving Optimal CRCW PRAM Fault-Tolerance
Alexander A. Shvartsman
Information Processing Letters
1991
Corpus ID: 5414081
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
1986
1986
Parallel RAMs with Owned Global Memory and Deterministic Context-Free Language Recognition (Extended Abstract)
Patrick W. Dymond
,
W. L. Ruzzo
International Colloquium on Automata, Languages…
1986
Corpus ID: 9196189
We identify and study a frequently occurring subclass of Concurrent-Read, Exclusive-Write Parallel Random Access Machines (CREW…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE