Sciweavers

192 search results - page 7 / 39
» Fair Package Assignment
Sort
View
OSDI
2000
ACM
13 years 10 months ago
Surplus Fair Scheduling: A Proportional-Share CPU Scheduling Algorithm for Symmetric Multiprocessors
In this paper, we present surplus fair scheduling (SFS), a proportional-share CPU scheduler designed for symmetric multiprocessors. We first show that the infeasibility of certain...
Abhishek Chandra, Micah Adler, Pawan Goyal, Prasha...
ICC
2007
IEEE
14 years 2 months ago
Proportional Fair Scheduling for Downlink OFDMA
— In this paper, the author studies the sum throughput maximization with proportional fair scheduling (PFS) for downlink orthogonal frequency division multiple access (OFDMA) cha...
Yao Ma
CONCUR
2006
Springer
14 years 9 days ago
Liveness, Fairness and Impossible Futures
Impossible futures equivalence is the semantic equivalence on labelled transition systems that identifies systems iff they have the same "AGEF" properties: temporal logic...
Rob J. van Glabbeek, Marc Voorhoeve
ATAL
2010
Springer
13 years 9 months ago
Infinite order Lorenz dominance for fair multiagent optimization
This paper deals with fair assignment problems in decision contexts involving multiple agents. In such problems, each agent has its own evaluation of costs and we want to find a f...
Boris Golden, Patrice Perny
ISAAC
1992
Springer
132views Algorithms» more  ISAAC 1992»
14 years 19 days ago
Generalized Assignment Problems
In the multilevel generalized assignment problem (MGAP) agents can perform tasks at more than one efficiency level. Important manufacturing problems, such as lot sizing, can be ea...
Silvano Martello, Paolo Toth