Compile-time preprocessing can be used to schedule systems of periodic tasks written in an Ada subset. Applied to a task system, this can both test feasibility and simplify runtime scheduling. This can be viewed as both a program verification technique and a more efficient implementation of Ada tasks. / Two models of Ada tasking are considered. Both consist of periodic Ada tasks with relative deadlines. The first model assumes that all rendezvous are determined at compile time (deterministic rendezvous) and allows arbitrary task start times. Task systems conforming to this model are transformed into systems of independent tasks allowing earliest deadline scheduling. The second model allows more Ada-like nondeterministic rendezvous but requires that all tasks start at the same time. Task systems conforming to this model are processed by enumerating equivalent systems with deterministic rendezvous until one is schedulable. The result in either case is a set of periodic independent tasks. These can be scheduled directly at runtime using the earliest deadline scheduling algorithm, or scheduling can be simulated at compile time to create a cyclic deterministic schedule. / The results of experimental studies of the preprocessing of Ada programs conforming to the nondeterministic rendezvous model are presented. The first study uses a simulation program which processes a skeletal Ada task system and prints out a valid schedule for it if one exists. The second involves implementing a program which translates Ada programs into executable deterministic task systems. / Source: Dissertation Abstracts International, Volume: 52-03, Section: B, page: 1544. / Major Professor: Theodore P. Baker. / Thesis (Ph.D.)--The Florida State University, 1991.
| Identifer | oai:union.ndltd.org:fsu.edu/oai:fsu.digital.flvc.org:fsu_76374 |
| Contributors | Giering, Edward William, III., Florida State University |
| Source Sets | Florida State University |
| Language | English |
| Detected Language | English |
| Type | Text |
| Format | 151 p. |
| Rights | On campus use only. |
| Relation | Dissertation Abstracts International |
Page generated in 0.0112 seconds