297 search results - page 37 / 60 » A non-preemptive scheduling algorithm for soft real-time sys... |
122
click to vote
RTSS
2000
IEEE
15 years 2 months ago
2000
IEEE
While early research on real-time computing was concerned with guaranteeing avoidance of undesirable effects such as overload and deadline misses, adaptive real-time systems are d...
RTSS
2007
IEEE
15 years 3 months ago
2007
IEEE
This paper focuses on priority assignment for realtime systems using fixed priority scheduling. It introduces and defines the concept of a “robust” priority ordering: the most...
92
Voted
SRDS
2006
IEEE
15 years 3 months ago
2006
IEEE
We consider the problem of recovering from failures of distributable threads with assured timeliness. When a node hosting a portion of a distributable thread fails, it causes orph...
131
click to vote
ECRTS
2003
IEEE
15 years 2 months ago
2003
IEEE
In applications such as web-applications, e-commerce, and engine control, the demand for real-time data services has increased. In these applications, requests have to be processe...
ECRTS
2008
IEEE
15 years 4 months ago
2008
IEEE
The commonly used task models for real-time systems focus on execution windows expressing earliest start times and deadlines of tasks for feasibility. Within these windows, execut...