Filters








24,628 Hits in 4.3 sec

Analyzing Stochastic Fixed-Priority Real-Time Systems [chapter]

Mark K. Gardner, Jane W. S. Liu
1999 Lecture Notes in Computer Science  
We have implemented the technique in the PERTS real-time system prototyping environment [6, 7] .  ...  Traditionally, real-time systems require that the deadlines of all jobs be met. For many applications, however, this is an overly stringent requirement.  ...  While STDA improves our ability to predict the behavior of soft real-time systems, it is restricted to fixed priority assignments.  ... 
doi:10.1007/3-540-49059-0_4 fatcat:mrzhj6yfhre67lh7oahpnitlua

A Parameterized Formal Model for the Analysis of Preemption-Threshold Scheduling in Real-time Systems

Imene Ben Hafaiedh, Maroua Ben Slimane
2020 IEEE Access  
A stochastic version of our model is also proposed allowing to define probabilistic features and to model stochastic real-time tasks, scheduling mechanisms or energy consumption.  ...  Time-Critical systems are both complex and critical. Therefore, thorough verification processes of such systems must be performed, including behavior and timing correctness.  ...  In the context of fixed priority scheduling algorithms, the authors in [23] propose a review of priority assignment techniques for hard real-time systems scheduled using fixed priorities.  ... 
doi:10.1109/access.2020.2979354 fatcat:v5ove2adkrg43pprb6hj73wqhm

Stochastic analysis of real-time systems under preemptive priority-driven scheduling

José María López, José Luis Díaz, Joaquín Entrialgo, Daniel García
2008 Real-time systems  
Exact stochastic analysis of most real-time systems under preemptive priority-driven scheduling is unaffordable in current practice.  ...  The parameters of each task τ i are the period, T i , its initial phase, Φ i (also called offset), the execution time, C i , the real-time constraint of the task, expressed by the deadline, D i , and the  ...  . • Extend stochastic analysis to simple distributed real-time systems.  ... 
doi:10.1007/s11241-008-9053-6 fatcat:klnls6l4fzbztaelx7vr5b3eke

Implementing an adaptive traffic signal control algorithm in an agent-based transport simulation

Nico Kühnel, Theresa Thunig, Kai Nagel
2018 Procedia Computer Science  
The adaptive control significantly outperforms the fixed-time control for stochastic demand, where its ability to dynamically react to changes in flow becomes important.  ...  The adaptive control significantly outperforms the fixed-time control for stochastic demand, where its ability to dynamically react to changes in flow becomes important.  ...  To analyze the temporal behavior of the signal algorithm, queue lengths of a simulation with fixed demand have been analyzed over time.  ... 
doi:10.1016/j.procs.2018.04.086 fatcat:eh3vlo4vvzb6xhxmsjehbdxune

Real-Time Performance Estimation for Dynamic, Distributed Real-Time Systems [chapter]

Eui-Nam Huh, Lonnie R. Welch, Y. Mun
2002 Lecture Notes in Computer Science  
A wrong system performance analysis can lead to a catastrophe in a dynamic real-time system.  ...  The main contribution of this paper is accurate analysis of real-time performance for dynamic real-time applications.  ...  All of these dynamic real-time systems require consideration of variable execution times and/or arrival rates of tasks, as opposed to deterministic and stochastic real-time systems which have a priori  ... 
doi:10.1007/3-540-47789-6_113 fatcat:j5hfrddtbzhnfexnyod4mmobja

A Stochastic Response Time Analysis for Communications in On-chip Networks

Meng Liu, Moris Behnam, Thomas Nolte
2015 2015 IEEE 21st International Conference on Embedded and Real-Time Computing Systems and Applications  
Priority-based wormhole-switching has been proposed as a solution to handle real-time traffic in on-chip networks.  ...  Therefore, in this paper, we present a stochastic Response Time Analysis (RTA) which can calculate a distribution of the response times of a real-time NoC flow.  ...  In [15] , the authors introduce a stochastic time demand analysis to calculate a lower bound of the deadline meeting ratio of each task in a system using fixed priority scheduling.  ... 
doi:10.1109/rtcsa.2015.25 dblp:conf/rtcsa/LiuBN15 fatcat:76lqbdjmxzgz7pxx2uf4tbuypa

Page 1728 of Mathematical Reviews Vol. 41, Issue 6 [page]

1971 Mathematical Reviews  
the relative waiting times of each priority group, This paper continues his work by deriving a result for a delay- dependent priority system in which a unit’s priority is decreased linearly with time  ...  Sufficient criteria for the stability of the solutions of systems of nonlinear stochastic differential equations on a finite interval of time.  ... 

Probabilistic Deadline Miss Analysis of Real-Time Systems Using Regenerative Transient Analysis

Laura Carnevali, Alessandra Melani, Luca Santinelli, Giuseppe Lipari
2014 Proceedings of the 22nd International Conference on Real-Time Networks and Systems - RTNS '14  
We propose a framework for modeling and evaluating periodic real-time tasks that may have a probabilistic Worst Case Execution Time (pWCET) and are scheduled by a fixed-priority non-preemptive policy.  ...  Real-time systems, probabilistic schedulability analysis, probabilistic Worst Case Execution Time (pWCET), Extreme Value Theory (EVT), non-Markovian stochastic analysis.  ...  Task model We consider concurrent tasks running on a single-processor real-time system under fixed-priority non-preemptive policy.  ... 
doi:10.1145/2659787.2659823 dblp:conf/rtns/CarnevaliMSL14 fatcat:z5btpeemfzej7lex7fdf2h7boa

Page 3382 of Mathematical Reviews Vol. , Issue 99e [page]

1999 Mathematical Reviews  
We cover estimation at both end of busy periods and in real time. The applicability of the theory is demonstrated by analyzing a service operation.” 99e:60206 60K25 90B22 Nunez-Queija, R.  ...  In principle, high priority customers have preemptive priority over low priority customers, except on a fixed number of channels that are reserved for low priority traffic.  ... 

Providing statistical delay guarantees in wireless networks

S. Wang, R. Nathuji, R. Bettati, W. Zhao
2004 24th International Conference on Distributed Computing Systems, 2004. Proceedings.  
This work studies the delay performance of policed traffic to provide real-time guarantees over wireless networks.  ...  In this paper, we describe a general framework to incorporate such models into delay guarantee computations for real-time traffic.  ...  systems, the communication links are assumed to have a fixed capacity over time.  ... 
doi:10.1109/icdcs.2004.1281567 dblp:conf/icdcs/WangNBZ04 fatcat:2t5aqitjgbbofeawjjqu4os2qi

Page 3493 of Mathematical Reviews Vol. , Issue 90F [page]

1990 Mathematical Reviews  
The authors consider an M/G/1 queueing system in which each customer returns a fixed number of times.  ...  A recursive expres- sion is obtained for the average waiting time of various classes of customers, and the result achieved by using dynamic priorities is analyzed.” O. K.  ... 

Flexible Framework for Statistical Schedulability Analysis of Probabilistic Sporadic Tasks

Abdeldjalil Boudjadar, Jin Hyun Kim, Alexandre David, Kim G. Larsen Marius Mikucionis, Ulrik Nyman, Arne Skou, Insup Lee, Linh Thi Xuan Phan
2015 2015 IEEE 18th International Symposium on Real-Time Distributed Computing  
systems.  ...  In this paper, we present a flexible schedulability analysis framework for periodic and sporadic tasks having probabilistic attributes where the computation time scales linearly in the size of analyzed  ...  This paper introduces a framework for analyzing a soft real-time system and providing realistic response time distributions for each of the probabilistic tasks in the system.  ... 
doi:10.1109/isorc.2015.21 dblp:conf/isorc/BoudjadarKDLMNS15 fatcat:uzwgaddppreg3dufw7ygm3hn2a

Toward probabilistic real-time calculus

Luca Santinelli, Liliana Cucu-Grosjean
2011 ACM SIGBED Review  
A challenging research issue in analyzing probabilistic real-time systems is to model the tasks composing the system and the resource provided to the system.  ...  Besides, it has been derived probabilistic scheduling and compositional guarantees to provide real-time analyses of probabilistic real-time systems.  ...  real-time systems.  ... 
doi:10.1145/1967021.1967028 fatcat:h7tqd2iztvb6hfzwktur3dj76e

Hard real-time scheduling for low-energy using stochastic data and DVS processors

Flavius Gruian
2001 Proceedings of the 2001 international symposium on Low power electronics and design - ISLPED '01  
The work presented in this paper addresses scheduling for reduced energy of hard real-time tasks with fixed priorities assigned in a rate monotonic or deadline monotonic manner.  ...  Taking into account the real behavior of a realtime system, which is often better than the worst case, our methods employ stochastic data to derive energy efficient schedules.  ...  Yet, these mainly target soft real-time systems, where deadlines can be missed if the Quality of Service is kept.  ... 
doi:10.1145/383082.383092 dblp:conf/islped/Gruian01 fatcat:3r767wy7ajd4xdhqvqau6o6qke

Page 4872 of Mathematical Reviews Vol. , Issue 99g [page]

1999 Mathematical Reviews  
As M — oo, the waiting time distribution in such a system tends to the waiting time distribution in the M/D/1 system.”  ...  The author gives a nice set of numerical examples, though no real problem is analyzed. Carl M. Harris (Fairfax, VA) 999:60176 60K25 60J10 68M20 Shin, Yang Woo; Pearce, C. E.  ... 
« Previous Showing results 1 — 15 out of 24,628 results