ELECTRE: A language using control structure expressions to specify synchronization
ACM '85 Proceedings of the 1985 ACM annual conference on The range of computing : mid-80's perspective: mid-80's perspective
| Hi-index | 0.00 |
A new notation is introduced for representing real-time scheduling at the task and event level. These schedules are called control structures. The primary constructs included which direct the flow of control are sequencing, iteration, and preemption. Additional notation allows the representation of interrupt masking, task termination by external events, task restart as well as resumption from the finding point of preemption structure of a given control structure notation. The types of representable control structures are classified by the topology of their Control Flow Graphs. It is shown that although branching is allowed in the preemption structure, a tree shaped preemption structure cannot be represented. Both partial and total orderings of tasks and interrupt priorities are supported, however. A terminology for describing real-time properties of control structures is developed, and it is seen that without certain assumptions about task execution times and event timings, conclusions can''t be drawn regarding real-time performance of a control structure. A series of algorithms is presented which make use of these assumptions, and find values for task execution times in the presence of preemption. The algorithms can analyze control structures containing the principal control features; suggestions are given for further development of algorithms which can analyze any representable control structure.