Advances in the computer technology encouraged the avionics industry to replace the federated design of control units with an integrated suite of control modules that share the computing resources. The new approach, which is called integrated modular avionics (IMA), can achieve substantial cost reduction in the development, operation and maintenance of airplanes. A set of guidelines has been developed by the avionics industry to facilitate the development and certification of integrated systems. Among them, a software architecture is recommended to address real time and fault tolerance requirements. According to the architecture, applications are classified into partitions supervised by an operating system executive. A general purpose application/executive (APEX) interface is defined which identifies the minimum functionality provided to the application software of an IMA system. To support the temporal partitioning between applications, APEX interface requires a deterministic cyclic scheduling of partitions at the O/S level and a fixed priority scheduling among processes within each partition. We propose a scheduling scheme for partitions in APEX. The scheme determines the frequency that each partition must be invoked and the assignment of processor capacity on every invocation. Then, a cyclic schedule at the O/S level can be constructed and all processes within each partition can meet their deadline requirements.
[1]
Andy J. Wellings,et al.
Analysing APEX applications
,
1996,
17th IEEE Real-Time Systems Symposium.
[2]
Lui Sha,et al.
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
,
1990,
IEEE Trans. Computers.
[3]
Chung Laung Liu,et al.
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
,
1989,
JACM.
[4]
John P. Lehoczky,et al.
Fixed priority scheduling of periodic task sets with arbitrary deadlines
,
1990,
[1990] Proceedings 11th Real-Time Systems Symposium.
[5]
Jane W.-S. Liu,et al.
Scheduling real-time applications in an open environment
,
1997,
Proceedings Real-Time Systems Symposium.
[6]
John P. Lehoczky,et al.
An optimal algorithm for scheduling soft-aperiodic tasks in fixed-priority preemptive systems
,
1992,
[1992] Proceedings Real-Time Systems Symposium.
[7]
Alan Burns,et al.
Hard Real-Time Scheduling: The Deadline-Monotonic Approach
,
1991
.
[8]
James W. Layland,et al.
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
,
1989,
JACM.
[9]
John P. Lehoczky,et al.
The rate monotonic scheduling algorithm: exact characterization and average case behavior
,
1989,
[1989] Proceedings. Real-Time Systems Symposium.