%0 Conference Paper
%A Alhussian, H.
%A Zakaria, N.
%A Abdulkadir, S.J.
%A Fageeri, S.O.
%D 2016
%F scholars:6457
%I Institute of Electrical and Electronics Engineers Inc.
%K Evolutionary algorithms; Human computer interaction; Information science; Multiprocessing systems; Scheduling, Event-handlers; Local time; Multiprocessor scheduling algorithms; Optimal algorithm; Optimality; Real time algorithms; Real-world; Time spent, Scheduling algorithms
%P 310-315
%R 10.1109/ICCOINS.2016.7783233
%T Performance evaluation of real-time multiprocessor scheduling algorithms
%U https://khub.utp.edu.my/scholars/6457/
%X 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.
%Z cited By 1; Conference of 3rd International Conference on Computer and Information Sciences, ICCOINS 2016 ; Conference Date: 15 August 2016 Through 17 August 2016; Conference Code:125433