794 search results - page 30 / 159 » Stackelberg scheduling strategies |
105
click to vote
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract—We study the throughput capacity of wireless networks which employ (asynchronous) random-access scheduling as opposed to deterministic scheduling. The central question w...
101
click to vote
JCM
2007
14 years 9 months ago
2007
—Divisible loads are those workloads that can be partitioned by a scheduler into any arbitrary chunks. The problem of scheduling divisible loads has been defined for a long time,...
ECRTS
2008
IEEE
15 years 4 months ago
2008
IEEE
Scheduling of sporadic task systems on multiprocessor platforms is an area which has received much attention in the recent past. It is widely believed that finding an optimal sch...
121
click to vote
ISPDC
2008
IEEE
15 years 4 months ago
2008
IEEE
This paper presents a new approach for analyzing the performance of grid scheduling algorithms for tasks with dependencies. Finding the optimal procedures for DAG scheduling in Gr...
CORR
2010
Springer
14 years 4 months ago
2010
Springer
Algorithms based on semi-partitioned scheduling have been proposed as a viable alternative between the two extreme ones based on global and partitioned scheduling. In particular, ...