Sciweavers

10 search results - page 2 / 2
» Reliable mode changes in real-time systems with fixed priori...
Sort
View
TC
2008
13 years 4 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
JCP
2008
155views more  JCP 2008»
13 years 4 months ago
Algorithm to Optimize Code Size and Energy Consumption in Real Time Embedded System
Processor is an important computing element in portable battery operated real time embedded system and it consumes most of the battery energy. Energy consumption, processor memory ...
Santosh D. Chede, Kishore D. Kulat
RTCSA
2009
IEEE
13 years 11 months ago
Bounding the Maximum Length of Non-preemptive Regions under Fixed Priority Scheduling
The question whether preemptive systems are better than non-preemptive systems has been debated for a long time, but only partial answers have been provided in the real-time liter...
Gang Yao, Giorgio C. Buttazzo, Marko Bertogna
RTCSA
2008
IEEE
13 years 11 months ago
Maximizing the Fault Tolerance Capability of Fixed Priority Schedules
Real-time systems typically have to satisfy complex requirements, mapped to the task attributes, eventually guaranteed by the underlying scheduler. These systems consist of a mix ...
Radu Dobrin, Hüseyin Aysan, Sasikumar Punnekk...
ADAEUROPE
2005
Springer
13 years 10 months ago
Integrating Application-Defined Scheduling with the New Dispatching Policies for Ada Tasks
: In previous papers we had presented an application program interface (API) that enabled applications to use application-defined scheduling algorithms for Ada tasks in a way compa...
Mario Aldea Rivas, Javier Miranda, Michael Gonz&aa...