Name
Abstract | ||
|---|---|---|
With the massive advancement of fabrication technology in recent past, the attempt to execute all kinds of tasks on a shared, multicore platform has grown into a wide research area. The growth of safety-critical systems has resulted in a major design issue of maintaining tight timing constraints for safety-critical and mission-critical workloads. A mix of tasks with different criticalities are deployed in a system, called mixed-criticality system, and there exist various scheduling algorithms to meet the real-time constraints of such systems. This paper discusses a novel algorithm for scheduling mixed-criticality sporadic real-time jobs in a hard affinity multicore environment. The dynamic slack generated at run-time while executing jobs is used to schedule low criticality tasks without missing high criticality task deadlines. This work attempts to reduce the unproductive time and to increase the number of completed low criticality jobs without compromising any high criticality job execution. Experimental evaluation with synthetic benchmark suites shows 73.9% and 85.2% improvement in time utilization when compared with EDF-VD and CBEDF respectively.
|
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/DISTRA.2018.8600929 | DS-RT |
Keywords | Field | DocType |
mixed-criticality systems, multicore scheduling algorithm, sporadic task systems | Task analysis,Computer science,Scheduling (computing),Smiley,Mixed criticality,Schedule,Criticality,Multi-core processor,Distributed computing,Multicore systems | Conference |
ISSN | ISBN | Citations |
1550-6525 | 978-1-5386-5048-6 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alen Sabu | 1 | 0 | 0.34 |
| Biju K Raveendran | 2 | 2 | 5.10 |
| Rituparna Ghosh | 3 | 0 | 0.34 |