Contention-Free Scheduling for Mixed-Criticality Multiprocessor Real-Time System
Zero-laxity (ZL) and contention-free (CF) policies have received considerable attention owing to their simplicity and applicability to real-time systems equipped with symmetry multiprocessors. Recently, the ZL policy for mixed-criticality (MC) systems has been proposed and studied, but the applicabi...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2020-09-01
|
| Series: | Symmetry |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2073-8994/12/9/1515 |
| _version_ | 1797553732607541248 |
|---|---|
| author | Hyeongboo Baek Kilho Lee |
| author_facet | Hyeongboo Baek Kilho Lee |
| author_sort | Hyeongboo Baek |
| collection | DOAJ |
| description | Zero-laxity (ZL) and contention-free (CF) policies have received considerable attention owing to their simplicity and applicability to real-time systems equipped with symmetry multiprocessors. Recently, the ZL policy for mixed-criticality (MC) systems has been proposed and studied, but the applicability to and performance of the CF policy for MC systems have not been investigated yet. In this paper, we propose the CF policy (as a scheduling policy) for MC symmetry multiprocessor systems, referred to as the MC systems tailored CF policy (MC-CF), and a schedulability analysis in support thereof. We define the notion of contention-free slots for two different criticalities (of MC systems) of tasks, propose a technique to limit the amount to be utilized for each task by defining an upper bound, and subsequently explain the way in which the contention-free slots are systematically utilized to improve the schedulability of MC symmetry multiprocessor systems. Following this, we develop a deadline analysis (DA) for MC-CF. Using our experimental results under various environmental settings, we demonstrate that MC-CF can significantly improve the schedulability of fixed-priority scheduling. |
| first_indexed | 2024-03-10T16:20:46Z |
| format | Article |
| id | doaj.art-a364f37ba27c4c77a8bd3b6ae42bfbec |
| institution | Directory Open Access Journal |
| issn | 2073-8994 |
| language | English |
| last_indexed | 2024-03-10T16:20:46Z |
| publishDate | 2020-09-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Symmetry |
| spelling | doaj.art-a364f37ba27c4c77a8bd3b6ae42bfbec2023-11-20T13:44:11ZengMDPI AGSymmetry2073-89942020-09-01129151510.3390/sym12091515Contention-Free Scheduling for Mixed-Criticality Multiprocessor Real-Time SystemHyeongboo Baek0Kilho Lee1Department of Computer Science and Engineering, Incheon National University (INU), Incheon 22012, KoreaDepartment of Smart Systems Software, Soongsil University (SSU), Seoul 06978, KoreaZero-laxity (ZL) and contention-free (CF) policies have received considerable attention owing to their simplicity and applicability to real-time systems equipped with symmetry multiprocessors. Recently, the ZL policy for mixed-criticality (MC) systems has been proposed and studied, but the applicability to and performance of the CF policy for MC systems have not been investigated yet. In this paper, we propose the CF policy (as a scheduling policy) for MC symmetry multiprocessor systems, referred to as the MC systems tailored CF policy (MC-CF), and a schedulability analysis in support thereof. We define the notion of contention-free slots for two different criticalities (of MC systems) of tasks, propose a technique to limit the amount to be utilized for each task by defining an upper bound, and subsequently explain the way in which the contention-free slots are systematically utilized to improve the schedulability of MC symmetry multiprocessor systems. Following this, we develop a deadline analysis (DA) for MC-CF. Using our experimental results under various environmental settings, we demonstrate that MC-CF can significantly improve the schedulability of fixed-priority scheduling.https://www.mdpi.com/2073-8994/12/9/1515hard real-time systemsschedulabilityzero-laxity policysymmetry multiprocessor platformcontention-free |
| spellingShingle | Hyeongboo Baek Kilho Lee Contention-Free Scheduling for Mixed-Criticality Multiprocessor Real-Time System Symmetry hard real-time systems schedulability zero-laxity policy symmetry multiprocessor platform contention-free |
| title | Contention-Free Scheduling for Mixed-Criticality Multiprocessor Real-Time System |
| title_full | Contention-Free Scheduling for Mixed-Criticality Multiprocessor Real-Time System |
| title_fullStr | Contention-Free Scheduling for Mixed-Criticality Multiprocessor Real-Time System |
| title_full_unstemmed | Contention-Free Scheduling for Mixed-Criticality Multiprocessor Real-Time System |
| title_short | Contention-Free Scheduling for Mixed-Criticality Multiprocessor Real-Time System |
| title_sort | contention free scheduling for mixed criticality multiprocessor real time system |
| topic | hard real-time systems schedulability zero-laxity policy symmetry multiprocessor platform contention-free |
| url | https://www.mdpi.com/2073-8994/12/9/1515 |
| work_keys_str_mv | AT hyeongboobaek contentionfreeschedulingformixedcriticalitymultiprocessorrealtimesystem AT kilholee contentionfreeschedulingformixedcriticalitymultiprocessorrealtimesystem |