Data networks
The competitiveness of on-line assignments
Journal of Algorithms
On-line routing of virtual circuits with applications to load balancing and machine scheduling
Journal of the ACM (JACM)
Improved bicriteria existence theorems for scheduling
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Approximate majorization and fair online load balancing
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Combining fairness with throughout: online routing with multiple objectives
Journal of Computer and System Sciences - Special issue on Internet algorithms
Developments from a June 1996 seminar on Online algorithms: the state of the art
Fairness in Routing and Load Balancing
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Fairness measures for resource allocation
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
On the Existence of Schedules that are Near-Optimal for both Makespan and Total Weighted Completion time
All-norm approximation algorithms
Journal of Algorithms
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Centralized and distributed algorithms for routing and weighted max-min fair bandwidth allocation
IEEE/ACM Transactions on Networking (TON)
Bi-objective Optimization: An Online Algorithm for Job Assignment
GPC '09 Proceedings of the 4th International Conference on Advances in Grid and Pervasive Computing
The Design of Competitive Online Algorithms via a Primal: Dual Approach
Foundations and Trends® in Theoretical Computer Science
Dynamic resource selection heuristics for a non-reserved bidding-based Grid environment
Future Generation Computer Systems
A Primal-Dual Randomized Algorithm for Weighted Paging
Journal of the ACM (JACM)
ACM Transactions on Algorithms (TALG)
Hi-index | 0.00 |
We revisit from a fairness point of view the problem of online load balancing in the restricted assignment model and the 1-∞ model. We consider both a job-centric and a machine-centric view of fairness, as proposed by Goel et al. [11]. These notions are equivalent to the approximate notion of prefix competitiveness proposed by Kleinberg, Rabani and Tardos [14], as well as to the notion of approximate majorization, and they generalize the well studied notion of max-min fairness.We resolve a question posed by Goel,Meyerson and Plotkin [11] proving that the greedy strategy is globally O(logm)-fair, where m denotes the number of machines. This result improves upon the analysis of [11] who showed that the greedy strategy is globally O(log n)-fair, where n is the number of jobs. Typically, n m, and therefore our improvement is significant. Our proof matches the known lower bound for the problem with respect to the measure of global fairness.The improved bound is obtained by analyzing, in a more accurate way, the more general restricted assignment model studied previously in [6]. We provide an alternative bound which is not worse than the bounds of [6], and it is strictly better in many cases. The bound we prove is, in fact, much more general and it bounds the load on any prefix of most loaded machines. As a corollary from this more general bound we get that the greedy algorithm results in an assignment that is globally O(logm)-balanced. The last result generalizes the previous result of [11] who proved that the greedy algorithm yields an assignment that is globally O(logm)-balanced for the 1-∞ model.