You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

Optimizing Resources in Real-time Scheduling for Fault Tolerant Processors

Note:

Acceptance ratio less than 22%

Publication Type:

Conference/Workshop Paper

Venue:

International Conference on Parallel, Distributed and Grid Computing (PGDC-2010)

Publisher:

IEEE

DOI:

http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5679598&tag=1


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.

Bibtex

@inproceedings{Pillay1927,
author = {Radhamani Pillay and Senthil Kumar Chandran and Sasikumar Punnekkat},
title = {Optimizing Resources in Real-time Scheduling for Fault Tolerant Processors},
note = {Acceptance ratio less than 22{\%}},
month = {October},
year = {2010},
booktitle = {International Conference on Parallel, Distributed and Grid Computing (PGDC-2010)},
publisher = {IEEE},
url = {http://www.es.mdu.se/publications/1927-}
}