Schedulability analysis of task scheduling in multiprocessor real-time systems using EDF algorithm

Task scheduling in real-time systems is a concept by which we can schedule the tasks according to their priorities. In hard real-time systems, the task scheduling is more important due to the chance of system failure. We discuss EDF task scheduling which is an optimal technique for the uniprocessor systems. The existing result of the QPA algorithm was applied on the uniprocessor system to check the schedulability of the tasks in uniprocessor system. We have extended the QPA algorithm to check the schedulability of the task sets in multiprocessor systems. Our algorithm is based on QPA algorithm and the utilization balanced algorithm. The proposed algorithm checks the absolute deadlines much faster than the existing QPA algorithm for uniprocessor real-time systems.

I. INTRODUCTION

Real-time systems are important parts of our life now-a-days. In thelast few decades, there has been an eye catching growth in the count of real-timesystems, being used in domestic and industry production.