Sciweavers

286 search results - page 7 / 58
» Schedulability Analysis of MSC-based System Models
Sort
View
RTSS
2002
IEEE
14 years 19 days ago
Approximate Schedulability Analysis
The schedulability analysis problem for many realistic task models is intractable. Therefore known algorithms either have exponential complexity or at best can be solved in pseudo...
Samarjit Chakraborty, Simon Künzli, Lothar Th...
RTCSA
1999
IEEE
14 years 39 min ago
Schedulability-Driven Communication Synthesis for Time Triggered Embedded Systems
Abstract. We present an approach to static priority preemptive process scheduling for the synthesis of hard realtime distributed embedded systems where communication plays an impor...
Paul Pop, Petru Eles, Zebo Peng
ICRA
2003
IEEE
154views Robotics» more  ICRA 2003»
14 years 1 months ago
Scalability and schedulability in large, coordinated, distributed robot systems
— Multiple, independent robot platforms promise significant advantage with respect to robustness and flexibility. However, coordination between otherwise independent robots req...
John Sweeney, Huan Li, Roderic A. Grupen, Krithi R...
APLAS
2010
ACM
13 years 5 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
JCSS
2007
63views more  JCSS 2007»
13 years 7 months ago
Holistic analysis of asynchronous real-time transactions with earliest deadline scheduling
In distributed real-time systems, an application is often modeled as a set of real-time transactions, where each transaction is a chain of precedence-constrained tasks. Each task ...
Rodolfo Pellizzoni, Giuseppe Lipari