Sciweavers

89 search results - page 13 / 18
» The overhead of consensus failure recovery
Sort
View
DAIS
2006
13 years 9 months ago
Using Speculative Push for Unnecessary Checkpoint Creation Avoidance
Abstract. This paper discusses a way of incorporating speculation techniques into Distributed Shared Memory (DSM) systems with checkpointing mechanism without creating unnecessary ...
Arkadiusz Danilecki, Michal Szychowiak
PPAM
2005
Springer
14 years 1 months ago
Checkpointing Speculative Distributed Shared Memory
This paper describes a checkpointing mechanism destined for Distributed Shared Memory (DSM) systems with speculative prefetching. Speculation is a general technique involving predi...
Arkadiusz Danilecki, Anna Kobusinska, Michal Szych...
FTCS
1993
81views more  FTCS 1993»
13 years 9 months ago
Nonblocking and Orphan-Free Message Logging Protocols
Currently existing message logging protocols demonstrate a classic pessimistic vs. optimistic tradeoff. We show that the optimistic–pessimistic tradeoff is not inherent to the p...
Lorenzo Alvisi, Bruce Hoppe, Keith Marzullo
ICDM
2003
IEEE
141views Data Mining» more  ICDM 2003»
14 years 28 days ago
Association Rule Mining in Peer-to-Peer Systems
We extend the problem of association rule mining – a key data mining problem – to systems in which the database is partitioned among a very large number of computers that are ...
Ran Wolff, Assaf Schuster
PADS
1998
ACM
13 years 12 months ago
Fault-Tolerant Distributed Simulation
In traditional distributed simulation schemes, entire simulation needs to be restarted if any of the participating LP crashes. This is highly undesirable for long running simulati...
Om P. Damani, Vijay K. Garg