<feed xmlns='http://www.w3.org/2005/Atom'>
<title>litmus-rt.git, branch wip-binary-heap</title>
<subtitle>The LITMUS^RT kernel.</subtitle>
<link rel='alternate' type='text/html' href='http://rtsrv.cs.unc.edu/cgit/cgit.cgi/litmus-rt.git/'/>
<entry>
<title>Make C-EDF work with simplified binheap_delete</title>
<updated>2012-03-21T23:25:02+00:00</updated>
<author>
<name>Glenn Elliott</name>
<email>gelliott@cs.unc.edu</email>
</author>
<published>2012-03-21T23:25:02+00:00</published>
<link rel='alternate' type='text/html' href='http://rtsrv.cs.unc.edu/cgit/cgit.cgi/litmus-rt.git/commit/?id=4be8ef609123d4b4d281976f6bf5e65024e66b0b'/>
<id>4be8ef609123d4b4d281976f6bf5e65024e66b0b</id>
<content type='text'>
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
</pre>
</div>
</content>
</entry>
<entry>
<title>Make GSN-EDF work with simlified binheap_delete()</title>
<updated>2012-03-21T23:24:13+00:00</updated>
<author>
<name>Glenn Elliott</name>
<email>gelliott@cs.unc.edu</email>
</author>
<published>2012-03-21T23:24:13+00:00</published>
<link rel='alternate' type='text/html' href='http://rtsrv.cs.unc.edu/cgit/cgit.cgi/litmus-rt.git/commit/?id=bf57086c9aa497c016efc208a0ceb66f262ab18b'/>
<id>bf57086c9aa497c016efc208a0ceb66f262ab18b</id>
<content type='text'>
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
</pre>
</div>
</content>
</entry>
<entry>
<title>Simplify binheap_delete and add binheap_decrease</title>
<updated>2012-03-21T23:21:46+00:00</updated>
<author>
<name>Glenn Elliott</name>
<email>gelliott@cs.unc.edu</email>
</author>
<published>2012-03-21T23:21:46+00:00</published>
<link rel='alternate' type='text/html' href='http://rtsrv.cs.unc.edu/cgit/cgit.cgi/litmus-rt.git/commit/?id=33f5fe82661086d27467821aaf418364774e360a'/>
<id>33f5fe82661086d27467821aaf418364774e360a</id>
<content type='text'>
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
</pre>
</div>
</content>
</entry>
<entry>
<title>C-EDF: Use binary heap instead of binomial heap.</title>
<updated>2012-03-21T20:44:54+00:00</updated>
<author>
<name>Glenn Elliott</name>
<email>gelliott@cs.unc.edu</email>
</author>
<published>2012-03-21T20:39:26+00:00</published>
<link rel='alternate' type='text/html' href='http://rtsrv.cs.unc.edu/cgit/cgit.cgi/litmus-rt.git/commit/?id=ee525fe7ba4edf4da2d293629ffdff2caa9ad02b'/>
<id>ee525fe7ba4edf4da2d293629ffdff2caa9ad02b</id>
<content type='text'>
Use binary heap for ordering priority of CPUs.
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
Use binary heap for ordering priority of CPUs.
</pre>
</div>
</content>
</entry>
<entry>
<title>GSN-EDF: Use binary heap instead of binomial heap.</title>
<updated>2012-03-21T20:44:08+00:00</updated>
<author>
<name>Glenn Elliott</name>
<email>gelliott@cs.unc.edu</email>
</author>
<published>2012-03-21T20:26:27+00:00</published>
<link rel='alternate' type='text/html' href='http://rtsrv.cs.unc.edu/cgit/cgit.cgi/litmus-rt.git/commit/?id=bdce67bc2babc2e5b3b2440964e9cf819ac814dc'/>
<id>bdce67bc2babc2e5b3b2440964e9cf819ac814dc</id>
<content type='text'>
Use binary heap to track CPU priorities.
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
Use binary heap to track CPU priorities.
</pre>
</div>
</content>
</entry>
<entry>
<title>Binary heap implementation</title>
<updated>2012-03-21T19:04:00+00:00</updated>
<author>
<name>Glenn Elliott</name>
<email>gelliott@cs.unc.edu</email>
</author>
<published>2012-03-21T18:59:52+00:00</published>
<link rel='alternate' type='text/html' href='http://rtsrv.cs.unc.edu/cgit/cgit.cgi/litmus-rt.git/commit/?id=5b73afc4eb1b0303cb92eb29a2ecc59c1db69537'/>
<id>5b73afc4eb1b0303cb92eb29a2ecc59c1db69537</id>
<content type='text'>
Motivation: Linux's prio_heap.h is of fixed size. Litmus's binomial
heap may be overkill (and perhaps not general enough) for some applications.

Implemented in the style of linked lists.
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
Motivation: Linux's prio_heap.h is of fixed size. Litmus's binomial
heap may be overkill (and perhaps not general enough) for some applications.

Implemented in the style of linked lists.
</pre>
</div>
</content>
</entry>
<entry>
<title>Typo in macro</title>
<updated>2012-02-17T00:13:16+00:00</updated>
<author>
<name>Jonathan Herman</name>
<email>hermanjl@cs.unc.edu</email>
</author>
<published>2012-02-17T00:13:16+00:00</published>
<link rel='alternate' type='text/html' href='http://rtsrv.cs.unc.edu/cgit/cgit.cgi/litmus-rt.git/commit/?id=6a00f206debf8a5c8899055726ad127dbeeed098'/>
<id>6a00f206debf8a5c8899055726ad127dbeeed098</id>
<content type='text'>
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
</pre>
</div>
</content>
</entry>
<entry>
<title>Feather-Trace: keep track of interrupt-related interference.</title>
<updated>2012-01-30T19:07:08+00:00</updated>
<author>
<name>Bjoern B. Brandenburg</name>
<email>bbb@cs.unc.edu</email>
</author>
<published>2012-01-24T08:36:12+00:00</published>
<link rel='alternate' type='text/html' href='http://rtsrv.cs.unc.edu/cgit/cgit.cgi/litmus-rt.git/commit/?id=83b11ea1c6ad113519c488853cf06e626c95a64d'/>
<id>83b11ea1c6ad113519c488853cf06e626c95a64d</id>
<content type='text'>
Increment a processor-local counter whenever an interrupt is handled.
This allows Feather-Trace to include a (truncated) counter and a flag
to report interference from interrupts. This could be used to filter
samples that were disturbed by interrupts.
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
Increment a processor-local counter whenever an interrupt is handled.
This allows Feather-Trace to include a (truncated) counter and a flag
to report interference from interrupts. This could be used to filter
samples that were disturbed by interrupts.
</pre>
</div>
</content>
</entry>
<entry>
<title>Litmus core: simplify np-section protocol</title>
<updated>2011-11-24T20:21:08+00:00</updated>
<author>
<name>Bjoern B. Brandenburg</name>
<email>bbb@cs.unc.edu</email>
</author>
<published>2011-07-28T05:15:58+00:00</published>
<link rel='alternate' type='text/html' href='http://rtsrv.cs.unc.edu/cgit/cgit.cgi/litmus-rt.git/commit/?id=5bd89a34d89f252619d83fef3c9325e24311389e'/>
<id>5bd89a34d89f252619d83fef3c9325e24311389e</id>
<content type='text'>
User a 32-bit word for all non-preemptive section flags.
Set the "please yield soon" flag atomically when
accessing it on remotely-scheduled tasks.
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
User a 32-bit word for all non-preemptive section flags.
Set the "please yield soon" flag atomically when
accessing it on remotely-scheduled tasks.
</pre>
</div>
</content>
</entry>
<entry>
<title>C-EDF: rename lock -&gt; cluster_lock</title>
<updated>2011-11-24T20:21:08+00:00</updated>
<author>
<name>Bjoern B. Brandenburg</name>
<email>bbb@cs.unc.edu</email>
</author>
<published>2011-07-27T02:03:18+00:00</published>
<link rel='alternate' type='text/html' href='http://rtsrv.cs.unc.edu/cgit/cgit.cgi/litmus-rt.git/commit/?id=81b8eb2ae452c241df9b3a1fb2116fa4d5adcb75'/>
<id>81b8eb2ae452c241df9b3a1fb2116fa4d5adcb75</id>
<content type='text'>
The macro lock conflicts with locking protocols...
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
The macro lock conflicts with locking protocols...
</pre>
</div>
</content>
</entry>
</feed>
