The scheduling of processes to meet deadlines is a difficult problem often simplified by
placing severe restrictions upon the timing characteristics of individual processes. One …

A distributed hard real time system can be composed from a number of communicating
tasks. One of the difficulties with building such systems is the problem of where to place the …

The fieldbuses take more and more a major place in automation systems, in embedded
systems, in building automation. This conference is a state of the art on fieldbus. It is …

Fieldbus technology in industrial automation is not only relatively complex because of the
number of solutions possible, but also, and above all, because of the variety of applications …

From its roots in job-shop scheduling, research into fixed priority pre-emptive scheduling
theory has progressed from the artificial constraints and simplistic assumptions used in early …

Today's large-scale parallel workflows are often processed on heterogeneous distributed
computing platforms. From an economic perspective, computing resource providers should …

Scheduling theories for xed-priority scheduling are now su ciently mature that a genuine
engineering approach to the construction of hard real-time systems is possible. In this …

Real-time computing systems are used to control telecommunication systems, defense
systems, avionics, and modern factories. Generalized rate-monotonic scheduling theory, is a …

Delta-4 is a 5-nation, 13-partner project that has been investigating the achievement of
dependability in open distributed systems, including real-time systems. This book describes …

This paper presents stride scheduling, a deterministic scheduling technique that efficiently
supports the same flexible resource management abstractions introduced by lottery …