aboutsummaryrefslogtreecommitdiffstats
path: root/include/litmus/litmus.h
Commit message (Collapse)AuthorAge
* re-organize getters2008.3Bjoern B. Brandenburg2009-09-16
| | | | Stick get_release() to the rest of the bunch.
* litmus proc: add release_master interfaceBjoern B. Brandenburg2009-04-23
| | | | | Let user space set which CPU should handle releases. It is up to plugins to make use of this information.
* litmus core: provide central NO_CPU definitionBjoern B. Brandenburg2009-04-22
| | | | this removes a blatant case of copy&paste reuse
* Merge commit 'origin/master' into rtss09Bjoern B. Brandenburg2009-04-18
|\
| * litmus core: remove no longer used sorted lists codeBjoern B. Brandenburg2009-04-18
| | | | | | | | No plugin uses it anymore.
* | move task present flag from PFAIR to Litmus coreBjoern B. Brandenburg2009-04-02
|/ | | | | Other quantum-based plugins also require the present flag. Hence, move it to the core data structure
* LITMUS: export CPU stagger offsetBjoern B. Brandenburg2008-11-06
| | | | Let scheduler plugins inquire stagger offsets.
* litmus: provide rt task phase access macroBjoern B. Brandenburg2008-10-06
| | | | rationale: uniformity
* rt_domain: make release queue handling more efficientBjoern B. Brandenburg2008-09-11
| | | | | | | | | | | | | | Instead of having hrtimers for each task, we now have only one hrtimer per rt_domain. To-be-released tasks are grouped in mergable heaps and presented as a bunch on each release. This approach should allow us to reduce the worst-case overhead at hyperperiod boundaries significantly. 1) less hrtimer overhead 2) less calls to the active plugin 3) only one CPU handles releases at a time 4) (2) & (3) should bring down lock contention significantly
* make inclusion of SRP support optional2008.1Bjoern B. Brandenburg2008-07-01
| | | | we can disable it to improve performance when it is not needed
* don't include NP-Flag syscalls if config option is not selectedBjoern B. Brandenburg2008-07-01
|
* Use binomial heaps as priority queues.Bjoern B. Brandenburg2008-05-19
| | | | | | The list-based priority queues did not perform well on the Niagara T2000. This heap-based implementation should perform much faster when queues are long.
* add task_rt() macroBjoern B. Brandenburg2008-05-14
| | | | Make code more readable and shorter.
* LITMUS: improve coreBjoern B. Brandenburg2008-05-10
| | | | | - give TRACE() messages sequence numbers - remove a some old, unused cruft
* LITMUS: use no_rqlock_work to avoid ksoftirqd deadlockBjoern B. Brandenburg2008-05-02
| | | | | We can't use tasklets from within the scheduler. User no_rqlock_work instead.
* SRP: improve robustnessBjoern B. Brandenburg2008-05-01
| | | | | | | | The SRP implementation did not correctly address various suspension-related scenarios correctly. Now the need for SRP blocking is tested on each scheduling event. This ensures mutual exclusion under the SRP even in the face of unexpected suspensions, for example due to IO.
* update SRP implBjoern B. Brandenburg2008-05-01
| | | | This is the first step in cleaning up the SRP implementation.
* LITMUS CORE: Release jobs with hrtimersJohn M. Calandrino2008-04-30
| | | | John's proposal for how to release jobs with hrtimers.
* LITMUS 2008: Initial PortBjoern B. Brandenburg2008-02-13
This introduces the core changes ported from LITMUS 2007. The kernel seems to work under QEMU, but many bugs probably remain.
generated by cgit v1.2.2 (git 2.25.0) at 2025-04-23 16:09:38 -0400