eprintid: 6457
rev_number: 2
eprint_status: archive
userid: 1
dir: disk0/00/00/64/57
datestamp: 2023-11-09 16:18:14
lastmod: 2023-11-09 16:18:14
status_changed: 2023-11-09 16:06:47
type: conference_item
metadata_visibility: show
creators_name: Alhussian, H.
creators_name: Zakaria, N.
creators_name: Abdulkadir, S.J.
creators_name: Fageeri, S.O.
title: Performance evaluation of real-time multiprocessor scheduling algorithms
ispublished: pub
keywords: 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
note: 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
abstract: 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.
date: 2016
publisher: Institute of Electrical and Electronics Engineers Inc.
official_url: https://www.scopus.com/inward/record.uri?eid=2-s2.0-85010457818&doi=10.1109%2fICCOINS.2016.7783233&partnerID=40&md5=ae58f5baac42336b6d4d080921cf71dd
id_number: 10.1109/ICCOINS.2016.7783233
full_text_status: none
publication: 2016 3rd International Conference on Computer and Information Sciences, ICCOINS 2016 - Proceedings
pagerange: 310-315
refereed: TRUE
isbn: 9781509051342
citation:   Alhussian, H. and Zakaria, N. and Abdulkadir, S.J. and Fageeri, S.O.  (2016) Performance evaluation of real-time multiprocessor scheduling algorithms.  In: UNSPECIFIED.