I you think that you may have misunderstood me. The algorithms were not really
relevant in my post but were stated merely as examples. The post was really directed
at the RT-Linux implementors or anybody who has knowledge of the RT-Linux scheduler
source code (rtl_sched.c), or even better, anybody who may have implemented a
scheduling module for RT-Linux.
I'm trying to gauge the risk and difficulty involved in implementing a scheduler for
my final year project. The project is a significant part of my degree in terms of
marks. To begin something and find it too problematic could be disastrous. The idea
for the project and the research done so far is entirely my own.
I study Software Engineering in England, not CS. The real-time content consists of
only one module this semester and is mainly geared towards real-time system
specification. At the current time I have no real-time industry experience so it is
difficult for me to talk on that level.
I think that Paul Koning explained scheduling better than I could. As for Deadline
Monotonic priority ordering, as far as I understand it, it is basically where the
process with the shortest deadline is assigned the highest priority. It could be used
in the situation where the process deadlines <= periods. Where the deadlines = periods
it is the same as Rate Monotonic. The issue of meeting deadlines is where a real-time
OS scheduler differs from a time-sharing OS scheduler.
Alastair.
--- [rtl] ---
To unsubscribe:
echo "unsubscribe rtl" | mail [EMAIL PROTECTED] OR
echo "unsubscribe rtl <Your_email>" | mail [EMAIL PROTECTED]
----
For more information on Real-Time Linux see:
http://www.rtlinux.org/~rtlinux/
