Partitioned scheduling policies on multi-processor mixed-criticality systems

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

9 Scopus Citations
View graph of relations

Author(s)

  • Chuan-Cai Gu
  • Nan Guan
  • Jin-Ming Yu
  • Yi Wang
  • Qing-Xu Deng

Detail(s)

Original languageEnglish
Pages (from-to)284-297
Journal / PublicationRuan Jian Xue Bao/Journal of Software
Volume25
Issue number2
Publication statusPublished - Feb 2014
Externally publishedYes

Abstract

Multi-Core processors are more and more widely used in embedded systems as they provide great computing capacities to integrate multiple functionalities with different criticality levels into a shared platform. The scheduling problem of mixed-criticality systems appears to be challenging, even on single-processor platforms. This work extends the state-of-the-art single-processor mixed- criticality scheduling algorithm EY-VD to multi-processor systems. To begin with, it integrates EY-VD into traditional workload partitioning schemes to get a multiprocessor mixed-criticality scheduling algorithm MC-PEDF (mixed-criticality partitioned earliest deadline first). Although MC-PEDF performs better than previous solutions, the study finds that the traditional workload partitioning schemes are not suitable for mixed-criticality systems as it does not explore the asymmetricity of workload on different criticality levels. To overcome this problem, a workload partitioning policy OCOP (one criticality one partition) is proposed. OCOP allows tasks to be reassigned to a different processor when criticality mode switch occurs, thus can better balance the resource utilization among processors on different criticality levels. Based on OCOP, the second partitioned scheduling algorithm MC-MP-EDF (mixed-criticality multi- partitioned EDF) is constructed. Experiments with randomly generated workload show that MC-MP-EDF can drastically improve the system schedulability comparing with MC-PEDF and other previous algorithms, especially for systems with more processors. © Copyright 2014, Institute of Software, the Chinese Academy of Sciences. All rights reserved.

Research Area(s)

  • EDF (earliest deadline first), Mixed-criticality system, Multi-processor, Partitioned scheduling

Bibliographic Note

Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to lbscholars@cityu.edu.hk.

Citation Format(s)

Partitioned scheduling policies on multi-processor mixed-criticality systems. / Gu, Chuan-Cai; Guan, Nan; Yu, Jin-Ming; Wang, Yi; Deng, Qing-Xu.

In: Ruan Jian Xue Bao/Journal of Software, Vol. 25, No. 2, 02.2014, p. 284-297.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review