In an embedded real-time system (ERTS), tasks (software) are typically executed on a multicore shared-memory platform (hardware). The number of cores is usually small, contrasted with larger complex that share data to collaborate. Since most ERTSs safety-critical, it crucial rigorously verify their software against various requirements under the actual hardware constraints (concurrent access da...

In this paper we address the real-time capabilities of P-NET, which is a multi-master fieldbus standard based on a virtual token passing scheme. We show how P-NET’s medium access control (MAC) protocol is able to guarantee a bounded access time to message requests. We then propose a model for implementing fixed prioritybased dispatching mechanisms at each master’s application level. In this way...

Increasingly real-time systems must handle the self-suspension of tasks, i.e. lowerbound wait times between subtasks, in a timely and predictable manner. A fast schedulability test that does not significantly overestimate the temporal resources needed to execute self-suspending task sets would be of benefit to these modern computing systems. In this paper, we present a polynomial-time test that...

This paper presents schedulability analysis which has been developed in order to precisely estimate task response times, taking into account kernel execution effects. The analysis takes into consideration specific features of the HARTEX hard real-time kernel, and in particular: asynchronous event-driven operation; integrated scheduling of hard and soft real-time tasks (as well as tasks and reso...