473 search results - page 84 / 95 » Early-release fair scheduling |
114
Voted
IANDC
2007
14 years 11 months ago
2007
We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that pre...
SPAA
2009
ACM
16 years 8 days ago
2009
ACM
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
125
click to vote
JCST
2008
14 years 11 months ago
2008
The allocation of bandwidth to unlicensed users, without significantly increasing the interference on the existing licensed users, is a challenge for Ultra Wideband (UWB) networks....
TCOM
2008
14 years 11 months ago
2008
Recently, Multi-User Selection Diversity (MUSDiv) for single-carrier systems has been under extensive study on account of the enhancement it provides to system performance with min...
MFCS
2009
Springer
15 years 6 months ago
2009
Springer
We consider finite graphs whose edges are labeled with elements, called colors, taken from a fixed finite alphabet. We study the problem of determining whether there is an infi...