On the implementation of real-time slotbased task-splitting scheduling algorithms for multiprocessor systems

摘要

In this paper we discuss challenges and design principles of an implementation of slot-based tasksplittingalgorithms into the Linux 2.6.34 version. We show that this kernel version is provided withthe required features for implementing such scheduling algorithms. We show that the real behavior ofthe scheduling algorithm is very close to the theoretical. We run and discuss experiments on 4-core and24-core machines.