Sciweavers

30 search results - page 5 / 6
» Idle Read After Write - IRAW
Sort
View
PODC
1998
ACM
13 years 10 months ago
Probabilistic Byzantine Quorum Systems
ÐIn this paper, we explore techniques to detect Byzantine server failures in asynchronous replicated data services. Our goal is to detect arbitrary failures of data servers in a s...
Dahlia Malkhi, Michael K. Reiter, Avishai Wool, Re...
JAMIA
2011
83views more  JAMIA 2011»
12 years 9 months ago
Use of electronic clinical documentation: time spent and team interactions
Objective To measure the time spent authoring and viewing documentation and to study patterns of usage in healthcare practice. Design Audit logs for an electronic health record we...
George Hripcsak, David K. Vawdrey, Matthew R. Fred...
OSDI
2004
ACM
14 years 6 months ago
Enhancing Server Availability and Security Through Failure-Oblivious Computing
We present a new technique, failure-oblivious computing, that enables servers to execute through memory errors without memory corruption. Our safe compiler for C inserts checks th...
Martin C. Rinard, Cristian Cadar, Daniel Dumitran,...
DSN
2011
IEEE
12 years 5 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,...
FOCS
2002
IEEE
13 years 11 months ago
Implicit B-Trees: New Results for the Dictionary Problem
We reopen the issue of finding an implicit data structure for the dictionary problem. In particular, we examine the problem of maintaining Ò data values in the first Ò locatio...
Gianni Franceschini, Roberto Grossi, J. Ian Munro,...