Latest news from the project are shown below.
The paper "SPRINT: Extending RUN to Schedule Sporadic Tasks" by Andrea Baldovin, Geoffrey Nelissen, Tullio Vardanega and Eduardo Tovar has been presented at the 22nd International Conference on Real-Time Networks and Systems (RTNS 2014), held in Versailles, France in October 2014.
The RUN algorithm has proven to be a very effective technique for optimal multiprocessor scheduling, thanks to the limited number of preemptions and migrations incurred by the scheduled task set. This permits to achieve high system utilisation rates typical of global scheduling approaches without paying too much penalty due to excessive preemption and migration overheads. Unfortunately, the adoption of RUN in real-world applications is limited by the missing support to sporadic task sets: we address this problem by proposing SPRINT (SPoradic Run for INdependent Tasks).