7891 search results - page 73 / 1579 » A Distributed Scheduling Framework |
MOBICOM
2000
ACM
15 years 4 months ago
2000
ACM
—Fairness is an important issue when accessing a shared wireless channel. With fair scheduling, it is possible to allocate bandwidth in proportion to weights of the packet flows ...
125
click to vote
RTSS
1999
IEEE
15 years 4 months ago
1999
IEEE
In this paper we present improved techniques for the schedulability analysis of tasks with precedence relations in multiprocessor and distributed systems, scheduled under a preemp...
PPOPP
2009
ACM
16 years 12 days ago
2009
ACM
Fairness is an essential requirement of any operating system scheduler. Unfortunately, existing fair scheduling algorithms are either inaccurate or inefficient and non-scalable fo...
INFOCOM
2008
IEEE
15 years 6 months ago
2008
IEEE
—In a wireless network with node exclusive spectrum sharing, two popular schedules are maximum weight matching (MWM) schedule and maximum size matching (MSM) schedule. The former...
INFOCOM
2007
IEEE
15 years 6 months ago
2007
IEEE
— We consider the problem of distributed scheduling in wireless networks. We present two different algorithms whose performance is arbitrarily close to that of maximal schedules,...