About this project
The Real-time TAsk-Splitting scheduling algorithms (ReTAS) framework aims to provide implementations of some well known multiprocessor scheduling algorithms in the form of Linux patches that can be applied in a gracious manner.
The vanilla kernel is modified to provide multiprocessor scheduling functionalities to use them in
soft and hard real-time systems, but so is done using the
PREEMPT-RT patch.
The ReTAS framework is currently on active development.
Main objectives
The main purpose of this framework is to show that these algorithms
can be implemented in a real operating system, and work in practice. And if they do not, modify the theory so that they work and positive results may be attained.
The framework also offers the necessary tools in order to make further developments in this area, by offering an
unified implementation of several algorithms. This results in a great environment for further experimentations in this area of research.
Another goal is to provide a way to measure the overheads in a real-world system: dispatcher overhead, task release jitter, operating system interrupts overhead and inaccuracies originated by the usage of timers.
But, the ReTAS framework is not just the algorithms's implementations themselves, it is also a set of user-space tools that result in the promotion of the developing and testing techniques available in this area.
Current versions
For now, the ReTAS framework is split between two main versions based on the 3.10.15 version of the Linux kernel and the rt11 version of the PREEMPT-RT patch.
The
linux-3.10.15-rt11-retas-partitioned patch includes the implementation of the following scheduling policy:
The
linux-3.10.15-rt11-retas-reserve patch includes the implementation of the following scheduling policies:
Please use the menu above in order to navigate through this web page, hover the installation menu item to see what versions are available for download, and upon clicking in one of them you will be presented with an installation guide.