Memory and Time-Efficient Schedulability Analysis of Task Sets with Stochastic Execution Time

Authors:
Sorin Manolache;Petru Eles;Zebo Peng
Affiliations:
-;-;-
Venue:
ECRTS '01 Proceedings of the 13th Euromicro Conference on Real-Time Systems
Year:
2001

Citing 0
Cited 13

Schedulability analysis of multiprocessor real-time applications with stochastic task execution times

Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Firm Real-Time System Scheduling Based on a Novel QoS Constraint

RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Schedulability analysis of applications with stochastic task execution times

ACM Transactions on Embedded Computing Systems (TECS)
An Exact Stochastic Analysis of Priority-Driven Periodic Real-Time Systems and Its Approximations

IEEE Transactions on Computers
Firm Real-Time System Scheduling Based on a Novel QoS Constraint

IEEE Transactions on Computers
RTDT: A static QoS manager, RT scheduling, HW/SW partitioning CAD tool

Microelectronics Journal
Task mapping and priority assignment for soft real-time applications under deadline miss ratio constraints

ACM Transactions on Embedded Computing Systems (TECS)
An analysis method for variable execution time tasks based on histograms

Real-Time Systems
Sensitivity analysis for fixed-priority real-time systems

Real-Time Systems
Stochastic Analysis of Expected Schedulability for Real-Time Tasks on a Single Computing System

DS-RT '08 Proceedings of the 2008 12th IEEE/ACM International Symposium on Distributed Simulation and Real-Time Applications
Decreasing maintenance costs by introducing formal analysis of real-time behavior in industrial settings

ISoLA'04 Proceedings of the First international conference on Leveraging Applications of Formal Methods
Real-Time scheduling

Embedded Systems Design
Other issues

Embedded Systems Design

Quantified Score

Hi-index	0.01

Visualization

Abstract

Abstract: This paper presents an efficient way to analyse the performance of task sets, where the task execution time is specified as a generalized continuous probability distribution. We consider fixed task sets of periodic, possibly dependent, non-preemptable tasks with deadlines less than or equal to the period. Our method is not restricted to any specific scheduling policy and supports policies with both dynamic and static priorities. An algorithm to construct the underlying stochastic process in a memory and time efficient way is presented. We discuss the impact of various parameters on complexity, in terms of analysis time and required memory. Experimental results show the efficiency of the proposed approach.