4081 search results - page 352 / 817 » Scheduling in polling systems |
171
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
The general approach to fault tolerance in uniprocessor systems is to maintain enough time redundancy in the schedule so that any task instance can be re-executed in presence of f...
161
click to vote
RTSS
2007
IEEE
16 years 1 months ago
2007
IEEE
We consider the issue of deadline tardiness under global multiprocessor scheduling algorithms. We present a general tardiness-bound derivation that is applicable to a wide variety...
178
Voted
ICNS
2006
IEEE
16 years 24 days ago
2006
IEEE
The ability to reserve network bandwidth is critical for the success of high-performance grid applications. While reservation of lightpaths in dynamically switched optical network...
180
click to vote
ICPADS
2006
IEEE
16 years 24 days ago
2006
IEEE
Multi-cluster schedulers can dramatically improve average job turn-around time performance by making use of fragmented node resources available throughout the grid. By carefully m...
153
click to vote
CCGRID
2005
IEEE
16 years 12 days ago
2005
IEEE
In multicluster systems, and more generally, in grids, jobs may require co-allocation, i.e., the simultaneous allocation of resources such as processors and input files in multip...