Sciweavers

313 search results - page 48 / 63
» Computing synchronizer failure probabilities
Sort
View
ADBIS
1995
Springer
155views Database» more  ADBIS 1995»
15 years 3 months ago
The MaStA I/O Cost Model and its Validation Strategy
Crash recovery in database systems aims to provide an acceptable level of protection from failure at a given engineering cost. A large number of recovery mechanisms are known, and...
S. Scheuerl, Richard C. H. Connor, Ronald Morrison...
PEWASUN
2008
ACM
15 years 1 months ago
Source traffic modeling in wireless sensor networks for target tracking
Researches around wireless sensor network (WSN) were very prolific recently. However, traffic modeling related WSN research was poorly less. In this paper, source traffic dynamics...
Qinghua Wang, Tingting Zhang
APPROX
2011
Springer
272views Algorithms» more  APPROX 2011»
13 years 12 months ago
Public Key Locally Decodable Codes with Short Keys
This work considers locally decodable codes in the computationally bounded channel model. The computationally bounded channel model, introduced by Lipton in 1994, views the channe...
Brett Hemenway, Rafail Ostrovsky, Martin J. Straus...
EUROCRYPT
2004
Springer
15 years 5 months ago
Practical Large-Scale Distributed Key Generation
Generating a distributed key, where a constant fraction of the players can reconstruct the key, is an essential component of many largescale distributed computing tasks such as ful...
John F. Canny, Stephen Sorkin
FGCS
2008
140views more  FGCS 2008»
14 years 12 months ago
Blocking vs. non-blocking coordinated checkpointing for large-scale fault tolerant MPI Protocols
A long-term trend in high-performance computing is the increasing number of nodes in parallel computing platforms, which entails a higher failure probability. Fault tolerant progr...
Darius Buntinas, Camille Coti, Thomas Hérau...