An unfair semi-greedy real-time multiprocessor scheduling algorithm

Hitham Alhussian, Nordin Zakaria, Ahmed Patel

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Most real-time multiprocessor scheduling algorithms for achieving optimal processor utilization, adhere to the fairness rule. Accordingly, tasks are executed in proportion to their utilizations at each time quantum or at the end of each time slice in a fluid schedule model. Obeying the fairness rule results in a large number of scheduling overheads, which affect the practicality of the algorithm. This paper presents a new algorithm for scheduling independent real-time tasks on multiprocessors, which produces very few scheduling overheads while maintaining high schedulability. The algorithm is designed by totally relaxing the fairness rule and adopting a new semi-greedy criterion instead. Simulations have shown promising results, i.e. the scheduling overheads generated by the proposed algorithm are significantly fewer than those generated by state-of-the-art algorithms. Although the proposed algorithm sometimes misses a few deadlines, these are sufficiently few to be tolerated in view of the considerable reduction achieved in the scheduling overheads.

Original languageEnglish
JournalComputers and Electrical Engineering
DOIs
Publication statusAccepted/In press - 20 Nov 2014
Externally publishedYes

Fingerprint

Scheduling algorithms
Scheduling
Fluids

Keywords

  • Migration
  • Multiprocessor
  • Preemption
  • Real-time
  • Scheduling
  • Semi-greedy

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering
  • Control and Systems Engineering

Cite this

An unfair semi-greedy real-time multiprocessor scheduling algorithm. / Alhussian, Hitham; Zakaria, Nordin; Patel, Ahmed.

In: Computers and Electrical Engineering, 20.11.2014.

Research output: Contribution to journalArticle

@article{fb7d1647b55f495e80075061d98df6c6,
title = "An unfair semi-greedy real-time multiprocessor scheduling algorithm",
abstract = "Most real-time multiprocessor scheduling algorithms for achieving optimal processor utilization, adhere to the fairness rule. Accordingly, tasks are executed in proportion to their utilizations at each time quantum or at the end of each time slice in a fluid schedule model. Obeying the fairness rule results in a large number of scheduling overheads, which affect the practicality of the algorithm. This paper presents a new algorithm for scheduling independent real-time tasks on multiprocessors, which produces very few scheduling overheads while maintaining high schedulability. The algorithm is designed by totally relaxing the fairness rule and adopting a new semi-greedy criterion instead. Simulations have shown promising results, i.e. the scheduling overheads generated by the proposed algorithm are significantly fewer than those generated by state-of-the-art algorithms. Although the proposed algorithm sometimes misses a few deadlines, these are sufficiently few to be tolerated in view of the considerable reduction achieved in the scheduling overheads.",
keywords = "Migration, Multiprocessor, Preemption, Real-time, Scheduling, Semi-greedy",
author = "Hitham Alhussian and Nordin Zakaria and Ahmed Patel",
year = "2014",
month = "11",
day = "20",
doi = "10.1016/j.compeleceng.2015.07.003",
language = "English",
journal = "Computers and Electrical Engineering",
issn = "0045-7906",
publisher = "Elsevier Limited",

}

TY - JOUR

T1 - An unfair semi-greedy real-time multiprocessor scheduling algorithm

AU - Alhussian, Hitham

AU - Zakaria, Nordin

AU - Patel, Ahmed

PY - 2014/11/20

Y1 - 2014/11/20

N2 - Most real-time multiprocessor scheduling algorithms for achieving optimal processor utilization, adhere to the fairness rule. Accordingly, tasks are executed in proportion to their utilizations at each time quantum or at the end of each time slice in a fluid schedule model. Obeying the fairness rule results in a large number of scheduling overheads, which affect the practicality of the algorithm. This paper presents a new algorithm for scheduling independent real-time tasks on multiprocessors, which produces very few scheduling overheads while maintaining high schedulability. The algorithm is designed by totally relaxing the fairness rule and adopting a new semi-greedy criterion instead. Simulations have shown promising results, i.e. the scheduling overheads generated by the proposed algorithm are significantly fewer than those generated by state-of-the-art algorithms. Although the proposed algorithm sometimes misses a few deadlines, these are sufficiently few to be tolerated in view of the considerable reduction achieved in the scheduling overheads.

AB - Most real-time multiprocessor scheduling algorithms for achieving optimal processor utilization, adhere to the fairness rule. Accordingly, tasks are executed in proportion to their utilizations at each time quantum or at the end of each time slice in a fluid schedule model. Obeying the fairness rule results in a large number of scheduling overheads, which affect the practicality of the algorithm. This paper presents a new algorithm for scheduling independent real-time tasks on multiprocessors, which produces very few scheduling overheads while maintaining high schedulability. The algorithm is designed by totally relaxing the fairness rule and adopting a new semi-greedy criterion instead. Simulations have shown promising results, i.e. the scheduling overheads generated by the proposed algorithm are significantly fewer than those generated by state-of-the-art algorithms. Although the proposed algorithm sometimes misses a few deadlines, these are sufficiently few to be tolerated in view of the considerable reduction achieved in the scheduling overheads.

KW - Migration

KW - Multiprocessor

KW - Preemption

KW - Real-time

KW - Scheduling

KW - Semi-greedy

UR - http://www.scopus.com/inward/record.url?scp=84937690973&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84937690973&partnerID=8YFLogxK

U2 - 10.1016/j.compeleceng.2015.07.003

DO - 10.1016/j.compeleceng.2015.07.003

M3 - Article

JO - Computers and Electrical Engineering

JF - Computers and Electrical Engineering

SN - 0045-7906

ER -