3844 search results - page 79 / 769 » Distributed Meeting Scheduling |
AINA
2008
IEEE
14 years 3 months ago
2008
IEEE
We consider scheduling distributed real-time tasks in unreliable (e.g., those with arbitrary node and network failures) and untrustworthy systems (e.g., those with Byzantine node ...
ISPDC
2005
IEEE
14 years 2 months ago
2005
IEEE
An important scheduling problem is the one in which there are no dependencies between tasks and the tasks can be of arbitrary size. This is known as the divisible load scheduling ...
MOBICOM
2000
ACM
14 years 1 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 ...
RTSS
1999
IEEE
14 years 1 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
14 years 9 months 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...