2438 search results - page 125 / 488 » Scheduling problems for parallel and distributed systems |
172
click to vote
IPPS
2003
IEEE
15 years 9 months ago
2003
IEEE
In this paper we present an adaptation of the Dual Priority Scheduling Algorithm to schedule both hard realtime periodic tasks and soft-aperiodic tasks in shared memory multiproce...
104
click to vote
CLUSTER
2006
IEEE
15 years 10 months ago
2006
IEEE
Distributed applications, especially the ones being I/O intensive, often access the storage subsystem in a non-sequential way (stride requests). Since such behaviors lower the ove...
127
click to vote
SPAA
2009
ACM
16 years 5 months ago
2009
ACM
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
139
Voted
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
In parallel processing systems, a fundamental consideration is the maximization of system performance through task mapping. A good allocation strategy may improve resource utilizat...
139
click to vote
IPPS
2007
IEEE
15 years 11 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...