147 search results - page 1 / 30 » An optimal lower bound for anonymous scheduling mechanisms |
SIGECOM
2009
ACM
13 years 11 months ago
2009
ACM
ICALP
2007
Springer
13 years 10 months ago
2007
Springer
In this paper, we consider the mechanism design version of the fractional variant of the scheduling problem on unrelated machines. We give a lower bound of 2 − 1/n for any fracti...
CORR
2011
Springer
12 years 8 months ago
2011
Springer
We study problems of scheduling jobs on related machines so as to minimize the makespan in the setting where machines are strategic agents. In this problem, each job j has a lengt...
GLOBECOM
2008
IEEE
13 years 11 months ago
2008
IEEE
— This paper considers the scheduling problem in wireless networks. We focus on prioritized maximal scheduling, where a maximal scheduler chooses the links in an order specified...
ICCAD
2006
IEEE
14 years 1 months ago
2006
IEEE
We present a dynamic voltage scaling (DVS) technique that minimizes system-wide energy consumption for both periodic and sporadic tasks. It is known that a system consists of proc...