Simulation of Real Time Multiprocessor Static Scheduling Algorithms

Volume 7 Issue 1 July - December 2018

Research Paper

Simulation of Real Time Multiprocessor Static Scheduling Algorithms

Madhu Kumar Patnala* , R. Nagendra**

*_**Assistant Professor (SL), Center for VLSI & Embedded Systems, Sree Vidyanikethan Engineering College, Tirupati, Andhra Pradesh, India.

Patnala,M.K.,and Nagendra,R.(2018). Simulation of Real Time Multiprocessor Static Scheduling Algorithms. i-manager's Journal on Embedded Systems,7(1),30-36. https://doi.org/10.26634/jes.7.1.15134

Abstract

Real Time Systems are time bound systems. Their efficiency is dependent on logical correctness as well as strict timeframe within which they react to an event. Completion within deadline is stressed especially in hard real time systems. Modern embedded hardware implementations choose multiprocessor architectures to support multitasking. Multiprocessor scheduling problem can be broken down in terms of task to processor assignment prior to uniprocessor scheduling problem. Suitable task to processor allocation strategy to uniprocessor scheduling algorithms like RMA and EDF for developing multiprocessor scheduler can be combined. This paper demonstrates simulation of Utilization Balancing algorithm for EDF, Next-fit algorithm for RMA, Bin packing algorithms for EDF using C language and TORSCHE tool box for MATLAB. The Objective of this work is to analyze various static scheduling algorithms for usage in multiprocessor based embedded systems.