We address the problem of runtime monitoring for hard real-time programs—a domain in
which correctness is critical yet has largely been overlooked in the runtime monitoring …

The problem of real-time scheduling spans a broad spectrum of algorithms from simple
uniprocessor to highly sophisticated multiprocessor scheduling algorithms. In this paper, we …

In this paper we study hard real-time systems composed of independent periodic preemptive
tasks where we assume that tasks are scheduled by using Liu & Layland's pioneering model …

Task scheduling is essential for the suitable operation of multiprocessor systems. The task
scheduling is prime significance of multiprocessor parallel systems. In this paper, an efficient …

This paper presents a modified version of the maximum urgency first scheduling algorithm.
The maximum urgency algorithm combines the advantages of fixed and dynamic scheduling …

AUTOSAR (AUTOmotive Open System ARchitecture) consortium is a development
partnership between the main actors of the automotive manufacturing industry. It aims at …

Many scheduling algorithms have been studied to guarantee the time constraints of real-
time processes. Scheduling decision of these algorithms is usually based on parameters …

Real time system is a system in which the computation not only depends on producing a
correct output, but the output should be delivered within predetermine timing constraint …

It has been proved that there is no optimal online scheduler for uniform parallel machines.
Despite its non-optimality, EDF is an appropriate algorithm to use in such environments …

A big challenge of virtual learning environments is to guarantee engagement and keep
students motivated to use it. In this context, gamification techniques are being explored to …