Sciweavers

215 search results - page 9 / 43
» Earliest Deadline Scheduling for Real-Time Database Systems
Sort
View
TC
2008
13 years 7 months ago
Minimum Deadline Calculation for Periodic Real-Time Tasks in Dynamic Priority Systems
Real-time systems are often designed using a set of periodic tasks. Task periods are usually set by the system requirements, but deadlines and computation times can be modified in ...
Patricia Balbastre, Ismael Ripoll, Alfons Crespo
RTSS
2007
IEEE
14 years 1 months ago
Analysis of Hierarchical EDF Pre-emptive Scheduling
This paper focuses on scheduling different hard real-time applications on a uniprocessor when the earliest deadline first algorithm is used as the local scheduler, and the global ...
Fengxiang Zhang, Alan Burns
RTSS
2007
IEEE
14 years 1 months ago
I/O-Aware Deadline Miss Ratio Management in Real-Time Embedded Databases
Recently, cheap and large capacity non-volatile memory such as flash memory is rapidly replacing disks not only in embedded systems, but also in high performance servers. Unlike ...
Woochul Kang, Sang Hyuk Son, John A. Stankovic, Me...
ICPPW
2005
IEEE
14 years 29 days ago
The Partitioned Scheduling of Sporadic Real-Time Tasks on Multiprocessor Platforms
Abstract— In the sporadic task model, a task is characterized by three parameters — an execution requirement, a relative deadline, and a period parameter — and has the interp...
Sanjoy K. Baruah, Nathan Fisher
SAC
2009
ACM
14 years 2 months ago
An implementation of the earliest deadline first algorithm in Linux
Recently, many projects have been started to introduce some real-time mechanisms into general purpose operating systems (GPOS) in order to make them capable of providing the users...
Dario Faggioli, Michael Trimarchi, Fabio Checconi