215 search results - page 39 / 43 » Earliest Deadline Scheduling for Real-Time Database Systems |
TACAS
2004
Springer
14 years 21 days ago
2004
Springer
Abstract. We study schedulability problems of timed systems with nonuniformly recurring computation tasks. Assume a set of real time tasks whose best and worst execution times, and...
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
In highly interactive dynamic web database systems, user satisfaction determines their success. In such systems, userrequested web pages are dynamically created by executing a numb...
RTCSA
2008
IEEE
14 years 1 months ago
2008
IEEE
Real-time systems typically have to satisfy complex requirements, mapped to the task attributes, eventually guaranteed by the underlying scheduler. These systems consist of a mix ...
RTSS
2005
IEEE
14 years 29 days ago
2005
IEEE
We consider the scheduling of a sporadic real-time task system on an identical multiprocessor. Though Pfair algorithms are theoretically optimal for such task systems, in practice...
EMSOFT
2003
Springer
14 years 18 days ago
2003
Springer
Since the first results published in 1973 by Liu and Layland on the Rate Monotonic (RM) and Earliest Deadline First (EDF) algorithms, a lot of progress has been made in the schedu...