3934 search results - page 35 / 787 » Approximate Schedulability Analysis |
FTDCS
1997
IEEE
14 years 1 months ago
1997
IEEE
This paper deals with the problem of scheduling aperiodic groups of tasks in distributed systems. It proposes two contributions, namely: i) a distributed scheduling algorithm to b...
ICC
2007
IEEE
14 years 4 months ago
2007
IEEE
— We study the performance of fair physical layer schedulers that select a pair of orthogonal users for simultaneous transmission. The schemes rely on partial channel state infor...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
One of the classic results in scheduling theory is the 2-approximation algorithm by Lenstra, Shmoys, and Tardos for the problem of scheduling jobs to minimize makespan on unrelate...
FOCS
2007
IEEE
14 years 4 months ago
2007
IEEE
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
IEEECIT
2006
IEEE
14 years 3 months ago
2006
IEEE
In this paper, we propose a new scheduling method for asynchronous circuits in bundled-data implementation. The method is based on integer linear programming (ILP) which explores ...