is edf really a dynamic priority scheduling algorithm
Earliest deadline first scheduling Earliest deadline first (EDF) or least time to go is a dynamic scheduling algorithm used in real-time operating systems to place processes in a priority queue. Whenever a scheduling event occurs (task finishes, new task released, etc.) the queue will be searched for the process closest to its deadline. This process is the next to be scheduled for execution.
D-Day (military term) The terms D-Day and H-Hour are used for the day and hour on which a combat attack or operation is to be initiated. They designate the day and hour of the operation when the day and hour have not yet been determined, or where secrecy is essential. For a given operation, the same D-Day and H-Hour apply for all units participating in it. When used in combination with numbers, and plus or minus signs, these terms indicate the point of time preceding or following a specific action. Thus, H−3 means 3 hours before H-Hour, and D+3 means 3 days after D-Day. (By extension, H+75 minutes is used for H-Hour plus 1 hour and 15 minutes.) Planning papers for large-scale operations are made up in detail long before specific dates are set. Thus, orders are issued for the various steps to be carried out on the D-Day or H-Hour minus or plus a certain number of days, hours, or minutes. At the appropriate time, a subsequent order is issued that states the actual day and times.