aboutsummaryrefslogtreecommitdiffstats
path: root/tests
Commit message (Collapse)AuthorAge
* Add example code and related end-to-end tests.Jeremy Erickson2013-11-26
|
* Implement LP-based OMIP blocking analysisBjoern Brandenburg2013-07-12
|
* Fix broken demand calculationBjoern Brandenburg2013-05-22
| | | | | | | Felipe Cerqueira reported incorrect QPA results. The root cause was a corner case in the demand calculation. This patch fixes the underestimation of demand if time == deadline and adds a test case discovered by Felipe that triggered the bug.
* Make C++ and Python LP-based blocking bounds available in bounds.pyBjoern Brandenburg2013-02-12
| | | | | Use the faster C++ version if available, unless the caller specifically requested the Python implementation.
* Fix JLFP preemption-centric interrupt accountingBjoern Brandenburg2012-11-27
| | | | | | | | | | This patch fixes two bugs in the implementation of preemption-centric interrupt accounting. 1) When using dedicated interrupt-accounting, it there is a charged of oheads.release(n) required to model the delay due to the execution of the job's own release ISR. This bug was reported by Jeremy Erickson. 2) The definition of C_pre includes a divisor of 1.0 - utick - urel, which was missing. As a result, the impact of IRQ-related delays was somewhat underestimated.
* Add QPA EDF uniprocessor testBjoern Brandenburg2012-11-27
| | | | Based on Zhang and Burns (2009), "Schedulability Analysis for Real-Time Systems with EDF Scheduling", IEEE Transactions on Computers, Vol 58, No 9.
* TaskSystem.copy() should make deep copiesBjoern Brandenburg2012-11-24
| | | | | | Otherwise, the resource model will not be copied correctly, which can lead to wrong results if parameters are inflated to account for overheads.
* C++: Properly consider priority ceilings in DPCP boundBjoern Brandenburg2012-05-17
| | | | The bound should not reflect requests executed by agents that can be preempted.
* Add OMLP k-exclusion blocking boundsBjoern Brandenburg2012-02-20
|
* Add convenience wrapper to find_connected_components()Bjoern Brandenburg2012-02-20
|
* Add function to partition task set into connected componentsBjoern Brandenburg2012-02-20
|
* Import refactored schedcat codebaseBjoern Brandenburg2012-02-02
Based on the code available at http://www.cs.unc.edu/~bbb/diss, this is a cleaned-up version of schedcat intended to serve as the basis for all further development. Notable improvements: more unit tests and a cleaner module structure.