Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
RESET distribution of phase-change random access memory (PRAM) is highly related to heat fluctuations during RESET write (RESET… Expand
  • figure 1
  • figure 4
Is this relevant?
2013
2013
In this paper, we describe the design and use of a knowledge sharing network that has recently been deployed for agricultural… Expand
Is this relevant?
2009
2009
We investigate the relative computational power of parallel models with shared memory. Based on feasibility considerations… Expand
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Emerging three-dimensional (3D) integration technology allows for the direct placement of DRAM on top of a microprocessor… Expand
  • figure 1
  • figure 4
  • figure 6
  • figure 8
  • figure 9
Is this relevant?
1999
1999
Recently Aklet al. introduced a new model of parallel computation, called broadcasting with selective reduction (BSR), and showed… Expand
Is this relevant?
1996
1996
  • 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
  • table 1
  • figure 2
  • figure 1
  • figure 3
Is this relevant?
Highly Cited
1992
Highly Cited
1992
This paper develops shared memory algorithms for asynchronous processor systems that require the same expected work as the best… Expand
Is this relevant?
1991
1991
It is possible to combine efficiency and fault-tolerance in many PRAM algorithms in the presence of arbitrary dynamic fail-stop… Expand
Is this relevant?
1991
1991
Two parallel geometric algorithms based on the idea of point domination are presented. The first algorithm solves the d… Expand
Is this relevant?
1990
1990
It is shown that, for any fixed dimension d, the linear programming problem with n inequality constraints can be solvent on a… Expand
Is this relevant?