Algorithms based on semi-partitioned scheduling have been proposed as a viable alternative between the two extreme ones based on global and partitioned scheduling. In particular, ...
We consider the use of the earliest-deadline-first (EDF) scheduling algorithm in soft real-time multiprocessor systems. In hard real-time systems, a significant disparity exists...
James H. Anderson, Vasile Bud, UmaMaheswari C. Dev...
We present an optimal real-time scheduling algorithm for multiprocessors — one that satisfies all task deadlines, when the total utilization demand does not exceed the utilizat...
Hyeonjoong Cho, Binoy Ravindran, E. Douglas Jensen
This paper presents the performance analysis of several well-known partitioning scheduling algorithms in real-time and fault-tolerant multiprocessor systems. Both static and dynam...
We address in this paper the problem of scheduling for multiprocessor real-time systems with hard and soft tasks. Utility functions are associated to soft tasks to capture their r...