1068 search results - page 10 / 214 » On Space Bounded Server Algorithms |
SIGCOMM
1996
ACM
13 years 11 months ago
1996
ACM
Abstract-- We present a Start-time Fair Queueing (SFQ) algorithm that is computationally efficient and achieves fairness regardless of variation in a server capacity. We analyze it...
WIS
2004
13 years 9 months ago
2004
Modern databases allow mobile clients that subscribe to replicated data, to process the replica without requiring continuous connectivity, and to receive the updates while connecte...
SIES
2009
IEEE
14 years 2 months ago
2009
IEEE
—We introduce variable-bandwidth servers (VBS) for scheduling and executing processes under programmable temporal isolation. A VBS is an extension of a constant-bandwidth server ...
WDAG
2007
Springer
14 years 1 months ago
2007
Springer
We present the first optimally resilient, bounded, wait-free implementation of a distributed atomic register, tolerating Byzantine readers and (up to one-third of) Byzantine serve...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...