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.

中文翻译：

---

分布式系统上单个实时任务的基于优先级的联合EDF-RM调度算法

多个任务到达分布式系统，可以以并行或顺序方式执行。在执行之前，任务在调度算法的帮助下被优先调度到它们各自的处理器。对于任务分配，每种调度算法遵循不同的协议，如CPU利用率上限、分配优先级等。在本文中，作者对此类调度算法进行了研究。之前，作者根据交易（任务组）来评估算法的性能。在本文中，作者重新评估了联合 EDF-RM 调度算法，其性能是在单个任务的执行基础上计算的。为了进行比较分析，考虑了类似的算法，即联合 EDF-RMS、最早期限优先（EDF）和速率单调调度（RMS）。在统计分析的帮助下对上述算法进行模拟和分析，并评估周期性任务的周转时间。此外，还计算了基于调度算法上限的迁移分布和 CPU 利用率。