Sciweavers

3616 search results - page 125 / 724
» Conditional Memory Ordering
Sort
View
182
Voted
ACMMSP
2006
ACM
250views Hardware» more  ACMMSP 2006»
15 years 11 months ago
What do high-level memory models mean for transactions?
Many people have proposed adding transactions, or atomic blocks, to type-safe high-level programming languages. However, researchers have not considered the semantics of transacti...
Dan Grossman, Jeremy Manson, William Pugh
SI3D
2005
ACM
15 years 10 months ago
Automatic impostor placement for guaranteed frame rates and low memory requirements
Impostors are image-based primitives commonly used to replace complex geometry in order to reduce the rendering time needed for displaying complex scenes. However, a big problem i...
Stefan Jeschke, Michael Wimmer, Heidrun Schumann, ...
IPPS
2000
IEEE
15 years 9 months ago
A Mechanism for Speculative Memory Accesses Following Synchronizing Operations
In order to reduce the overhead of synchronizing operations of shared memory multiprocessors, this paper proposes a mechanism, named specMEM, to execute memory accesses following ...
Takayuki Sato, Kazuhiko Ohno, Hiroshi Nakashima
178
Voted
ARITH
1993
IEEE
15 years 9 months ago
An accurate LNS arithmetic unit using interleaved memory function interpolator
This paper describes a logarithmic number system (LNS) arithmetic unit using a new methodfor polynomial interpolation in hardware. The use of an interleaved memory reduces storage...
David M. Lewis
CCS
2008
ACM
15 years 6 months ago
A fast real-time memory authentication protocol
We propose a new real-time authentication scheme for memory. As in previous proposals the scheme uses a Merkle tree to guarantee dynamic protection of memory. We use the universal...
Yin Hu, Ghaith Hammouri, Berk Sunar