Sciweavers

297 search results - page 2 / 60
» A non-preemptive scheduling algorithm for soft real-time sys...
Sort
View
RTCSA
2008
IEEE
14 years 2 months ago
Schedulability Analysis for Non-Preemptive Tasks under Strict Periodicity Constraints
Real-time systems are often designed using preemptive scheduling to guarantee the execution of high priority tasks. For multiple reasons there is a great interest in exploring non...
Omar Kermia, Yves Sorel
RTAS
2008
IEEE
14 years 2 months ago
Bounding Worst-Case Response Time for Tasks with Non-Preemptive Regions
Real-time schedulability theory requires a priori knowledge of the worst-case execution time (WCET) of every task in the system. Fundamental to the calculation of WCET is a schedu...
Harini Ramaprasad, Frank Mueller
HIPC
2003
Springer
14 years 1 months ago
Combined Scheduling of Hard and Soft Real-Time Tasks in Multiprocessor Systems
Many complex real-time applications involve combined scheduling of hard and soft real-time tasks. In this paper, we propose a combined scheduling algorithm, called Emergency Algori...
Basheer Al-Duwairi, Govindarasu Manimaran
RTSS
2003
IEEE
14 years 1 months ago
Dynamic Integrated Scheduling of Hard Real-Time, Soft Real-Time and Non-Real-Time Processes
Real-time systems are growing in complexity and realtime and soft real-time applications are becoming common in general-purpose computing environments. Thus, there is a growing ne...
Scott A. Brandt, Scott A. Banachowski, Caixue Lin,...
ECRTS
2005
IEEE
14 years 2 months ago
An EDF-based Scheduling Algorithm for Multiprocessor Soft Real-Time Systems
We consider the use of the earliest-deadline-first (EDF) scheduling algorithm in soft real-time multiprocessor systems. In hard real-time systems, a significant disparity exists...
James H. Anderson, Vasile Bud, UmaMaheswari C. Dev...