374 search results - page 2 / 75 » A Model of Fair Process and Its Limits |
OPODIS
2000
13 years 8 months ago
2000
We assume a link-register communication model under read/write atomicity, where every process can read from but cannot write into its neighbours' registers. The paper present...
NETWORKING
2000
13 years 8 months ago
2000
Abstract. We examine the fair allocation of capacity to a large population of best-effort connections in a typical multiple access communication system supporting some bandwidth on...
ESA
2008
Springer
13 years 8 months ago
2008
Springer
Fair-queuing schedulers provide clients with bandwidth or latency guarantees provided they are well-behaved i.e. the requested service is always within strict predefined limits. V...
OPODIS
2010
13 years 5 months ago
2010
Failure detectors are commonly viewed as abstractions for the synchronism present in distributed system models. However, investigations into the exact amount of synchronism encapsu...
IPPS
2002
IEEE
14 years 12 days ago
2002
IEEE
In this paper, a fault-tolerant routing in 2-D meshes with dynamic faults is provided. It is based on an early work on minimal routing in 2-D meshes with static faults. Unlike man...