Performance evaluation of real-time multiprocessor scheduling algorithms

• Main Authors: Alhussian, H., Zakaria, N., Abdulkadir, S.J., Fageeri, S.O.
• Format: Conference or Workshop Item
• 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/
• Institution: Universiti Teknologi Petronas

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.