572 Hits in 7.3 sec

Probabilistic analysis for mixed criticality systems using fixed priority preemptive scheduling

Dorin Maxim, Robert I. Davis, Liliana Cucu-Grosjean, Arvind Easwaran
2017 Proceedings of the 25th International Conference on Real-Time Networks and Systems - RTNS '17  
is paper introduces probabilistic analysis for xed priority preemptive scheduling of mixed criticality systems on a uniprocessor using the Adaptive Mixed Criticality (AMC) and Static Mixed Criticality  ...  A preliminary version [26] of the research described in this paper was published in the Workshop on Mixed Criticality Systems (WMC) in 2016.  ...  In this paper, we focus on the development of a probabilistic schedulability analysis framework for mixed criticality systems under Fixed-Priority Preemptive Scheduling (FPPS). ere are two well-known FPPS  ... 
doi:10.1145/3139258.3139276 dblp:conf/rtns/MaximDCE17 fatcat:d7sht3f6y5hh3fuhsztiqtfvqu

Probabilistic schedulability analysis for fixed priority mixed criticality real-time systems

Yasmina Abdeddaim, Dorin Maxim
2017 Design, Automation & Test in Europe Conference & Exhibition (DATE), 2017  
CONCLUSION In this paper we proposed mixed criticality real-time system model and a probabilistic schedulability analysis for MCRTSs running on a single processor according to a fixed priority preemptive  ...  Using this analysis a system that is deemed unschedulable using classical mixed criticality analysis can be deemed schedulable in a probabilistic sense.  ... 
doi:10.23919/date.2017.7927056 dblp:conf/date/AbdeddaimM17 fatcat:oh4zspbpgvbsle7rzabx3gdynu

Task-Level Probabilistic Scheduling Guarantees for Dependable Real-Time Systems - A Designer Centric Approach

Huseyin Aysan, Radu Dobrin, Sasikumar Punnekkat
2011 2011 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops  
levels in the context of preemptive fixed-priority scheduling.  ...  We propose a method which allows the system designer to specify task-level reliability requirements and provides a priori probabilistic scheduling guarantees for real-time tasks with mixed-criticality  ...  ACKNOWLEDGMENT This work was partially supported by the Swedish Foundation for Strategic Research via the strategic research centre PROGRESS.  ... 
doi:10.1109/isorcw.2011.34 dblp:conf/isorc/AysanDP11 fatcat:hdytminbtng7rfnibdon64mmoq

A Survey of Probabilistic Schedulability Analysis Techniques for Real-Time Systems

Robert I. Davis, Liliana Cucu-Grosjean
2018 Leibniz Transactions on Embedded Systems  
This survey covers schedulability analysis techniques for probabilistic real-time systems.  ...  It provides a taxonomy of the different methods used, and a classification of existing research.  ...  [107] adapted probabilistic response time analysis from [106] (see Section 3.3) to fixed priority preemptive scheduling of MCS using the Adaptive Mixed Criticality (AMC) and Static Mixed Criticality  ... 
doi:10.4230/lites-v006-i001-a004 dblp:journals/lites/DavisC19a fatcat:j2d4o5jnlncizilzu6jwp5jxaq

Schedulability of probabilistic mixed-criticality systems

Stefan Draskovic, Rehan Ahmed, Pengcheng Huang, Lothar Thiele
2021 Real-time systems  
AbstractMixed-criticality systems often need to fulfill safety standards that dictate different requirements for each criticality level, for example given in the 'probability of failure per hour' format  ...  A recent trend suggests designing this kind of systems by jointly scheduling tasks of different criticality levels on a shared platform.  ...  Limitations and Future Work Our analysis applies for fixed priority preemptive scheduling, but it could be extended to dynamic scheduling schemes as well.  ... 
doi:10.1007/s11241-021-09365-4 fatcat:uxvyopb2f5gwxeu5vjocw2jti4

A Survey of Research into Mixed Criticality Systems

Alan Burns, Robert I. Davis
2017 ACM Computing Surveys  
These include single processor analysis (including fixed priority and EDF scheduling, shared resources and static and synchronous scheduling), multiprocessor analysis, realistic models, and systems issues  ...  It employed a somewhat restrictive work-flow model, focused on a single processor and made use of Response Time Analysis [Joseph and Pandya 1986; Audsley et al. 1993] for fixed priority (FP) scheduling  ...  Acknowledgements The authors would like to thank Sanjoy Baruah for a number of very useful discussions on MCS.  ... 
doi:10.1145/3131347 fatcat:6ax3uztmjnaelgzwipjdcsfuaa

Mixed criticality systems with weakly-hard constraints

Oliver Gettings, Sophie Quinton, Robert I. Davis
2015 Proceedings of the 23rd International Conference on Real Time and Networks Systems - RTNS '15  
trade-off between existing fixed priority preemptive and adaptive mixed criticality policies.  ...  The principles of real-time schedulability analysis are first reviewed, providing relevant background and theory on which mixed criticality systems analysis is based.  ...  Fixed Priority Preemptive Scheduling Fixed Priority Preemptive Scheduling (FPPS), reviewed in chapter 2, is an established scheduling policy for real-time systems.  ... 
doi:10.1145/2834848.2834850 dblp:conf/rtns/GettingsQD15 fatcat:hyspiukiifh7npsbtjkb7pmg7e

A review of priority assignment in real-time systems

Robert I. Davis, Liliana Cucu-Grosjean, Marko Bertogna, Alan Burns
2016 Journal of systems architecture  
It is over 40 years since the first seminal work on priority assignment for real-time systems using fixed priority scheduling.  ...  This tutorial style review provides an in-depth assessment of priority assignment techniques for hard real-time systems scheduled using fixed priorities.  ...  Priority assignment in Mixed Criticality Systems Theorem 3 has subsequently been used to achieve a significant simplification of the problem of priority assignment in mixed criticality systems scheduled  ... 
doi:10.1016/j.sysarc.2016.04.002 fatcat:ziodjnqp7jby5pskfspogugd4u

EDF Schedulability Analysis on Mixed-Criticality Systems with Permitted Failure Probability

Zhishan Guo, Luca Santinelli, Kecheng Yang
2015 2015 IEEE 21st International Conference on Embedded and Real-Time Computing Systems and Applications  
An efficient algorithm named LFF-Clustering is derived for scheduling mixed-criticality systems represented by this model.  ...  Experimental analyses show our new model and algorithm out-perform current state-of-the-art mixed-criticality scheduling algorithms. Mixed-Criticality Systems.  ...  existing algorithms such as EDF and fixed priority scheduling, instead of incorporating probabilistic information into the scheduling strategy.  ... 
doi:10.1109/rtcsa.2015.8 dblp:conf/rtcsa/GuoSY15 fatcat:kilppnooxfcz3jp7tmvbeioa7e

Quantitative Schedulability Analysis of Continuous Probability Tasks in a Hierarchical Context

Jin Hyun Kim, Abdeldjalil Boudjadar, Ulrik Nyman, Marius Mikučionis, Kim G. Larsen, Arne Skou, Insup Lee, Linh Thi Xuan Phan
2015 Proceedings of the 18th International ACM SIGSOFT Symposium on Component-Based Software Engineering - CBSE '15  
Our work is set as a model-based framework for hierarchical scheduling systems where we introduce probability based sporadic tasks.  ...  We determine the degree of schedulability of a single scheduling component which can contain both periodic and sporadic tasks using statistical model checking in the form of Uppaal SMC.  ...  We consider static (Fixed Priority) and dynamic priority (Earliest Deadline First) scheduling policies, together with preemptive execution of tasks.  ... 
doi:10.1145/2737166.2737170 dblp:conf/cbse/KimBNMLSLP15 fatcat:yequph6fpvhlvca2rd5ymtxf5i

Degree of Schedulability of Mixed-Criticality Real-Time Systems with Probabilistic Sporadic Tasks

A. Jalil Boudjadar, Alexandre David, Jin Hyun Kim, Kim G. Larsen, Marius Mikucionis, Ulrik Nyman, Arne Skou
2014 2014 Theoretical Aspects of Software Engineering Conference  
We present the concept of degree of schedulability for mixed-criticality scheduling systems.  ...  We determine the degree of schedulability of a single scheduling component which can contain both periodic and sporadic tasks using statistical model checking in the form of UPPAAL SMC.  ...  In our setting, T s 4 has priority over T p 3 . Both tasks are scheduled according to the fixed priority scheduling (FPS) policy.  ... 
doi:10.1109/tase.2014.27 dblp:conf/tase/BoudjadarDKLMNS14 fatcat:g2ehz7edp5ezlpivdlph3pjkly

Reliability Analysis of Controller Area Network Based Systems—A Review

Gerardine Immaculate Mary, Zachariah C. Alex, Lawrence Jenkins
2013 International Journal of Communications, Network and System Sciences  
During the last couple of decades, real-time researchers have extended schedulability analysis to a mature technique which for nontrivial systems can be used to determine whether a set of tasks executing  ...  models in estimating an overall reliability figure for the system [4].  ...  Conclusions Research on schedulability analysis for fixed priority scheduling can be split to two classes.  ... 
doi:10.4236/ijcns.2013.64019 fatcat:caifafr3pzemrmaeberaa5k5re

Mixed Criticality on Multicore / Manycore Platforms (Dagstuhl Seminar 17131)

Liliana Cucu-Grosjean, Robert Davis, Sanjoy K. Baruah, Zoë Stephenson, Marc Herbstritt
2017 Dagstuhl Reports  
This report provides an overview of the discussions, the program and the outcomes of the second Dagstuhl Seminar on Mixed Criticality on Multicore/Manycore Platforms.  ...  The seminar brought together researchers working on mixed criticality real-time applications, industrialists from the aerospace, railway, and automotive industries, and experts in certification.  ...  In a traditional scheduling regime such as a preemptive, fixed-priority scheduler, we present an argument showing that the system is schedulable with respect to some assumptions.  ... 
doi:10.4230/dagrep.7.3.70 dblp:journals/dagstuhl-reports/Cucu-GrosjeanDB17 fatcat:yfevcj3azre6rdce5dcdsacnz4

Finding Response Times in a Real-Time System

M. Joseph
1986 Computer journal  
This seminar provides a venue for the exchange of ideas and the discussion of interesting unsolved problems in real-time scheduling.  ...  The format of the seminar positively encourages interaction between participants and provides ample time for relaxed discussions.  ...  analysis for preemptive systems.  ... 
doi:10.1093/comjnl/29.5.390 fatcat:xsvmc5dpwjasvemenvs74lzzrm

A review of fixed priority and EDF scheduling for hard real-time uniprocessor systems

Robert I. Davis
2014 ACM SIGBED Review  
The paper focuses on the two main scheduling algorithms used: Fixed Priority and Earliest Deadline First.  ...  It provides a background and primer to scheduling and schedulability analysis for hard real-time single processor systems.  ...  The author would like to thank Will Lunniss for his help with the background material on CRPD analysis.  ... 
doi:10.1145/2597457.2597458 fatcat:gt7yucx2pbegnbzrdb6atg7tgm
« Previous Showing results 1 — 15 out of 572 results