-
Philippe Gerum authored
For applications with only few runnable tasks at any point in time, a linear queue ordering the latter for scheduling delivers better performance on low-end systems due to smaller CPU cache footprints, compared to the multi-level queue used by the scalable scheduler. Allow users to select between lightning-fast and scalable scheduler implementation depending on the runtime profile of the application. Signed-off-by: Philippe Gerum <rpm@xenomai.org> # Please enter the commit message for your changes. Lines starting # with '#' will be ignored, and an empty message aborts the commit. # # On branch evl/master # Your branch is ahead of 'origin/evl/master' by 2 commits. # (use "git push" to publish your local commits) # # Changes to be committed: # modified: include/evl/sched.h # modified: include/evl/sched/queue.h # modified: include/evl/sched/tp.h # modified: include/evl/sched/weak.h # modified: kernel/evl/Kconfig # modified: kernel/evl/sched/core.c # # Untracked files: # include/trace/events/mm.h #
5029c829