Sciweavers

697 search results - page 34 / 140
» On Composable System Timing, Task Timing, and WCET Analysis
Sort
View
ADAEUROPE
2008
Springer
15 years 7 months ago
On the Timed Automata-Based Verification of Ravenscar Systems
The Ravenscar profile for Ada enforces several restrictions on the usage of general-purpose tasking constructs, thereby facilitating most analysis tasks and in particular functiona...
Iulian Ober, Nicolas Halbwachs
CORR
2010
Springer
217views Education» more  CORR 2010»
15 years 25 days ago
Semi-Partitioned Hard Real-Time Scheduling with Restricted Migrations upon Identical Multiprocessor Platforms
Algorithms based on semi-partitioned scheduling have been proposed as a viable alternative between the two extreme ones based on global and partitioned scheduling. In particular, ...
François Dorin, Patrick Meumeu Yomsi, Jo&eu...
APLAS
2010
ACM
15 years 3 months ago
Live Heap Space Bounds for Real-Time Systems
Live heap space analyses have so far been concerned with the standard sequential programming model. However, that model is not very well suited for embedded real-time systems, wher...
Martin Kero, Pawel Pietrzak, Johan Nordlander
DSD
2006
IEEE
113views Hardware» more  DSD 2006»
15 years 12 months ago
Lifetime Analysis in Heterogeneous Sensor Networks
Wireless sensor networks (WSN) are composed of battery-driven communication entities performing multiple, usually different tasks. In order to complete a given task, all sensor no...
Falko Dressler, Isabel Dietrich
ECRTS
2006
IEEE
15 years 12 months ago
Optimal deadline assignment 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 i...
Patricia Balbastre, Ismael Ripoll, Alfons Crespo