Sciweavers

1043 search results - page 54 / 209
» Reading, Writing and Relations
Sort
View
TCC
2009
Springer
130views Cryptology» more  TCC 2009»
16 years 5 months ago
How Efficient Can Memory Checking Be?
We consider the problem of memory checking, where a user wants to maintain a large database on a remote server but has only limited local storage. The user wants to use the small ...
Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod V...
POPL
2010
ACM
16 years 2 months ago
Dynamically Checking Ownership Policies in Concurrent C/C++ Programs
Concurrent programming errors arise when threads share data incorrectly. Programmers often avoid these errors by using synchronization to enforce a simple ownership policy: data i...
Jean-Phillipe Martin, Michael Hicks, Manuel Costa,...
DATE
2009
IEEE
132views Hardware» more  DATE 2009»
15 years 11 months ago
Power and performance of read-write aware Hybrid Caches with non-volatile memories
—Caches made of non-volatile memory technologies, such as Magnetic RAM (MRAM) and Phase-change RAM (PRAM), offer dramatically different power-performance characteristics when com...
Xiaoxia Wu, Jian Li, Lixin Zhang, Evan Speight, Yu...
CASES
2005
ACM
15 years 6 months ago
Exploiting pipelining to relax register-file port constraints of instruction-set extensions
Customisable embedded processors are becoming available on the market, thus making it possible for designers to speed up execution of applications by using Application-specific F...
Laura Pozzi, Paolo Ienne
FTCS
1997
115views more  FTCS 1997»
15 years 6 months ago
Robust Emulation of Shared Memory Using Dynamic Quorum-Acknowledged Broadcasts
This paper presents robust emulation of multi-writer/multi-reader registers in message-passing systems using dynamic quorum con gurations. In addition to processor and link failur...
Nancy A. Lynch, Alexander A. Shvartsman