472 search results - page 75 / 95 » Quick-release Fair Scheduling |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
By combining the features of CSMA and TDMA, fully decentralised WLAN MAC schemes have recently been proposed that converge to collision-free schedules. In this paper we describe a ...
SPAA
2009
ACM
14 years 9 months 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...
AAAI
2000
13 years 10 months ago
2000
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
ASPLOS
1992
ACM
14 years 24 days ago
1992
ACM
Current technology trends make it possible to build communication networks that can support high performance distributed computing. This paper describes issues in the design of a ...
COMCOM
2007
13 years 8 months ago
2007
IEEE 802.16 employs TDMA (Time Division Multiple Access) as the access method and the policy for selecting scheduled links in a given time slot will definitely impact the system ...