Sciweavers

297 search results - page 41 / 60
» A non-preemptive scheduling algorithm for soft real-time sys...
Sort
View
91
Voted
IPPS
2006
IEEE
15 years 3 months ago
Schedulability analysis of AR-TP, a Ravenscar compliant communication protocol for high-integrity distributed systems
A new token-passing algorithm called AR-TP for avoiding the non-determinism of some networking technologies is presented. This protocol allows the schedulability analysis of the n...
Santiago Urueña, Juan Zamorano, Daniel Berj...
CEE
2007
107views more  CEE 2007»
14 years 9 months ago
A non-preemptive scheduling algorithm for soft real-time systems
Real-time systems are often designed using preemptive scheduling and worst-case execution time estimates to guarantee the execution of high priority tasks. There is, however, an i...
Wenming Li, Krishna M. Kavi, Robert Akl
RTS
2011
176views more  RTS 2011»
14 years 14 days ago
Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
This paper is an extended version of a paper that appeared in the proceedings of the IEEE Real-Time Systems Symposium 2009. This paper has been updated with respect to advances ma...
Robert I. Davis, Alan Burns
RTS
2008
155views more  RTS 2008»
14 years 9 months ago
An EDF-based restricted-migration scheduling algorithm for multiprocessor soft real-time systems
There has been much recent interest in the use of the earliest-deadline-first (EDF) algorithm for scheduling soft real-time sporadic task systems on identical multiprocessors. In ...
James H. Anderson, Vasile Bud, UmaMaheswari C. Dev...
RTCSA
1995
IEEE
15 years 1 months ago
A soft aperiodic task scheduling algorithm in dynamic-priority systems
In this paper, we present a joint scheduling of hard deadline periodic and soft deadline aperiodic tasks in dynamic-priority systems. The proposed algorithm has extended the fixed...
Sungyoung Lee, Hyungill Kim, Jongwon Lee