Talk:Earliest deadline first scheduling

This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing articles

Mid

This article has been rated as Mid-importance on the project's importance scale.

This article is supported by WikiProject Computer science (assessed as Mid-importance).

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Untitled

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)[reply]

- 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 representation, so it is only a question of the granularity of the clock of the system. --Koempy (talk) 15:00, 11 February 2008 (UTC)[reply]

- A link to a paper on "schedulability test" was added plus a note on the hazard of "deadline interchange" when shared resources are used. There is an entry on a paper dealing with "deadline scheduling with reneging" when heavy traffic occurs. EDF is equivalent to Least-Time-to-Go. Thus an additional link was added. SolarSauna (talk) 07:17, 8 March 2009 (UTC) SolarSauna, 2009 March 7 23:16 PST SolarSauna (talk) 07:47, 8 March 2009 (UTC)[reply]

Example

The example is too terse. What is meant by the "period" column in the table, for instance? zazpot (talk) 02:50, 22 April 2010 (UTC)[reply]