Processor Affinity based Multiprocessor Scheduling Algorithm for Soft Real-Time System

Authors

  • Ms. Jayna Donga, Dr. M.S. Holia

Abstract

Broadly almost all the multiprocessor real-time scheduling algorithms can be categorize into two types; 1) Global scheduling approach 2) Partitioned Approach which are application based. Now a days several real-time operating systems like QNX, VxWorks, LynxOS and real-time extension of Linux are applying the processor affinity concept for the real-time task scheduling which provides more flexibility instead of conventional approaches described in literature. By putting real-time task migration restrictions any scheduling algorithm can improve the cache performance of some tasks, load balancing between system components and isolation but it is having important downside that is it degrades over all schedulability of tasks. This paper presents the various cases of traditional processor affinity based scheduler which are largely limiting the schedulability of the tasks. In this paper, addressed the issues in existing approach and proposed a novel processor affinity based scheduler to improve the schedulability of the tasks by providing the flexible migration policy. The proposed scheduling algorithm improves the overall schedulability of the tasks as compared to traditional approaches of processor affinity based scheduler

Keywords- Affinity, Real-time system, Soft real-time System, Schedulability, Multiprocessor system

Published

2020-12-11

Issue

Section

Articles