[LITMUS^RT] Ready for Staging: Binary Heap

[Björn Brandenburg]

On May 26, 2012, at 11:15 PM, Glenn Elliott wrote:
> 
> Attached is a cleaned up version of the binary heap patch.  It incorporates the recommended changes (from several months ago).  The formatting errors should be resolved as well.  Also, sched_cedf and sched_gedf do NOT use binheap to replace their use of binomial heaps to order the priorities of scheduled CPUs.  I still believe that replacing binomial heaps with binary heaps would be more efficient.  However, with a relatively small number of CPUs, I think a sorted linked list or even flat array would be even better.  Implementing this could make a good "Intro-to-Litmus" exercise.
> 
> The patch is available in the "wip-stage-binheap" branch on rtserv.cs.unc.edu.  Jonathan/Björn, please merge this into UNC's/MPI's staging branch as appropriate.


Thanks for the patch. Merged into staging.

- Björn