Preemption Test

From RTwiki
(Difference between revisions)
Jump to: navigation, search
 
(Preemption-Test)
Line 1: Line 1:
== Preemption-Test ==
 
 
 
This will test several attributes of the linux RT scheduler.  It checks to
 
This will test several attributes of the linux RT scheduler.  It checks to
 
make sure that the scheduler allows higher priority tasks to preempt lower
 
make sure that the scheduler allows higher priority tasks to preempt lower

Revision as of 16:27, 23 October 2007

This will test several attributes of the linux RT scheduler. It checks to make sure that the scheduler allows higher priority tasks to preempt lower ones, and it measures the latency it takes to do so.

The basic premise of this test is to synchronously launch a series of threads which have a monotonically increasing RT priority by a parent that is running at the highest priority. So for 5 threads, we have 5 worker threads at priorities 1-5, and a parent at 6. The sequence would basically go: 6-1-6-2-6-3-6-4-6-5. We calibrate a busy-loop so that each child gets (by default) 20ms worth of busy work to do. We then measure the latency to wake the child, wake the parent, and run the entire test.

The expected result is that we should see short wake-latencies across the board, and the higher priority threads should finish their work first.

This test was inspired by Steven Rostedt's "rt-migration-test", so many thanks to him for getting this effort off the ground.

[1]

You will need to have a development version of boost available to compile ([2])

Personal tools