628 search results - page 43 / 126 » Scheduling Algorithm with Potential Behaviors |
OSDI
1996
ACM
13 years 10 months ago
1996
ACM
The need for supportingvarietyof hard and soft real-time, as well as best effort applications ina multimedia computing environment requires an operating system framework that: (1)...
AIPS
2006
13 years 10 months ago
2006
Searches that include both feasible and infeasible solutions have proved to be efficient algorithms for solving some scheduling problems. Researchers conjecture that these algorit...
RTCSA
2000
IEEE
14 years 1 months ago
2000
IEEE
This paper introduces an exact schedulability analysis for the optional computation model urider a specified failure hypothesis. From this analysis, we propose a solutionfor deter...
COR
2011
13 years 4 months ago
2011
In this paper we study the unrelated parallel machines problem where n independent jobs must be assigned to one out of m parallel machines and the processing time of each job di�...
SRDS
2000
IEEE
14 years 1 months ago
2000
IEEE
One way to implement a fault-tolerant a service is by replicating it at sites that fail independently. One of the replication techniques is active replication where each request i...