3934 search results - page 35 / 787 » Approximate Schedulability Analysis |
130
click to vote
FTDCS
1997
IEEE
15 years 8 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...
107
click to vote
ICC
2007
IEEE
15 years 10 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...
116
click to vote
CORR
2010
Springer
15 years 4 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...
144
click to vote
FOCS
2007
IEEE
15 years 10 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...
114
click to vote
IEEECIT
2006
IEEE
15 years 10 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 ...