Logo

A semi greedy soft real-time multiprocessor scheduling algorithm

Alhussian, Hitham and Zakaria, Mohd Nordin and Hussin, Fawnizu Azmadi (2014) A semi greedy soft real-time multiprocessor scheduling algorithm. In: The International Conference on Computer and Information Sciences (ICCOINS), 3-5 June 2014, Kuala Lumpur Malaysia.

[img] PDF - Published Version
Restricted to Registered users only

254Kb

Abstract

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.

Item Type:Conference or Workshop Item (Paper)
Academic Subject One:Academic Department - Electrical And Electronics - Pervasisve Systems - Digital Electronics - Microprocessor
Departments / MOR / COE:Centre of Excellence > Center for Intelligent Signal and Imaging Research
ID Code:11971
Deposited By: Dr Fawnizu Azmadi Hussin
Deposited On:07 Oct 2016 01:42
Last Modified:19 Jan 2017 08:21

Repository Staff Only: item control page

Document Downloads

More statistics for this item...