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

Efficient scheduling with adaptive fault tolerance in heterogeneous multiprocessor systems

Publication Type:

Conference/Workshop Paper

Venue:

International Conference on Computer and Electrical Engineering (ICCEE)


Abstract

Heterogeneous multiprocessor systems are becoming more common and scheduling real-time tasks on them is an extremely challenging research problem. While the stringent functional and timing requirements are to be met, this problem becomes even more difficult in dynamic environments, for example, caused by processor failures. Furthermore, in safety critical applications having tasks with mixed criticality levels, guaranteeing adaptive fault tolerance to meet the reliability requirements adds another complex dimension. The key contribution of our research is a framework for task allocation and scheduling in the above context, which has a generic task model enabling task-level redundancy, a range of reconfiguration/task migration options during processor failures and definition of a set of performance metrics. We have addressed the issues of both timeliness and reliability under three different allocation strategies for a multiprocessor system with the feasibility check being performed using the well-known Rate Monotonic (RM) schedulability test. The algorithm presented in this paper, ensures that all required deadlines are met with efficient processor utilization under normal conditions and guarantees essential operations even during processor failures. In real-time multiprocessor systems used in safety critical applications, the proposed approach is expected to provide better utilization of resources and guarantees with respect to the system reliability. We demonstrate as well as evaluate the performance of our approach by simulation studies on task scheduling in heterogeneous multiprocessor environments.

Bibtex

@inproceedings{Chandran1924,
author = {Senthil Kumar Chandran and Radhamani Pillay and Radu Dobrin and Sasikumar Punnekkat},
title = {Efficient scheduling with adaptive fault tolerance in heterogeneous multiprocessor systems},
month = {November},
year = {2010},
booktitle = {International Conference on Computer and Electrical Engineering (ICCEE)},
url = {http://www.es.mdh.se/publications/1924-}
}