Sciweavers

927 search results - page 28 / 186
» Measuring Consistency Costs for Distributed Shared Data
Sort
View
NSDI
2010
13 years 10 months ago
Prophecy: Using History for High-Throughput Fault Tolerance
Byzantine fault-tolerant (BFT) replication has enjoyed a series of performance improvements, but remains costly due to its replicated work. We eliminate this cost for read-mostly ...
Siddhartha Sen, Wyatt Lloyd, Michael J. Freedman
WWW
2004
ACM
14 years 2 months ago
Flexible on-device service object replication with replets
An increasingly large amount of such applications employ service objects such as Servlets to generate dynamic and personalized content. Existing caching infrastructures are not we...
Dong Zhou, Nayeem Islam, Ali Ismael
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
13 years 8 months ago
Near-optimal algorithms for shared filter evaluation in data stream systems
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
CCGRID
2001
IEEE
14 years 12 days ago
Adaptive Prefetching Technique for Shared Virtual Memory
Though shared virtual memory (SVM) systems promise low cost solutions for high performance computing, they suffer from long memory latencies. These latencies are usually caused by...
Sang-Kwon Lee, Hee-Chul Yun, Joonwon Lee, Seungryo...
PKDD
2005
Springer
101views Data Mining» more  PKDD 2005»
14 years 2 months ago
A Random Method for Quantifying Changing Distributions in Data Streams
In applications such as fraud and intrusion detection, it is of great interest to measure the evolving trends in the data. We consider the problem of quantifying changes between tw...
Haixun Wang, Jian Pei