Sciweavers

1068 search results - page 18 / 214
» On Space Bounded Server Algorithms
Sort
View
SAINT
2005
IEEE
14 years 1 months ago
A Matrix Pattern Compliant Strong Stochastic Bound
Stochastic bounds are a promising method to analyze QoS requirements. Indeed it is sufficient to prove that a bound of the real performance satisfies the guarantee. However, the...
Ana Busic, Jean-Michel Fourneau
NSDI
2007
13 years 10 months ago
Beyond One-Third Faulty Replicas in Byzantine Fault Tolerant Systems
Byzantine fault tolerant systems behave correctly when no more than f out of 3f + 1 replicas fail. When there are more than f failures, traditional BFT protocols make no guarantee...
Jinyuan Li, David Mazières
EMSOFT
2010
Springer
13 years 5 months ago
Power-aware temporal isolation with variable-bandwidth servers
Variable-bandwidth servers (VBS) control process execution speed by allocating variable CPU bandwidth to processes. VBS enables temporal isolation of EDF-scheduled processes in th...
Silviu S. Craciunas, Christoph M. Kirsch, Ana Soko...
WWW
2004
ACM
14 years 8 months ago
Design of a crawler with bounded bandwidth
This paper presents an algorithm to bound the bandwidth of a Web crawler. The crawler collects statistics on the transfer rate of each server to predict the expected bandwidth use...
Michelangelo Diligenti, Marco Maggini, Filippo Mar...
ESA
2008
Springer
126views Algorithms» more  ESA 2008»
13 years 9 months ago
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
Sunil Arya, David M. Mount, Antoine Vigneron, Jian...