Dorin Maxim

Dorin Maxim
National Institute for Research in Computer Science and Control | INRIA · TRIO - Real time and Interoperability Research Team

About

21
Publications
892
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
363
Citations

Publications

Publications (21)
Conference Paper
Future autonomous vehicles and ADAS (Advanced Driver Assistance Systems) need real-time audio and video transmission together with control data traffic (CDT). Audio/video stream delay analysis has been largely investigated in AVB (Audio Video Bridging) context, but not yet with the presence of the CDT in the new TSN context. In this paper we presen...
Conference Paper
Full-text available
This paper introduces probabilistic analysis for fixed priority preemptive scheduling of mixed criticality systems on a uniprocessor using the Adaptive Mixed Criticality (AMC) and Static Mixed Criticality (SMC) schemes. We compare this analysis to existing deterministic methods, highlighting the performance gains that can be obtained by utilising m...
Article
This paper introduces probabilistic analysis for fixed priority preemptive scheduling of mixed criticality systems on a uniprocessor using the Adaptive Mixed Criticality (AMC) and Static Mixed Criticality (SMC) schemes. We compare this analysis to the equivalent deterministic methods, highlighting the performance gains that can be obtained by utili...
Conference Paper
The complexity of modern architectures has increased the timing variability of programs (or tasks). In this context, new approaches based on probabilistic methods are proposed to decrease the pessimism by associating probabilities to the worst case values of the programs (tasks) time execution. In this paper, we extend the original work of Chetto e...
Chapter
This chapter presents context of probabilistic real-time approaches as well as the notations and definitions commonly accepted by the real-time community. It defines probabilistic constraints. The chapter shows differences of worst-case and average probabilistic models with respect to a task response time analysis. It presents the non-optimality of...
Thesis
Critical real-time embedded systems integrate complex architectures that evolve constantly in order to provide new functionality required by the end users of the systems (automotive, avionics, railway, etc). These new architectures have a direct impact on the variability of the timing behavior of the real-time system. This variability leads to impo...
Conference Paper
In this paper, we consider a probabilistic model for real-time task systems with probabilistic worst-case execution times, probabilistic minimum inter-arrival times and probabilistic deadlines. We propose an analysis computing response time distributions of the tasks scheduled on one processor under a task-level fixed-priority preemptive scheduling...
Article
Full-text available
Static timing analysis is the state-of-the-art practice of ascertaining the timing behavior of current-generation real-time embedded systems. The adoption of more complex hardware to respond to the increasing demand for computing power in next-generation systems exacerbates some of the limitations of static timing analysis. In particular, the effor...
Article
Full-text available
6th Junior Researcher Workshop on Real-Time Computing (JRWRTC 2012) in conjunction with the 20th International Conference on Real-Time and Network Systems (RTNS 2012) Pont-à-Mousson, France, November 8-9, 2012
Article
Full-text available
In this paper we present the problem of optimal priority assignments in fixed priority preemptive single processor systems where tasks have probabilistic arrivals and execution times.We show that Rate Monotic is not optimal for our problem.
Conference Paper
Full-text available
Guaranteeing timing constraints is the main purpose of analyses for real-time systems. The satisfaction of these constraints may be verified with probabilistic methods (relying on statistical estimations of certain task parameters) offering both hard and soft guarantees. In this paper, we address the problem of sampling applied to the distributions...
Article
Full-text available
In this paper we investigate the problem of calculating the response time distribution for real-time tasks with probabilistic worst-case execution times, probabilistic inter-arrival times and probabilistic deadlines. We propose a definition for the probabilistic deadlines and a first discussion on the response time calculation.
Article
In this paper we investigate the problem of optimal priority assignment in fixed priority pre-emptive single processor systems where tasks have probabilistic execution times. We identify three sub-problems which optimise different metrics related to the probability of deadline failures. For each sub-problem we propose an algorithm that is proved op...
Article
Full-text available
A challenging research issue of analyzing a real-time system is to model the tasks composing the system and the resource provided to the system. In this paper, we propose aprobabilisticcomponent-basedmodelwhichabstractsin the interfaces both the functional and non-functional requirements of such systems. This approach allows designers to unify in t...
Conference Paper
We deal in this paper with the existence of optimal priority assignment for periodic activities (tasks or messages) with variable execution times. In the case of one processor (and periodic tasks) we provide first results on Audsley's algorithm for the preemptive and non-preemptive problems. In the case of a CAN bus (and periodic messages) we conje...

Network

Cited By