{"title":"多核混合关键系统中基于利用率和关键性的容错调度","authors":"Preeti Godabole, G. Bhole","doi":"10.1108/ijpcc-06-2022-0248","DOIUrl":null,"url":null,"abstract":"\nPurpose\nThe main purpose of the paper is timing analysis of mixed critical applications on the multicore system to identify an efficient task scheduling mechanism to achieve three main objectives improving schedulability, achieving reliability and minimizing the number of cores used. The rise in transient faults in embedded systems due to the use of low-cost processors has led to the use of fault-tolerant scheduling and mapping techniques.\n\n\nDesign/methodology/approach\nThe paper opted for a simulation-based study. The simulation of mixed critical applications, like air traffic control systems and synthetic workloads, is carried out using a litmus-real time testbed on an Ubuntu machine. The heuristic algorithms for task allocation based on utilization factors and task criticalities are proposed for partitioned approaches with multiple objectives.\n\n\nFindings\nBoth partitioned earliest deadline first (EDF) with the utilization-based heuristic and EDF-virtual deadline (VD) with a criticality-based heuristic for allocation works well, as it schedules the air traffic system with a 98% success ratio (SR) using only three processor cores with transient faults being handled by the active backup of the tasks. With synthetic task loads, the proposed criticality-based heuristic works well with EDF-VD, as the SR is 94%. The validation of the proposed heuristic is done with a global and partitioned approach of scheduling, considering active backups to make the system reliable. There is an improvement in SR by 11% as compared to the global approach and a 17% improvement in comparison with the partitioned fixed-priority approach with only three processor cores being used.\n\n\nResearch limitations/implications\nThe simulations of mixed critical tasks are carried out on a real-time kernel based on Linux and are generalizable in Linux-based environments.\n\n\nPractical implications\nThe rise in transient faults in embedded systems due to the use of low-cost processors has led to the use of fault-tolerant scheduling and mapping techniques.\n\n\nOriginality/value\nThis paper fulfills an identified need to have multi-objective task scheduling in a mixed critical system. The timing analysis helps to identify performance risks and assess alternative architectures used to achieve reliability in terms of transient faults.\n","PeriodicalId":43952,"journal":{"name":"International Journal of Pervasive Computing and Communications","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2023-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Utilization and criticality based fault-tolerant scheduling in multicore mixed critical systems\",\"authors\":\"Preeti Godabole, G. Bhole\",\"doi\":\"10.1108/ijpcc-06-2022-0248\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\\nPurpose\\nThe main purpose of the paper is timing analysis of mixed critical applications on the multicore system to identify an efficient task scheduling mechanism to achieve three main objectives improving schedulability, achieving reliability and minimizing the number of cores used. The rise in transient faults in embedded systems due to the use of low-cost processors has led to the use of fault-tolerant scheduling and mapping techniques.\\n\\n\\nDesign/methodology/approach\\nThe paper opted for a simulation-based study. The simulation of mixed critical applications, like air traffic control systems and synthetic workloads, is carried out using a litmus-real time testbed on an Ubuntu machine. The heuristic algorithms for task allocation based on utilization factors and task criticalities are proposed for partitioned approaches with multiple objectives.\\n\\n\\nFindings\\nBoth partitioned earliest deadline first (EDF) with the utilization-based heuristic and EDF-virtual deadline (VD) with a criticality-based heuristic for allocation works well, as it schedules the air traffic system with a 98% success ratio (SR) using only three processor cores with transient faults being handled by the active backup of the tasks. With synthetic task loads, the proposed criticality-based heuristic works well with EDF-VD, as the SR is 94%. The validation of the proposed heuristic is done with a global and partitioned approach of scheduling, considering active backups to make the system reliable. There is an improvement in SR by 11% as compared to the global approach and a 17% improvement in comparison with the partitioned fixed-priority approach with only three processor cores being used.\\n\\n\\nResearch limitations/implications\\nThe simulations of mixed critical tasks are carried out on a real-time kernel based on Linux and are generalizable in Linux-based environments.\\n\\n\\nPractical implications\\nThe rise in transient faults in embedded systems due to the use of low-cost processors has led to the use of fault-tolerant scheduling and mapping techniques.\\n\\n\\nOriginality/value\\nThis paper fulfills an identified need to have multi-objective task scheduling in a mixed critical system. The timing analysis helps to identify performance risks and assess alternative architectures used to achieve reliability in terms of transient faults.\\n\",\"PeriodicalId\":43952,\"journal\":{\"name\":\"International Journal of Pervasive Computing and Communications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2023-03-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Pervasive Computing and Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1108/ijpcc-06-2022-0248\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Pervasive Computing and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1108/ijpcc-06-2022-0248","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
Utilization and criticality based fault-tolerant scheduling in multicore mixed critical systems
Purpose
The main purpose of the paper is timing analysis of mixed critical applications on the multicore system to identify an efficient task scheduling mechanism to achieve three main objectives improving schedulability, achieving reliability and minimizing the number of cores used. The rise in transient faults in embedded systems due to the use of low-cost processors has led to the use of fault-tolerant scheduling and mapping techniques.
Design/methodology/approach
The paper opted for a simulation-based study. The simulation of mixed critical applications, like air traffic control systems and synthetic workloads, is carried out using a litmus-real time testbed on an Ubuntu machine. The heuristic algorithms for task allocation based on utilization factors and task criticalities are proposed for partitioned approaches with multiple objectives.
Findings
Both partitioned earliest deadline first (EDF) with the utilization-based heuristic and EDF-virtual deadline (VD) with a criticality-based heuristic for allocation works well, as it schedules the air traffic system with a 98% success ratio (SR) using only three processor cores with transient faults being handled by the active backup of the tasks. With synthetic task loads, the proposed criticality-based heuristic works well with EDF-VD, as the SR is 94%. The validation of the proposed heuristic is done with a global and partitioned approach of scheduling, considering active backups to make the system reliable. There is an improvement in SR by 11% as compared to the global approach and a 17% improvement in comparison with the partitioned fixed-priority approach with only three processor cores being used.
Research limitations/implications
The simulations of mixed critical tasks are carried out on a real-time kernel based on Linux and are generalizable in Linux-based environments.
Practical implications
The rise in transient faults in embedded systems due to the use of low-cost processors has led to the use of fault-tolerant scheduling and mapping techniques.
Originality/value
This paper fulfills an identified need to have multi-objective task scheduling in a mixed critical system. The timing analysis helps to identify performance risks and assess alternative architectures used to achieve reliability in terms of transient faults.