Integrated scheduling mechanism for fault-tolerant modular avionics systems

Yann-Hang Lee, Mohamed Younis, Jeff Zhou

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, we present an effective scheduling approach for a fault-tolerant IMA (Integrated Modular Avionics)-based system. The system architecture consists of connected cabinets that are made of multiple line replaceable modules, such as core processor and I/O modules. To provide fault tolerance, the system is incorporated with fault resilient capability and executes replicated tasks on different cabinets. Thus application output will be ready after a task processing stage and a consistency checking stage. To schedule the two-stage operations at task processing nodes and at the voter, we adopt fixed priority executives and investigate two priority assignment algorithms. Several experiments have been conducted to measure the success ratios of finding feasible schedules under various conditions. The evaluation results reveal a proper design space in which feasible schedules can be found easily.

Original languageEnglish (US)
Title of host publicationIEEE Aerospace Applications Conference Proceedings
Editors Anon
Place of PublicationLos Alamitos, CA, United States
PublisherIEEE Comp Soc
Pages21-29
Number of pages9
Volume4
StatePublished - 1998
Externally publishedYes
EventProceedings of the 1998 IEEE Aerospace Conference. Part 1 (of 5) - Snowmass at Aspen, CO, USA
Duration: Mar 21 1998Mar 28 1998

Other

OtherProceedings of the 1998 IEEE Aerospace Conference. Part 1 (of 5)
CitySnowmass at Aspen, CO, USA
Period3/21/983/28/98

Fingerprint

Avionics
Scheduling
Processing
Fault tolerance
Experiments

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Lee, Y-H., Younis, M., & Zhou, J. (1998). Integrated scheduling mechanism for fault-tolerant modular avionics systems. In Anon (Ed.), IEEE Aerospace Applications Conference Proceedings (Vol. 4, pp. 21-29). Los Alamitos, CA, United States: IEEE Comp Soc.

Integrated scheduling mechanism for fault-tolerant modular avionics systems. / Lee, Yann-Hang; Younis, Mohamed; Zhou, Jeff.

IEEE Aerospace Applications Conference Proceedings. ed. / Anon. Vol. 4 Los Alamitos, CA, United States : IEEE Comp Soc, 1998. p. 21-29.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Lee, Y-H, Younis, M & Zhou, J 1998, Integrated scheduling mechanism for fault-tolerant modular avionics systems. in Anon (ed.), IEEE Aerospace Applications Conference Proceedings. vol. 4, IEEE Comp Soc, Los Alamitos, CA, United States, pp. 21-29, Proceedings of the 1998 IEEE Aerospace Conference. Part 1 (of 5), Snowmass at Aspen, CO, USA, 3/21/98.
Lee Y-H, Younis M, Zhou J. Integrated scheduling mechanism for fault-tolerant modular avionics systems. In Anon, editor, IEEE Aerospace Applications Conference Proceedings. Vol. 4. Los Alamitos, CA, United States: IEEE Comp Soc. 1998. p. 21-29
Lee, Yann-Hang ; Younis, Mohamed ; Zhou, Jeff. / Integrated scheduling mechanism for fault-tolerant modular avionics systems. IEEE Aerospace Applications Conference Proceedings. editor / Anon. Vol. 4 Los Alamitos, CA, United States : IEEE Comp Soc, 1998. pp. 21-29
@inproceedings{14be380d8ea8499fb285c907033bc44c,
title = "Integrated scheduling mechanism for fault-tolerant modular avionics systems",
abstract = "In this paper, we present an effective scheduling approach for a fault-tolerant IMA (Integrated Modular Avionics)-based system. The system architecture consists of connected cabinets that are made of multiple line replaceable modules, such as core processor and I/O modules. To provide fault tolerance, the system is incorporated with fault resilient capability and executes replicated tasks on different cabinets. Thus application output will be ready after a task processing stage and a consistency checking stage. To schedule the two-stage operations at task processing nodes and at the voter, we adopt fixed priority executives and investigate two priority assignment algorithms. Several experiments have been conducted to measure the success ratios of finding feasible schedules under various conditions. The evaluation results reveal a proper design space in which feasible schedules can be found easily.",
author = "Yann-Hang Lee and Mohamed Younis and Jeff Zhou",
year = "1998",
language = "English (US)",
volume = "4",
pages = "21--29",
editor = "Anon",
booktitle = "IEEE Aerospace Applications Conference Proceedings",
publisher = "IEEE Comp Soc",

}

TY - GEN

T1 - Integrated scheduling mechanism for fault-tolerant modular avionics systems

AU - Lee, Yann-Hang

AU - Younis, Mohamed

AU - Zhou, Jeff

PY - 1998

Y1 - 1998

N2 - In this paper, we present an effective scheduling approach for a fault-tolerant IMA (Integrated Modular Avionics)-based system. The system architecture consists of connected cabinets that are made of multiple line replaceable modules, such as core processor and I/O modules. To provide fault tolerance, the system is incorporated with fault resilient capability and executes replicated tasks on different cabinets. Thus application output will be ready after a task processing stage and a consistency checking stage. To schedule the two-stage operations at task processing nodes and at the voter, we adopt fixed priority executives and investigate two priority assignment algorithms. Several experiments have been conducted to measure the success ratios of finding feasible schedules under various conditions. The evaluation results reveal a proper design space in which feasible schedules can be found easily.

AB - In this paper, we present an effective scheduling approach for a fault-tolerant IMA (Integrated Modular Avionics)-based system. The system architecture consists of connected cabinets that are made of multiple line replaceable modules, such as core processor and I/O modules. To provide fault tolerance, the system is incorporated with fault resilient capability and executes replicated tasks on different cabinets. Thus application output will be ready after a task processing stage and a consistency checking stage. To schedule the two-stage operations at task processing nodes and at the voter, we adopt fixed priority executives and investigate two priority assignment algorithms. Several experiments have been conducted to measure the success ratios of finding feasible schedules under various conditions. The evaluation results reveal a proper design space in which feasible schedules can be found easily.

UR - http://www.scopus.com/inward/record.url?scp=0031642141&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031642141&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0031642141

VL - 4

SP - 21

EP - 29

BT - IEEE Aerospace Applications Conference Proceedings

A2 - Anon, null

PB - IEEE Comp Soc

CY - Los Alamitos, CA, United States

ER -