Priority-based joint EDF-RM scheduling algorithm for individual real-time task on distributed systems

Multiple tasks arrive in the distributed systems that can be executed in either parallel or sequential manner. Before the execution, tasks are scheduled prioritywise with the help of scheduling algorithms to their respective processors. For task assignment, every scheduling algorithm follows different protocols like upper bound of CPU utilization, assigning priorities, etc. In this paper, author has worked on such scheduling algorithms. Previously, the author evaluated the performance of algorithms on the basis of transactions (group of tasks). In this paper, the author re-evaluates joint EDF-RM scheduling algorithm, where its performance is calculated on the execution of individual task basis. For comparative analysis, similar algorithms are considered, i.e., joint EDF-RMS, earliest deadline first (EDF) and rate monotonic scheduling (RMS). These mentioned algorithms are simulated and analyzed with the help of statistical analysis, and turnaround time of periodic tasks is evaluated. Additionally, migration distribution and CPU utilization on the basis of scheduling algorithms' upper bounds are also calculated.