192 search results - page 7 / 39 » Fair Package Assignment |
OSDI
2000
ACM
2000
ACM
Surplus Fair Scheduling: A Proportional-Share CPU Scheduling Algorithm for Symmetric Multiprocessors
15 years 3 months ago
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...
ICC
2007
IEEE
15 years 8 months ago
2007
IEEE
— In this paper, the author studies the sum throughput maximization with proportional fair scheduling (PFS) for downlink orthogonal frequency division multiple access (OFDMA) cha...
117
Voted
CONCUR
2006
Springer
15 years 5 months ago
2006
Springer
Impossible futures equivalence is the semantic equivalence on labelled transition systems that identifies systems iff they have the same "AGEF" properties: temporal logic...
ATAL
2010
Springer
15 years 2 months ago
2010
Springer
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...
ISAAC
1992
Springer
15 years 5 months ago
1992
Springer
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...