Fault-tolerant scheduling plays a significant role in improving system reliability of clusters.
Although extensive fault-tolerant scheduling algorithms have been proposed for real-time …

We present a simple method for performing real-time collision detection in a virtual surgery
environment. The method relies on the graphics hardware for testing the interpenetration …

Develo** energy-efficient clusters not only can reduce power electricity cost but also can
improve system reliability. Existing scheduling strategies developed for energy-efficient …

With the emerging of many data centers around the globe, heavy loads of large-scale
commercial and scientific applications executed in the cloud call for efficient cloud resource …

Video cameras must produce images at a reasonable frame-rate and with a reasonable
depth of field. These requirements impose fundamental physical limits on the spatial …

This paper mainly studies a task allocation and scheduling problem in the multi-thread
fulfilment process of electronic order, which seeks to minimise the makespan under thread …

In many real-time systems, preemption is either impossible or prohibitively expensive. The
problem of scheduling non-preemptive periodic tasks with known release offsets is known to …

A major requirement of many real-time embedded systems is to have time-predictable
interaction with the environment. More specifically, they need fixed or small sampling and I/O …

The concept of weakly hard real-time systems can be used to model real-time systems that
may tolerate occasional deadline misses in a bounded and predictable manner. This model …

In this paper, we study non-preemptive uniprocessor real-time scheduling using the non-
preemptive RM (npRM) and EDF (npEDF) scheduling algorithms. We discuss the limitations …