Scheduling algorithms for N-version programming scheme

Author

Abulnaja, O.A. ; Hosseini, S.H. ; Vairavan, K.

Author_Institution

Dept. of Comput. Sci., King Abdulaziz Univ., Jeddah, Saudi Arabia

fYear

1996

fDate

21-23 Aug 1996

Firstpage

184

Lastpage

189

Abstract

For critical computer applications, N-version Programming (NVP) is used for software fault tolerance. However, software redundancy which is employed in NVP results in system performance degradation. We propose software fault-tolerant scheduling policies based on both fully N-version programming and semi N-version programming models of computation. Further we study the performance of the system under the proposed scheduling policies

Keywords

processor scheduling; programming; redundancy; software fault tolerance; software performance evaluation; N-version programming scheme; critical computer applications; fully N-version programming; scheduling algorithms; semi N-version programming; software fault tolerance; software fault-tolerant scheduling policies; software redundancy; system performance degradation; Computational modeling; Computer science; Fault tolerance; Processor scheduling; Scheduling algorithm; Software performance; Software reliability; Software systems; System performance; Voting;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Software and Applications Conference, 1996. COMPSAC '96., Proceedings of 20th International

Conference_Location

Seoul

ISSN

0730-3157

Print_ISBN

0-8186-7579-9

Type

conf

DOI

10.1109/CMPSAC.1996.544161

Filename

544161