Time-triggered scheduling algorithms for mixed-criticality systems

Show simple item record

dc.contributor.author Behera, Lalatendu
dc.date.accessioned 2020-08-06T10:40:12Z
dc.date.available 2020-08-06T10:40:12Z
dc.date.issued 2019
dc.identifier.other ROLL NO.11610110
dc.identifier.uri http://gyan.iitg.ernet.in/handle/123456789/1532
dc.description Supervisor: Purandar Bhaduri en_US
dc.description.abstract Designing efficient scheduling algorithms which can be used to meet the certification requirements of safety-critical systems is challenging. Our research considers the time-triggered approach to scheduling of mixed-criticality jobs with two criticality levels. In the first contribution, we propose an algorithm which directly constructs two scheduling tables for the two criticality levels without using a priority order. Furthermore, we show that our algorithm schedules a strict superset of instances which can be scheduled by two current approaches -- the OCBP-based algorithm as well as by MCEDF. In the second contribution, we propose a time-triggered dynamic voltage and frequency scaling (DVFS) algorithm for uniprocessor mixed-criticality systems and show that our algorithm outperforms the predominant existing algorithms which use DVFS for such systems with respect to minimization of energy consumption. We prove an optimality result for the proposed algorithm with respect to energy consumption. Finally, we propose time-triggered scheduling algorithms for both independent and dependent mixed-criticality jobs on an identical multiprocessor platform. We show that our algorithm is more efficient than the Mixed criticality Priority Improvement (MCPI) algorithm, the only existing such algorithm for a multiprocessor platform. en_US
dc.language.iso en en_US
dc.relation.ispartofseries TH-2197;
dc.title Time-triggered scheduling algorithms for mixed-criticality systems en_US
dc.type Thesis en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record



My Account