1316 search results - page 86 / 264 » A New Scheduling Algorithm for Servers |
KR
2004
Springer
14 years 4 months ago
2004
Springer
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
ISAAC
2001
Springer
14 years 3 months ago
2001
Springer
In current networks, packet losses can occur if routers do not provide sufficiently large buffers. This paper studies how many buffers should be provided in a router to eliminat...
RANDOM
1999
Springer
14 years 3 months ago
1999
Springer
We investigate an online version of a basic scheduling problem where a set of jobs has to be scheduled on a number of identical machines so as to minimize the makespan. The job pr...
ICPP
1993
IEEE
14 years 3 months ago
1993
IEEE
Task graphs are used for scheduling tasks on parallel processors when the tasks have dependencies. If the execution of the program is known ahead of time, then the tasks can be st...
GLOBECOM
2007
IEEE
14 years 5 months ago
2007
IEEE
— Graph-based algorithms for point-to-point link scheduling in Spatial reuse Time Division Multiple Access (STDMA) wireless ad hoc networks often result in a significant number ...