%K Interactive computer systems; Multiprocessing systems; Quality of service; Response time (computer systems), Earliest deadline first; Multi processor scheduling; Multiprocessor scheduling algorithms; Real-time tasks; Schedulability; Soft real time; Soft real-time systems; Uniprocessors, Real time systems
%X Soft real-time systems are systems that can tolerate deadline misses but at the expense of degradation in quality of service. Many of the Scheduling algorithms used to schedule real-time tasks in a multiprocessor soft real-time systems are extended from their uniprocessor counterparts such as Global Earliest Deadline First (G-EDF) and Least Laxity First (LLF). However such algorithms when extended to real-time multiprocessor scheduling achieve low schedulability rates. In this paper, we present an efficient real-time multiprocessor scheduling algorithm that achieves high schedulability rates compared to currently existing algorithms. Unlike the current algorithms which are known to be greedy, our proposed algorithm uses a semi-greedy criteria to schedule tasks. The simulation showed that the proposed algorithm misses few deadlines as well as achieves high schedulability rates compared to currently existing algorithms. © 2014 IEEE.
%L scholars4242
%J 2014 International Conference on Computer and Information Sciences, ICCOINS 2014 - A Conference of World Engineering, Science and Technology Congress, ESTCON 2014 - Proceedings
%O cited By 0; Conference of 2014 International Conference on Computer and Information Sciences, ICCOINS 2014 ; Conference Date: 3 June 2014 Through 5 June 2014; Conference Code:112912
%R 10.1109/ICCOINS.2014.6868397
%D 2014
%I Institute of Electrical and Electronics Engineers Inc.
%A H. Alhussian
%A N. Zakaria
%A F.A. Hussin
%A H.T. Bahbouh
%T A semi greedy soft real-time multiprocessor scheduling algorithm