Sciweavers

1043 search results - page 85 / 209
» Reading, Writing and Relations
Sort
View
PODC
2004
ACM
15 years 11 months ago
Byzantine disk paxos: optimal resilience with byzantine shared memory
We present Byzantine Disk Paxos, an asynchronous shared-memory consensus algorithm that uses a collection of n > 3t disks, t of which may fail by becoming non-responsive or arb...
Ittai Abraham, Gregory Chockler, Idit Keidar, Dahl...
SPAA
2010
ACM
15 years 11 months ago
Transactions in the jungle
Transactional memory (TM) has shown potential to simplify the task of writing concurrent programs. Inspired by classical work on databases, formal definitions of the semantics of...
Rachid Guerraoui, Thomas A. Henzinger, Michal Kapa...
ACSAC
2004
IEEE
15 years 10 months ago
A Dynamic Technique for Eliminating Buffer Overflow Vulnerabilities (and Other Memory Errors)
Buffer overflow vulnerabilities are caused by programming errors that allow an attacker to cause the program to write beyond the bounds of an allocated memory block to corrupt oth...
Martin C. Rinard, Cristian Cadar, Daniel Dumitran,...
DSN
2011
IEEE
14 years 6 months ago
LLS: Cooperative integration of wear-leveling and salvaging for PCM main memory
Phase change memory (PCM) has emerged as a promising technology for main memory due to many advan­ tages, such as better scalability, non-volatility and fast read access. However,...
Lei Jiang, Yu Du, Youtao Zhang, Bruce R. Childers,...
APSEC
2002
IEEE
15 years 11 months ago
A Virtual File System for Source Program Editing
In this paper, we propose a virtual file system, “SPDFS,” which provides global declarations in source programs as virtual files to programmers. Global declarations means ob...
Yoshida Atsushi, Fukuyasu Naoki