A semi greedy soft real-time multiprocessor scheduling algorithm
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...
| Main Authors: | Alhussian, H., Zakaria, N., Hussin, F.A., Bahbouh, H.T. |
|---|---|
| Format: | Conference or Workshop Item |
| Institution: | Universiti Teknologi Petronas |
| Record Id / ISBN-0: | utp-eprints.31211 / |
| Published: |
Institute of Electrical and Electronics Engineers Inc.
2014
|
| Online Access: |
https://www.scopus.com/inward/record.uri?eid=2-s2.0-84938792258&doi=10.1109%2fICCOINS.2014.6868397&partnerID=40&md5=e5043cab152cb910af9f840d8e13f81a http://eprints.utp.edu.my/31211/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: |
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. |
|---|