Sciweavers

339 search results - page 17 / 68
» Performance of Fair Distributed Mutual Exclusion Algorithms
Sort
View
SPAA
2003
ACM
14 years 22 days ago
A proportionate fair scheduling rule with good worst-case performance
In this paper we consider the following scenario. A set of n jobs with different threads is being run concurrently. Each job has an associated weight, which gives the proportion ...
Micah Adler, Petra Berenbrink, Tom Friedetzky, Les...
ANTSW
2008
Springer
13 years 9 months ago
Dissemination of Information with Fair Load Distribution in Self-organizing Grids
This paper presents an ant-inspired algorithm for building a self-organizing information system of a Grid. Ant-inspired mobile agents travel the Grid through P2P (peer-to-peer) int...
Agostino Forestiero, Carlo Mastroianni, Giandomeni...
PPOPP
2009
ACM
14 years 8 months ago
Efficient and scalable multiprocessor fair scheduling using distributed weighted round-robin
Fairness is an essential requirement of any operating system scheduler. Unfortunately, existing fair scheduling algorithms are either inaccurate or inefficient and non-scalable fo...
Tong Li, Dan P. Baumberger, Scott Hahn
ATAL
2009
Springer
14 years 2 months ago
Searching for fair joint gains in agent-based negotiation
In multi-issue negotiations, autonomous agents can act cooperatively to benefit from mutually preferred agreements. However, empirical evidence suggests that they often fail to s...
Minyi Li, Quoc Bao Vo, Ryszard Kowalczyk
SIGCOMM
2005
ACM
14 years 1 months ago
OpenDHT: a public DHT service and its uses
Large-scale distributed systems are hard to deploy, and distributed hash tables (DHTs) are no exception. To lower the barriers facing DHT-based applications, we have created a pub...
Sean C. Rhea, Brighten Godfrey, Brad Karp, John Ku...