Sciweavers

875 search results - page 171 / 175
» Extending the CG Model by Simulations
Sort
View
STOC
1997
ACM
91views Algorithms» more  STOC 1997»
13 years 11 months ago
Lower Bounds for Distributed Coin-Flipping and Randomized Consensus
We examine a class of collective coin- ipping games that arises from randomized distributed algorithms with halting failures. In these games, a sequence of local coin ips is gener...
James Aspnes
AAIM
2007
Springer
97views Algorithms» more  AAIM 2007»
13 years 11 months ago
Efficiency of Data Distribution in BitTorrent-Like Systems
BitTorrent (BT) in practice is a very efficient method to share data over a network of clients. In this paper we extend the recent work of Arthur and Panigrahy [1] on modelling the...
Ho-Leung Chan, Tak Wah Lam, Prudence W. H. Wong
CASES
2001
ACM
13 years 11 months ago
A system-on-a-chip lock cache with task preemption support
Intertask/interprocess synchronization overheads may be significant in a multiprocessor-shared memory System-on-a-Chip implementation. These overheads are observed in terms of loc...
Bilge Saglam Akgul, Jaehwan Lee, Vincent John Moon...
COLT
1995
Springer
13 years 11 months ago
Regression NSS: An Alternative to Cross Validation
The Noise Sensitivity Signature (NSS), originally introduced by Grossman and Lapedes (1993), was proposed as an alternative to cross validation for selecting network complexity. I...
Michael P. Perrone, Brian S. Blais
FAST
2010
13 years 9 months ago
Understanding Latent Sector Errors and How to Protect Against Them
Latent sector errors (LSEs) refer to the situation where particular sectors on a drive become inaccessible. LSEs are a critical factor in data reliability, since a single LSE can ...
Bianca Schroeder, Sotirios Damouras, Phillipa Gill