CVS difference for ai05s/ai05-0055-1.txt

Differences between 1.2 and version 1.3
Log of other versions for file ai05s/ai05-0055-1.txt

--- ai05s/ai05-0055-1.txt	2007/07/26 02:58:06	1.2
+++ ai05s/ai05-0055-1.txt	2007/10/09 19:27:15	1.3
@@ -1,4 +1,4 @@
-!standard D.2.6(26/2)                              07-06-12    AI05-0055-1/02
+!standard D.2.6(26/2)                              07-10-08    AI05-0055-1/03
 !class binding interpretation 07-05-15
 !status ARG Approved  10-0-2  07-06-01
 !status work item 07-05-15
@@ -33,7 +33,7 @@
 *  the highest priority P, if any, less than the base priority of T such 
    that one or more tasks are executing within a protected object with 
    ceiling priority P and task T has an earlier deadline than all such tasks;
-   and furthermore T has an an earlier deadline than all other tasks on
+   and furthermore T has an earlier deadline than all other tasks on
    ready queues with priorities in the given EDF_Across_Priorities range that
    are strictly less than P.
 
@@ -91,8 +91,8 @@
 behaviour required by Bakerís algorithm. Its current wording implies that 
 a task could be placed on a ready queue above one on which a task with a 
 shorter deadline is placed. Alan Burns described one scenario (the full 
-details are in their position paper [ADD REFERENCE/CITATION]) showing 
-that the current wording is not in full accordance with Baker's protocol.
+details are in their position paper) showing that the current wording
+is not in full accordance with Baker's protocol.
 
 Alan Burns then illustrated a simple rewording to 26/2 which makes the 
 rule stricter and achieves correct EDF dispatching in full adherence with 
@@ -113,10 +113,9 @@
 
 --end of workshop report extract
 
-Note: this present document is the AI referred to above.(It indicates 
-that Alan Burns was tasked to write this AI but for some reason Old John 
-has done it. Probably because he was supposed to be at the workshop and 
-chair the session concerned but unfortunately was sick.)
+This present document is the AI referred to above. Note that the ARG
+later improved the proposed wording, so the wording actually adopted
+is not the same as that proposed by the workshop.
 
 Baker's protocol is described in Stack-based scheduling of realtime 
 processes by T P Baker in Real-Time Systems 3(1), March 1991.
@@ -140,7 +139,7 @@
 @xbullet<the highest priority @i<P>, if any, less than the base priority of @i<T>
 such that one or more tasks are executing within a protected object with
 ceiling priority @i<P> and task @i<T> has an earlier deadline than all such tasks;
-and furthermore @i<T> has an an earlier deadline than all other tasks on
+and furthermore @i<T> has an earlier deadline than all other tasks on
 ready queues with priorities in the given EDF_Across_Priorities range that
 are strictly less than @i<P>.>
 

Questions? Ask the ACAA Technical Agent