84 search results - page 8 / 17 » Online real-time preemptive scheduling of jobs with deadline... |
RTSS
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—The functional consolidation induced by the costreduction trends in embedded systems can force tasks of different criticality (e.g. ABS Brakes with DVD) to share a proce...
JCO
2000
13 years 7 months ago
2000
We consider the problem of off-line throughput maximization for job scheduling on one or more machines, where each job has a release time, a deadline and a profit. Most of the ver...
LCN
2006
IEEE
14 years 1 months ago
2006
IEEE
— In this paper, we present a distributed computing framework designed to support higher quality of service and fault tolerance for processing deadline-driven tasks in a P2P envi...
DATE
2004
IEEE
13 years 11 months ago
2004
IEEE
This report addresses the problem of scheduling for real-time systems that include both hard and soft tasks. In order to capture the relative importance of soft tasks and how the ...
RTAS
2008
IEEE
14 years 2 months ago
2008
IEEE
A hybrid scheduling algorithm is proposed, which integrates features of the Fixed Priority (FP) and Earliest Deadline First (EDF) scheduling policies. It is shown that this hybrid...