On 2013-08-17 23:18, Joel Sherrill wrote:
At first glance, this doesn't include any documentation
changes.
I added a short description:
* This is an implementation of the global job-level fixed priority scheduler
* (G-JLFP). It uses one ready chain per priority to ensure constant time
* insert operations. The scheduled chain uses linear insert operations and
* has at most processor count entries.
*
* The thread preempt mode will be ignored.
I will add more documentation later. At the moment I don't have time and
budget for this.
I also don't see exactly how this is different from the
Simple SMP Scheduler.
This is good. I did my best to avoid copy and paste.
Is it using the fifo per priority
and bitmap scheme like the Deterministic Priority
Scheduler?
Yes.
There needs to be more on the algorithm and how
it is unique.
--
Sebastian Huber, embedded brains GmbH
Address : Dornierstr. 4, D-82178 Puchheim, Germany
Phone : +49 89 189 47 41-16
Fax : +49 89 189 47 41-09
E-Mail : [email protected]
PGP : Public key available on request.
Diese Nachricht ist keine geschäftliche Mitteilung im Sinne des EHUG.
_______________________________________________
rtems-devel mailing list
[email protected]
http://www.rtems.org/mailman/listinfo/rtems-devel
