702 search results - page 45 / 141 » Algorithms for Minimizing Response Time in Broadcast Schedul... |
CEE
2007
14 years 9 months ago
2007
Real-time systems are often designed using preemptive scheduling and worst-case execution time estimates to guarantee the execution of high priority tasks. There is, however, an i...
163
click to vote
ICDE
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper presents a general model for estimating access times of serpentine tape drives. The model is used to schedule I/O requests in order to minimize the total access time. W...
HCW
1998
IEEE
15 years 1 months ago
1998
IEEE
A heterogeneous computing system provides a variety of different machines, orchestrated to perform an application whose subtasks have diverse execution requirements. The subtasks ...
107
click to vote
ADHOC
2007
14 years 9 months ago
2007
Abstract. Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but ...
FOCS
2007
IEEE
15 years 1 months ago
2007
IEEE
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...