Evaluation of Two Mixed-Criticality Scheduling Algorithm for Periodic Tasks

Shu Juan Huang; Yi An Zhu

doi:10.4028/www.scientific.net/AMM.513-517.1160

Paper Titles

Research on CAI Application Based on Information Technology
p.1139

Application of a Novel Data Mining Method Based on Wavelet Analysis and Chaotic Neural Network on Satellite Clock Bias Prediction
p.1144

The Embedded Display for Temperature Fields Reconstruction Based on Win CE
p.1150

Hierarchical Data Fusion in WSN Based on Mobile Agent
p.1154

Evaluation of Two Mixed-Criticality Scheduling Algorithm for Periodic Tasks
p.1160

Parameter Identification Method Research Based on the BP Neural Network and Space Search
p.1165

Bit Swap Established on EOC for VDSL
p.1170

The Improvement of DSR Protocol Based on Adaptive Sleep for Low Power Consumption Using in WBAN
p.1176

A Service Discovery Algorithm Based on Network Topology Management
p.1182

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 513-517Evaluation of Two Mixed-Criticality Scheduling...

Evaluation of Two Mixed-Criticality Scheduling Algorithm for Periodic Tasks

Abstract:

Nowadays, there are two approach in mixed-criticality scheduling. One is reservations-based approach such as EDF-VD(Earliest Deadline First-Virtual Deadline) and the Other is priority-based scheduling such as OCBP(Own Criticality Based Priority). This paper compared the two mixed-criticality scheduling algorithm from three aspects. The simulation results show that EDF-VD is better than OCBP in completed tasks and the system utilization, but in unmissed deadline ratio the later owns the better.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 513-517)

Pages:

1160-1164

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.513-517.1160

Citation:

Cite this paper

Online since:

February 2014

Authors:

Shu Juan Huang*, Yi An Zhu

Keywords:

Mixed-Criticality, Multi-Core, Priority, Real-Time Scheduling, Simulation

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] M. S. Mollison, et al., Mixed-Criticality Real-Time Scheduling for Multicore Systems, in Computer and Information Technology (CIT), 2010 IEEE 10th International Conference on, 2010, pp.1864-1871.

DOI: 10.1109/cit.2010.320

Google Scholar

[2] D. de Niz, et al., On the Scheduling of Mixed-Criticality Real-Time Task Sets, in Real-Time Systems Symposium, 2009, RTSS 2009. 30th IEEE, 2009, pp.291-300.

DOI: 10.1109/rtss.2009.46

Google Scholar

[3] R. M. Pathan, Schedulability Analysis of Mixed-Criticality Systems on Multiprocessors, in Real-Time Systems (ECRTS), 2012 24th Euromicro Conference on, 2012, pp.309-320.

DOI: 10.1109/ecrts.2012.29

Google Scholar

[4] A. Bastoni, et al., An Empirical Comparison of Global, Partitioned, and Clustered Multiprocessor EDF Schedulers, in Real-Time Systems Symposium (RTSS), 2010 IEEE 31st, 2010, pp.14-24.

DOI: 10.1109/rtss.2010.23

Google Scholar

[5] Alan A. Bertossi and A. Fusiello, Rate-Monotonic scheduling for hard-real-time systems, European Journal of Operational Research, vol. 96, pp.429-443, (1997).

DOI: 10.1016/s0377-2217(97)83306-1

Google Scholar

[6] S. Baruah, et al., Towards the Design of Certifiable Mixed-criticality Systems, in Real-Time and Embedded Technology and Applications Symposium (RTAS), 2010 16th IEEE, 2010, pp.13-22.

DOI: 10.1109/rtas.2010.10

Google Scholar

[7] S. Baruah, et al., Mixed-Criticality Scheduling of Sporadic Task SystemsAlgorithms – ESA 2011., vol. 6942, C. Demetrescu and M. Halldórsson, Eds., ed: Springer Berlin / Heidelberg, 2011, pp.555-566.

Google Scholar