mirror of
https://github.com/genodelabs/genode.git
synced 2024-12-19 05:37:54 +00:00
1b1fd1e1f9
The new scheduler serves the orthogonal requirements of both high-throughput-oriented scheduling contexts (shortly called fill in the scheduler) and low-latency-oriented scheduling contexts (shortly called claim in the scheduler). Thus it knows two scheduling modes. Every claim owns a CPU-time-quota expressed as percentage of a super period (currently 1 second) and a priority that is absolute as long as the claim has quota left for the current super period. At the end of a super period the quota of all claims gets refreshed. During a super period, the claim mode is dominant as long as any active claim has quota left. Every time this isn't the case, the scheduler switches to scheduling of fills. Fills are scheduled in a simple round robin with identical time slices. Order and time-slices of the fill scheduling are not affected by the super period. Now on thread creation, two arguments, priority and quota are needed. If quota is 0, the new thread participates in CPU scheduling with a fill only. Otherwise he participates with both a claim and a fill. This concept dovetails nicely with Genodes quota based resource management as any process can grant subsets of its own CPU-time and priorities to its child without knowing the global means of CPU-time and priority. The commit also adds a run script that enables an automated unit test of the scheduler implementation. fix #1225 |
||
|---|---|---|
| .. | ||
| cpu_scheduler.run | ||
| double_list.run | ||
| env | ||
| nested_init.run | ||