Sciweavers

215 search results - page 7 / 43
» Earliest Deadline Scheduling for Real-Time Database Systems
Sort
View
RTAS
2008
IEEE
14 years 1 months ago
Hybrid-priority Scheduling of Resource-Sharing Sporadic Task Systems
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...
Sanjoy K. Baruah, Nathan Fisher
IPPS
2007
IEEE
14 years 1 months ago
Fault-Tolerant Earliest-Deadline-First Scheduling Algorithm
The general approach to fault tolerance in uniprocessor systems is to maintain enough time redundancy in the schedule so that any task instance can be re-executed in presence of f...
Hakem Beitollahi, Seyed Ghassem Miremadi, Geert De...
RTS
2008
134views more  RTS 2008»
13 years 5 months ago
On earliest deadline first scheduling for temporal consistency maintenance
A real-time object is one whose state may become invalid with the passage of time. A temporal validity interval is associated with the object state, and the real-time object is te...
Ming Xiong, Qiong Wang, Krithi Ramamritham
TKDE
2002
112views more  TKDE 2002»
13 years 7 months ago
Multiversion Locking Protocol with Freezing for Secure Real-Time Database Systems
Database systems for real-time applications must satisfy timing constraints associated with transactions. Typically, a timing constraint is expressed in the form of a deadline and ...
Chanjung Park, Seog Park, Sang Hyuk Son
ECRTS
2008
IEEE
14 years 1 months ago
Period and Deadline Selection for Schedulability in Real-Time Systems
Task period adaptations are often used to alleviate temporal overload conditions in real-time systems. Existing frameworks assume that only task periods are adjustable and that ta...
Thidapat Chantem, Xiaofeng Wang, Michael D. Lemmon...