Dynamic priority real-time scheduling on power asymmetric multicore processors
The use of real-time systems is growing at an increasing rate. This raises the power efficiency as the main challenge for system designers. Power asymmetric multicore processors provide a power-efficient platform for building complex real-time systems. The utilization of this efficient platform can...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English English |
| Published: |
Multidisciplinary Digital Publishing Institute (MDPI)
2021
|
| Subjects: | |
| Online Access: | https://eprints.ums.edu.my/id/eprint/33106/1/Dynamic%20priority%20real-time%20scheduling%20on%20power%20asymmetric%20multicore%20processors.pdf https://eprints.ums.edu.my/id/eprint/33106/2/Dynamic%20priority%20real-time%20scheduling%20on%20power%20asymmetric%20multicore%20processors%20_ABSTRACT.pdf |
| _version_ | 1796911349477933056 |
|---|---|
| author | Basharat Mahmood Naveed Ahmad Majid Iqbal Khan Adnan Akhunzada |
| author_facet | Basharat Mahmood Naveed Ahmad Majid Iqbal Khan Adnan Akhunzada |
| author_sort | Basharat Mahmood |
| collection | UMS |
| description | The use of real-time systems is growing at an increasing rate. This raises the power efficiency as the main challenge for system designers. Power asymmetric multicore processors provide a power-efficient platform for building complex real-time systems. The utilization of this efficient platform can be further enhanced by adopting proficient scheduling policies. Unfortunately, the research on real-time scheduling of power asymmetric multicore processors is in its infancy. In this research, we have addressed this problem and added new results. We have proposed a dynamic-priority semi-partitioned algorithm named: Earliest-Deadline First with C=D Task Splitting (EDFwC=D-TS) for scheduling real-time applications on power asymmetric multicore processors. EDFwC=D-TS outclasses its counterparts in terms of system utilization. The simulation results show that EDFwC=D-TS schedules up to 67% more tasks with heavy workloads. Furthermore, it improves the processor utilization up to 11% and on average uses 14% less cores to schedule the given workload. |
| first_indexed | 2024-03-06T03:17:28Z |
| format | Article |
| id | ums.eprints-33106 |
| institution | Universiti Malaysia Sabah |
| language | English English |
| last_indexed | 2024-03-06T03:17:28Z |
| publishDate | 2021 |
| publisher | Multidisciplinary Digital Publishing Institute (MDPI) |
| record_format | dspace |
| spelling | ums.eprints-331062022-07-12T01:21:04Z https://eprints.ums.edu.my/id/eprint/33106/ Dynamic priority real-time scheduling on power asymmetric multicore processors Basharat Mahmood Naveed Ahmad Majid Iqbal Khan Adnan Akhunzada QA71-90 Instruments and machines The use of real-time systems is growing at an increasing rate. This raises the power efficiency as the main challenge for system designers. Power asymmetric multicore processors provide a power-efficient platform for building complex real-time systems. The utilization of this efficient platform can be further enhanced by adopting proficient scheduling policies. Unfortunately, the research on real-time scheduling of power asymmetric multicore processors is in its infancy. In this research, we have addressed this problem and added new results. We have proposed a dynamic-priority semi-partitioned algorithm named: Earliest-Deadline First with C=D Task Splitting (EDFwC=D-TS) for scheduling real-time applications on power asymmetric multicore processors. EDFwC=D-TS outclasses its counterparts in terms of system utilization. The simulation results show that EDFwC=D-TS schedules up to 67% more tasks with heavy workloads. Furthermore, it improves the processor utilization up to 11% and on average uses 14% less cores to schedule the given workload. Multidisciplinary Digital Publishing Institute (MDPI) 2021 Article PeerReviewed text en https://eprints.ums.edu.my/id/eprint/33106/1/Dynamic%20priority%20real-time%20scheduling%20on%20power%20asymmetric%20multicore%20processors.pdf text en https://eprints.ums.edu.my/id/eprint/33106/2/Dynamic%20priority%20real-time%20scheduling%20on%20power%20asymmetric%20multicore%20processors%20_ABSTRACT.pdf Basharat Mahmood and Naveed Ahmad and Majid Iqbal Khan and Adnan Akhunzada (2021) Dynamic priority real-time scheduling on power asymmetric multicore processors. Symmetry, 13 (1488). pp. 1-26. ISSN 2073-8994 https://www.mdpi.com/2073-8994/13/8/1488/htm https://doi.org/10.3390/sym13081488 https://doi.org/10.3390/sym13081488 |
| spellingShingle | QA71-90 Instruments and machines Basharat Mahmood Naveed Ahmad Majid Iqbal Khan Adnan Akhunzada Dynamic priority real-time scheduling on power asymmetric multicore processors |
| title | Dynamic priority real-time scheduling on power asymmetric multicore processors |
| title_full | Dynamic priority real-time scheduling on power asymmetric multicore processors |
| title_fullStr | Dynamic priority real-time scheduling on power asymmetric multicore processors |
| title_full_unstemmed | Dynamic priority real-time scheduling on power asymmetric multicore processors |
| title_short | Dynamic priority real-time scheduling on power asymmetric multicore processors |
| title_sort | dynamic priority real time scheduling on power asymmetric multicore processors |
| topic | QA71-90 Instruments and machines |
| url | https://eprints.ums.edu.my/id/eprint/33106/1/Dynamic%20priority%20real-time%20scheduling%20on%20power%20asymmetric%20multicore%20processors.pdf https://eprints.ums.edu.my/id/eprint/33106/2/Dynamic%20priority%20real-time%20scheduling%20on%20power%20asymmetric%20multicore%20processors%20_ABSTRACT.pdf |
| work_keys_str_mv | AT basharatmahmood dynamicpriorityrealtimeschedulingonpowerasymmetricmulticoreprocessors AT naveedahmad dynamicpriorityrealtimeschedulingonpowerasymmetricmulticoreprocessors AT majidiqbalkhan dynamicpriorityrealtimeschedulingonpowerasymmetricmulticoreprocessors AT adnanakhunzada dynamicpriorityrealtimeschedulingonpowerasymmetricmulticoreprocessors |