Performance evaluation of real-time multiprocessor scheduling algorithms
In this paper, we present a performance evaluation of two real-time multiprocessor scheduling algorithms: Largest Remaining Execution-Time and Local time domain (LRE-TL) and Unfair Semi-Greedy (USG). The aim of this evolution is to reflect the unseen time overhead incurred by optimal real-time algor...
| Main Authors: | Alhussian, H., Zakaria, N., Abdulkadir, S.J., Fageeri, S.O. |
|---|---|
| Format: | Conference or Workshop Item |
| Institution: | Universiti Teknologi Petronas |
| Record Id / ISBN-0: | utp-eprints.30461 / |
| Published: |
Institute of Electrical and Electronics Engineers Inc.
2016
|
| Online Access: |
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85010457818&doi=10.1109%2fICCOINS.2016.7783233&partnerID=40&md5=ae58f5baac42336b6d4d080921cf71dd http://eprints.utp.edu.my/30461/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| id |
utp-eprints.30461 |
|---|---|
| recordtype |
eprints |
| spelling |
utp-eprints.304612022-03-25T06:53:45Z Performance evaluation of real-time multiprocessor scheduling algorithms Alhussian, H. Zakaria, N. Abdulkadir, S.J. Fageeri, S.O. In this paper, we present a performance evaluation of two real-time multiprocessor scheduling algorithms: Largest Remaining Execution-Time and Local time domain (LRE-TL) and Unfair Semi-Greedy (USG). The aim of this evolution is to reflect the unseen time overhead incurred by optimal real-time algorithm, represented by LRE-TL, which might hinder the claimed optimality of such algorithms when they are practically implemented. We hyave used the CPU profiler of Oracle JavaTM VisualVM to monitor the execution of LRE-TL as well as USG algorithms. The CPU profiler of JavaTM VisualVM measures the number of invocations of scheduling event handlers (procedures) in each algorithm as well as the total time spent in all invocations of this handler. The results of the CPU profiler showed that USG outperforms LRE-TL in-terms of the number of invocations of the scheduling handlers used by each algorithm as well as the time spent by the invocations. These results suggests that optimal algorithms may turn to be non-optimal when practically implemented, unlike USG which reveals far less scheduling overhead and hence could be practically implemented in real-world applications. © 2016 IEEE. Institute of Electrical and Electronics Engineers Inc. 2016 Conference or Workshop Item NonPeerReviewed https://www.scopus.com/inward/record.uri?eid=2-s2.0-85010457818&doi=10.1109%2fICCOINS.2016.7783233&partnerID=40&md5=ae58f5baac42336b6d4d080921cf71dd Alhussian, H. and Zakaria, N. and Abdulkadir, S.J. and Fageeri, S.O. (2016) Performance evaluation of real-time multiprocessor scheduling algorithms. In: UNSPECIFIED. http://eprints.utp.edu.my/30461/ |
| institution |
Universiti Teknologi Petronas |
| collection |
UTP Institutional Repository |
| description |
In this paper, we present a performance evaluation of two real-time multiprocessor scheduling algorithms: Largest Remaining Execution-Time and Local time domain (LRE-TL) and Unfair Semi-Greedy (USG). The aim of this evolution is to reflect the unseen time overhead incurred by optimal real-time algorithm, represented by LRE-TL, which might hinder the claimed optimality of such algorithms when they are practically implemented. We hyave used the CPU profiler of Oracle JavaTM VisualVM to monitor the execution of LRE-TL as well as USG algorithms. The CPU profiler of JavaTM VisualVM measures the number of invocations of scheduling event handlers (procedures) in each algorithm as well as the total time spent in all invocations of this handler. The results of the CPU profiler showed that USG outperforms LRE-TL in-terms of the number of invocations of the scheduling handlers used by each algorithm as well as the time spent by the invocations. These results suggests that optimal algorithms may turn to be non-optimal when practically implemented, unlike USG which reveals far less scheduling overhead and hence could be practically implemented in real-world applications. © 2016 IEEE. |
| format |
Conference or Workshop Item |
| author |
Alhussian, H. Zakaria, N. Abdulkadir, S.J. Fageeri, S.O. |
| spellingShingle |
Alhussian, H. Zakaria, N. Abdulkadir, S.J. Fageeri, S.O. Performance evaluation of real-time multiprocessor scheduling algorithms |
| author_sort |
Alhussian, H. |
| title |
Performance evaluation of real-time multiprocessor scheduling algorithms |
| title_short |
Performance evaluation of real-time multiprocessor scheduling algorithms |
| title_full |
Performance evaluation of real-time multiprocessor scheduling algorithms |
| title_fullStr |
Performance evaluation of real-time multiprocessor scheduling algorithms |
| title_full_unstemmed |
Performance evaluation of real-time multiprocessor scheduling algorithms |
| title_sort |
performance evaluation of real-time multiprocessor scheduling algorithms |
| publisher |
Institute of Electrical and Electronics Engineers Inc. |
| publishDate |
2016 |
| url |
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85010457818&doi=10.1109%2fICCOINS.2016.7783233&partnerID=40&md5=ae58f5baac42336b6d4d080921cf71dd http://eprints.utp.edu.my/30461/ |
| _version_ |
1741197410348040192 |
| score |
11.62408 |