Sciweavers

5683 search results - page 3 / 1137
» Interactive Schedulability Analysis
Sort
View
SPIN
2010
Springer
13 years 5 months ago
Time-Bounded Reachability in Distributed Input/Output Interactive Probabilistic Chains
Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...
Georgel Calin, Pepijn Crouzen, Pedro R. D'Argenio,...
RTCSA
2000
IEEE
13 years 11 months ago
ProtEx: a toolkit for the analysis of distributed real-time systems
Large-scale distributed real-time systems are increasingly difficult to analyze within the Rate Monotonic Analysis framework. This is due partly to their heterogeneity, complex i...
Yves Meylan, Aneema Bajpai, Riccardo Bettati
PE
2010
Springer
114views Optimization» more  PE 2010»
13 years 5 months ago
Analysis of scheduling policies under correlated job sizes
Correlations in traffic patterns are an important facet of the workloads faced by real systems, and one that has far-reaching consequences on the performance and optimization of t...
Varun Gupta, Michelle Burroughs, Mor Harchol-Balte...
IJHPCA
2006
99views more  IJHPCA 2006»
13 years 7 months ago
A Pragmatic Analysis Of Scheduling Environments On New Computing Platforms
Today, large scale parallel systems are available at relatively low cost. Many powerful such systems have been installed all over the world and the number of users is always incre...
Lionel Eyraud
TCAD
2010
168views more  TCAD 2010»
13 years 2 months ago
An MILP-Based Performance Analysis Technique for Non-Preemptive Multitasking MPSoC
For real-time applications, it is necessary to estimate the worst-case performance early in the design process without actual hardware implementation. While the non-preemptive task...
Hoeseok Yang, Sungchan Kim, Soonhoi Ha