Back close

Optimizing resources in real-time scheduling for fault tolerant processors

Publication Type : Conference Paper

Publisher : PDGC

Source : 2010 1st International Conference on Parallel, Distributed and Grid Computing, PDGC - 2010, Solan, p.101-106 (2010)

Url :

ISBN : 9781424476725

Keywords : Computational task, Computing resource, Earliest deadline first, Enhanced performance, Fault tolerance, Fault-tolerant, Fault-tolerant mechanism, Generic features, Grid computing, Hardware and software, Launch vehicles, Launching, Medical equipment, Nuclear power plants, Offline, Onboard computer system, Optimization, Parallel processing systems, Performance metrics, Processor failures, Programming flexibility, Quality assurance, Rate-monotonic, Real time scheduling, Real-time tasks, Redundancy, Response time (computer systems), Safety critical applications, Safety critical systems, Satellite launch vehicles, Scheduling algorithms, System levels, System reliability, System resources, Task allocation

Campus : Coimbatore

School : School of Engineering

Department : Electrical and Electronics

Year : 2010

Abstract : The safety critical systems used in avionics, nuclear power plants and emergency medical equipments have to meet stringent reliability and temporal demands. Such demands are met with fault tolerant mechanisms, such as hardware and software redundancy. In this paper, we consider a safety critical application, the dual redundant onboard computer(OBC) system of the Indian Satellite Launch Vehicle and propose a scheme to optimize the onboard computing resources without detracting from the system reliability requirements. The redundancy is dealt with at the task allocation level and the slack generated, is used for allocation of more computational tasks, making the scheme very attractive in terms of efficient management of resources. The scheme of task allocation combined with real-time scheduling using Rate Monotonic(RM) and Earliest Deadline First(EDF) provide more programming flexibility and efficiently utilize the system resources. The scheme when implemented gives an efficient offline task allocation for fault-free conditions and flexible fault tolerance strategy during processor failure. The proposed scheme is compared with a traditional dual scheme. The implementation is experimented with a simulation and evaluated using performance metrics to illustrate the enhanced performance capability of the approach. This scheme, extended to multiprocessors with generic features can lead to tremendous throughput in terms of performance and costs. The contributions of this work are a system level algorithm for the implementation of real-time task allocation and scheduling. © 2010 IEEE.

Cite this Research Publication : Ra Pillay, Chandran, S. Kb, and Punnekkat, Sc, “Optimizing resources in real-time scheduling for fault tolerant processors”, in 2010 1st International Conference on Parallel, Distributed and Grid Computing, PDGC - 2010, Solan, 2010, pp. 101-106.

Admissions Apply Now