722,085 Hits in 5.6 sec

Sensitivity analysis of task period for EDF scheduled arbitrary deadline real-time systems

Fengxiang Zhang, Alan Burns, Sanjoy Baruah
2010 2010 3rd International Conference on Computer Science and Information Technology  
We prove that a minimum task period can be determined by a single pass of the QPA algorithm. This algorithm provides exact and efficient sensitivity analysis for arbitrary deadline real-time systems.  ...  In this paper, we address the sensitivity analysis (parameter calculations) of task period for EDF scheduled systems on a uniprocessor.  ...  SYSTEM MODEL A hard real-time system comprises a set of n independent real-time tasks 1 i i d t D .  ... 
doi:10.1109/iccsit.2010.5564885 fatcat:hhfk7fdh35fevp7iheneirogcy

Sensitivity analysis for fixed-priority real-time systems

Enrico Bini, Marco Di Natale, Giorgio Buttazzo
2007 Real-time systems  
Later in the development cycle, schedulability analysis can be used to check the feasibility of the task set.  ...  At early stages in the design of real-time embedded applications, the timing attributes of the computational activities are often incompletely specified or subject to changes.  ...  Conclusions In this paper we presented a theoretical approach for performing sensitivity analysis of real-time systems consisting of a set of periodic tasks.  ... 
doi:10.1007/s11241-006-9010-1 fatcat:zhj6q3khhbhong3je6qhf5f2ge

Methods for power optimization in distributed embedded systems with real-time requirements

Razvan Racu, Arne Hamann, Rolf Ernst, Bren Mochocki, Xiaobo Sharon Hu
2006 Proceedings of the 2006 international conference on Compilers, architecture and synthesis for embedded systems - CASES '06  
Though plenty of research papers have studied the application of these techniques in real-time embedded system design through intelligent task and/or voltage scheduling, most of these results are limited  ...  In this paper, a comprehensive real-time application model including periodic, sporadic and bursty tasks as well as distributed real-time constraints such as end-to-end delays is considered.  ...  The real-time behavior is described by a set of timing constraints, like task deadlines, endto-end deadlines, and maximum jitter at system output.  ... 
doi:10.1145/1176760.1176806 dblp:conf/cases/RacuHEMH06 fatcat:nmz42cg2kfcxhejqh3yospn2me

Timed Automaton-Based Quantitative Feasibility Analysis of Symmetric Cipher in Embedded RTOS: A Case Study of AES

Yawen Ke, Xiaofeng Xia, Shahram Babaie
2022 Security and Communication Networks  
Then, by combining the overhead model with a sensitivity analysis method, we can analyze the feasibility of the cryptographic algorithm.  ...  The real-time operating system (RTOS) has a wide range of application domains and provides devices with the ability to schedule resources.  ...  Acknowledgments We thank the support of the National Foundation for Development of Cryptography, under grant no. MMJJ20180211.  ... 
doi:10.1155/2022/4118994 fatcat:4m4rzavo3bd4fk4jmcn73rhyta

Stability-aware analysis and design of embedded control systems

Amir Aminifar, Petru Eles, Zebo Peng, Anton Cervin
2013 2013 Proceedings of the International Conference on Embedded Software (EMSOFT)  
Therefore, the traditional real-time analysis approaches are not readily applicable to control applications.  ...  The nominal delay and response-time jitter can be regarded as the two main factors which relate the real-time aspects of a system to control performance and stability.  ...  [21] developed a framework for one and multi-dimensional sensitivity analysis of complex embedded real-time systems.  ... 
doi:10.1109/emsoft.2013.6658601 dblp:conf/emsoft/AminifarEPC13 fatcat:dd6lt25xcbbcjkuiihqtbuymw4

From Code to Weakly Hard Constraints: A Pragmatic End-to-End Toolchain for Timed C

Saranya Natarajan, Mitra Nasri, David Broman, Bjorn B. Brandenburg, Geoffrey Nelissen
2019 2019 IEEE Real-Time Systems Symposium (RTSS)  
Complex real-time systems are traditionally developed in several disjoint steps: (i) decomposition of applications into sets of recurrent tasks, (ii) worst-case execution time estimation, and (iii) schedulability  ...  the number of deadline misses across the entire task set, and K = {k1, . . . , kN } is the set of windows of interest of the different tasks.  ...  Sensitivity Analysis: Sensitivity analysis of timing parameters of real-time tasks, such as deadline, period, WCET, and offsets, has been studied by many researchers [3, 9, 21, 22, 27, 35-37, 43, 47]  ... 
doi:10.1109/rtss46320.2019.00025 dblp:conf/rtss/NatarajanNBBN19 fatcat:wfcndvqkgfavrcad76heofc5ty

Compositional timing analysis

Amine Marref
2010 2010 International Conference on Embedded Computer Systems: Architectures, Modeling and Simulation  
Computing the worst-case execution time (WCET) of real-time tasks is mandatory for the correct functioning of real-time systems.  ...  In component-based development (CBD) of real-time embedded systems, a task is typically constructed by composing appropriate software components together.  ...  One impact of this on WCET analysis is that a real-time task is built from a set of components which are potentially shipped from different producers [3] .  ... 
doi:10.1109/icsamos.2010.5642071 dblp:conf/samos/Marref10 fatcat:gpqjw3d6hbearaxdknpc5325jy

Scalable Utility Aware Scheduling Heuristics for Real-time Tasks with Stochastic Non-preemptive Execution Intervals

Terry Tidwell, Carter Bass, Eli Lasker, Micah Wylde, Christopher D. Gill, William D. Smart
2011 2011 23rd Euromicro Conference on Real-Time Systems  
Previously we solved a Markov Decision Process formulation of the scheduling problem to derive value-optimal scheduling policies for systems with periodic real-time task sets and stochastic non-preemptive  ...  Time utility functions can describe the complex timing constraints of real-time and cyber-physical systems. However, utility aware scheduling policy design is an open research problem.  ...  Fig. 2 . 2 Comparison of heuristic policy performance for a hard real-time task set with five tasks under heavy load. in low load hard real-time scenarios.  ... 
doi:10.1109/ecrts.2011.30 dblp:conf/ecrts/TidwellBLWGS11 fatcat:ugw6ro3majckbja473gmjvhinq

Exact Fault-Sensitive Feasibility Analysis of Real-Time Tasks

Hakan Aydin
2007 IEEE transactions on computers  
In this paper, we consider the problem of checking the feasibility of a set of n real-time tasks while provisioning for timely recovery from (at most) k transient faults.  ...  We also provide an online version of the algorithm that does not require a priori knowledge of release times. The online algorithm runs in Oðm Á k 2 Þ time, where m is the number of ready tasks.  ...  ACKNOWLEDGMENTS A preliminary version of this paper was published in the Proceedings of the IEEE Real-Time Systems Symposium (RTSS), 2004.  ... 
doi:10.1109/tc.2007.70739 fatcat:ox7pjq4uo5gonnukjyiv3zzpwu

Casting Preemptive Time Petri Nets in the Development Life Cycle of Real-Time Software

Laura Carnevali, Luigi Sassoli, Enrico Vicario
2007 Real-Time Systems (ECRTS), Proceedings of the Euromicro Workshop on  
At the same time, the preemptive Time Petri Net spec@cation and the results of its state space analysis support functional testing enabling the construction of a time-sensitive Oracle and providing a metrics  ...  We describe a methodology for the construction of realtime tasking sets, which smoothly integrates a f o m l approach in both development and veriJication processes of the software life cycle.  ...  Structure of the tasking set We assume a general setting that includes the patterns of process concurrency and interaction which are commonly encountered in the context of real-time systems [ll]. 1.  ... 
doi:10.1109/ecrts.2007.86 dblp:conf/ecrts/CarnevaliSV07 fatcat:l6ygtajoyzgbnm6nzjais7tdf4

Generalized Extraction of Real-Time Parameters for Homogeneous Synchronous Dataflow Graphs

Hazem Ismail Ali, Benny Akesson, Luis Miguel Pinho
2015 2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing  
In this paper, we present an algorithm for extracting real-time parameters (offsets, deadlines and periods) that are independent of the schedulability analysis, other applications running in the system  ...  In this paper, we present an algorithm for extracting real-time parameters (offsets, deadlines and periods) that are independent of the schedulability analysis, other applications running in the system  ...  This section reviews techniques for extracting timing parameters (unified model) of task graphs to enable applying real-time schedulers and analysis techniques.  ... 
doi:10.1109/pdp.2015.57 dblp:conf/pdp/AliAP15 fatcat:l2newutnhfhkjolwpbexqpaulm

Probabilistic Schedulability Guarantees for Dependable Real-Time Systems under Error Bursts

Huseyin Aysan, Radu Dobrin, Sasikumar Punnekkat, Rolf Johansson
2011 2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications  
We present a novel schedulability analysis that accounts for the worst case interference caused by error bursts on the response times of tasks scheduled under the fixed priority scheduling (FPS) policy  ...  The fundamental requirement for the design of effective and efficient fault-tolerance mechanisms in dependable real-time systems is a realistic and applicable model of potential faults, their manifestations  ...  analysis to provide probabilistic schedulability guarantees for the real-time task sets.  ... 
doi:10.1109/trustcom.2011.157 dblp:conf/trustcom/AysanDPJ11 fatcat:esxnwrudtbaklfdirjsjmut6ze

Sensitization of symbolic runs in real-time testing using the ORIS tool

Laura Carnevali, Luigi Sassoli, Enrico Vicario
2007 2007 IEEE Conference on Emerging Technologies & Factory Automation (EFTA 2007)  
We address the problem of test case selection and path sensitization in the process of testing real-time preemptive systems, following a formal methodology based on the theory of preemptive Time Petri  ...  Feasibility and effectiveness of the proposed sensitization technique are demonstrated through experimentation on a real-time operating system.  ...  ConclusionsWe proposed a path sensitization technique for real-time preemptive systems, using pTPN theory in the testing process of real-time task sets.  ... 
doi:10.1109/efta.2007.4416757 dblp:conf/etfa/CarnevaliSV07 fatcat:io7v5znrhbcatfintuxpcliqp4

Robust Partitioned Scheduling for Real-Time Multiprocessor Systems [chapter]

Frédéric Fauberteau, Serge Midonnet, Laurent George
2010 IFIP Advances in Information and Communication Technology  
This duration is denoted in the paper the allowance of the task and is computed with a sensitivity analysis.  ...  In this paper, we consider the problem of fixed-priority partitioned scheduling of sporadic real-time tasks for homogeneous processors.  ...  Terminology In this paper, we consider an application built from a set τ = {τ 1 , τ 2 , . . . , τ n } of n sporadic real-time tasks.  ... 
doi:10.1007/978-3-642-15234-4_19 fatcat:gcrzl3j5snex3fsi6t5bribmoy

PARTES: Performance Analysis of Real-Time Embedded Systems

Benjamin Gorry, Andrew Ireland, Peter King
2007 Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007)  
Verification of real-time software systems can often prove to be expensive in terms of time and resources.  ...  The real-time values for these models are gathered using a timing analysis technique based on the actual system hardware and software.  ...  When sensitivity analysis was performed on the first model (the model with the task processing times set as 7 seconds and 6 seconds for systems 1 and 2 respectively), the results showed that the MTTA was  ... 
doi:10.1109/qest.2007.17 dblp:conf/qest/GorryIK07 fatcat:2fsfhyvfefasvpu3avpgih6sfa
« Previous Showing results 1 — 15 out of 722,085 results