706 search results - page 23 / 142 » Online Interval Scheduling |
ISAAC
2001
Springer
14 years 2 days 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...
ORL
2008
13 years 6 months ago
2008
We consider the problem of on-line scheduling with non-crossing constraints. The objective is to minimize the latest completion time. We provide optimal competitive ratio heuristi...
ARC
2008
Springer
13 years 9 months ago
2008
Springer
In this paper, we propose an online hardware task scheduling and placement algorithm and evaluate it performance. Experimental results on large random task set show that our algori...
AIPS
2000
13 years 9 months ago
2000
1 We consider the problem of scheduling an unknown sequence of tasks for a single server as the tasks arrive with the goal off maximizing the total weighted value of the tasks serv...
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
High-end parallel systems present a tremendous research challenge on how to best allocate their resources to match dynamic workload characteristics and user habits that are often ...