Sciweavers

115 search results - page 3 / 23
» Scheduling The Can Bus With Earliest Deadline Techniques
Sort
View
RTSS
1997
IEEE
13 years 11 months ago
Exploiting skips in periodic tasks for enhancing aperiodic responsiveness
In certain real-time applications, ranging from multimedia to telecommunication systems, timing constraints can be more flexible than scheduling theory usually permits. For exampl...
Marco Caccamo, Giorgio C. Buttazzo
CEE
2007
107views more  CEE 2007»
13 years 7 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
ECRTS
2003
IEEE
14 years 20 days ago
Characteristics of EDF Schedulability on Uniform Multiprocessors
In uniform multiprocessor platforms, the various processors comprising the multiprocessor platform may have different computing capacities. The focus of this paper is the design o...
Shelby Funk, Sanjoy K. Baruah
ECRTS
1999
IEEE
13 years 11 months ago
The case for feedback control real-time scheduling
Despite the significant body of results in real-time scheduling, many real world problems are not easily supported. While algorithms such as Earliest Deadline First, Rate Monotoni...
Jack A. Stankovic, Chenyang Lu, Sang Hyuk Son, Gan...
RTAS
2010
IEEE
13 years 5 months ago
Improved Task Management Techniques for Enforcing EDF Scheduling on Recurring Tasks
The management of tasks is an essential requirement in most real-time and embedded systems, but invariably leads to unwanted CPU overheads. This paper is concerned with task manage...
Michael Short