16128 search results - page 147 / 3226 » Distributed network scheduling |
131
Voted
ISPDC
2005
IEEE
15 years 8 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 ...
125
Voted
MOBICOM
2000
ACM
15 years 7 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 ...
151
Voted
RTSS
1999
IEEE
15 years 7 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...
113
click to vote
PPOPP
2009
ACM
16 years 3 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...
131
Voted
ICTAI
1994
IEEE
15 years 7 months ago
1994
IEEE
A distributed problem solving approach to job shop scheduling is described in this paper. The approach views the system as an Organisation. Agents are assigned di erent roles and ...