Talk:Earliest deadline first scheduling
From Wikipedia, the free encyclopedia
Reading this article (with some previous knowledge of real time systems) I think the article should benefit from explaining - why is the algorithm difficult to implement in hardware? What about software?
- what is meant by representing "deadlines in different ranges"?
- how can a deadline (which has the quantity of physical time) be rounded to bytes?
- what exactly is meant by insdustrial real-time systems? As opposed to what?
I myself is not capable of answering these questions. (That's why I read the article.) 19:09, 24 October 2007 (UTC)
There is a lot of missing informations : The necessary and sufficient conditions for instance, the maths behind, eventually also the proof of why EDF is optimal. Or references to those things. —Preceding unsigned comment added by 84.74.72.105 (talk) 17:21, 14 January 2008 (UTC)
- how can a deadline (which has the quantity of physical time) be rounded to bytes?
Time can be rounded, because every system has its own time represantation, so it is only a question of the granularity of the clock of the system. --Koempy (talk) 15:00, 11 February 2008 (UTC)