Time-cost analysis of fault-tolerant parallel programs with timing constraints

Author

Srinivasan, A. ; Shoja, G.C.

Author_Institution

Dept. of Comput. Sci., Victoria Univ., BC, Canada

fYear

1995

fDate

17-19 May 1995

Firstpage

343

Lastpage

346

Abstract

We present a model for representing fault-tolerant parallel programs an a real-time shared memory system. We use time-cost modelling techniques to derive the condition for which a program´s deadline can be met. We apply a fault-tolerant mechanism based on imprecise computation technique and provide an algorithm for deciding when to sacrifice the result accuracy in order to meet the timing constraints of parallel programs. The performance of the system due to the use of fault-tolerance is also demonstrated

Keywords

multiprocessing programs; parallel programming; performance evaluation; real-time systems; shared memory systems; software fault tolerance; software performance evaluation; timing; algorithm; computation technique; fault-tolerant mechanism; fault-tolerant parallel programs; program deadline; real-time shared memory system; result accuracy; system performance; time-cost analysis; time-cost modelling; timing constraints; Computer science; Concurrent computing; Costs; Fault tolerance; Fault tolerant systems; Performance analysis; Real time systems; Time sharing computer systems; Timing; Upper bound;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, Computers, and Signal Processing, 1995. Proceedings., IEEE Pacific Rim Conference on

Conference_Location

Victoria, BC

Print_ISBN

0-7803-2553-2

Type

conf

DOI

10.1109/PACRIM.1995.519539

Filename

519539