Schedulability Analysis of periodic task of uniprocessor system on Real Time System

Abstract

A real time system is a system that must satisfy explicit bounded response-time constraints, otherwise risk severe consequences including failure. Failure happens when a system cannot satisfy one or more of the requirements laid out in the formal system specification. The problem of real-time scheduling spans a broad spectrum of algorithms from simple uniprocessor to highly sophisticated multiprocessor scheduling algorithms. In this project, we will study the characteristics and constraints of real-time tasks which should be scheduled to be executed. Analysis methods and the concept of optimality criteria, which leads to design appropriate scheduling algorithms, will also be addressed. Then, we study real-time scheduling algorithms for uniprocessor systems, which can be divided into two major classes: off-line and on-line. On-line algorithms are partitioned into either static or dynamic-priority based algorithms. We will observe both preemptive and non-preemptive static-priority based algorithms. For dynamic-priority based algorithms, we study the two subsets; namely, planning based and best effort scheduling algorithms. This project compares RM against EDF under several aspects, using existing theoretical results, specific simulation experiments, or simple counter examples to show that many common beliefs are either false or only restricted to specific situations.