https://www.mdu.se/

mdu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Efficient scheduling with adaptive fault tolerance in heterogeneous multiprocessor systems
Mälardalen University, School of Innovation, Design and Engineering.
Mälardalen University, School of Innovation, Design and Engineering.
Mälardalen University, School of Innovation, Design and Engineering.ORCID iD: 0000-0003-4157-3537
Mälardalen University, School of Innovation, Design and Engineering.ORCID iD: 0000-0001-5269-3900
2010 (English)In: International Conference on Computer and Electrical Engineering (ICCEE), Chengdu, China, 2010Conference paper, Published paper (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
Chengdu, China, 2010.
Identifiers
URN: urn:nbn:se:mdh:diva-10873OAI: oai:DiVA.org:mdh-10873DiVA, id: diva2:369212
Available from: 2010-11-10 Created: 2010-11-10 Last updated: 2013-12-03Bibliographically approved

Open Access in DiVA

No full text in DiVA

Authority records

Dobrin, RaduPunnekkat, Sasikumar

Search in DiVA

By author/editor
Chandran, Senthil KumarPillay, RadhamaniDobrin, RaduPunnekkat, Sasikumar
By organisation
School of Innovation, Design and Engineering

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 264 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf