While it is widely believed that preemptability is a necessary requirement for developing real-time software, there are additional costs involved with preemptive scheduling, as co...
A non-blocking protocol that allows real-time tasks to share data in a multiprocessor system is presented in this paper. The protocol gives the means to concurrent real-time tasks...
Abstract. We present an approach to static priority preemptive process scheduling for the synthesis of hard realtime distributed embedded systems where communication plays an impor...
Java's automatic memory management is the main reason that prevents Java from being used in hard realtime environments. We present the garbage collection mechanism that is us...
EMERALDS (Extensible Microkernel for Embedded, ReALtime, Distributed Systems) is a real-time microkernel designed for small-memory embedded applications. These applications must r...
This paper presents a method for tight prediction of worst-case performance of data caches in highperformance real-time systems. Our approach is to distinguish between data struct...
Although an optimistic approach has been shown to be better than locking protocols for real-time database systems (RTDBS), it has the problems of unnecessary restarts and heavy re...
The lifecycle for industrial applications are becoming shorter, the application complexity increases, performance is to low, fault tolerance is required, reuse of components is de...
Scheduling in an environment with constraints of many different types is known to be a hard problem. We tackle this problem for an integrated steel plant in Ghent, Belgium, using ...