Presents dispatching and scheduling algorithms for both periodic and aperiodic jobs on a cluster of computers. A cluster system consists of one front-end node, called dispatcher and multiple back-end nodes, called schedulers. By rigorous theoretical analysis, these algorithms are optimal in the sense that each aperiodic job can achieve the shortest response time in the cluster while maintaining the schedulability of periodic jobs. The aperiodic jobs, which have no deadline requirement, are partitioned into phases and assigned deadlines by the dispatcher With the deadlines the aperiodic jobs can be scheduled uniformly under EDF together with periodic jobs. Based on extensive simulation studies, we have that the algorithms proposed in the paper can achieve great performance improvement. We also work out the workload zone in which the response time of aperiodic jobs in the cluster with N schedulers is the same as the ideal bound of response time in the corresponding M/M/N model.
展开▼
机译：提出了针对计算机集群上的周期性和非周期性作业的调度和调度算法。集群系统由一个称为调度程序的前端节点和多个称为调度程序的后端节点组成。通过严格的理论分析，这些算法是最佳的，因为每个非周期性作业都可以在群集中实现最短的响应时间，同时又能保持定期作业的可调度性。调度员将没有期限要求的非周期性工作划分为多个阶段，并由调度员分配期限。利用该期限，可以在EDF下统一安排非周期性工作以及周期性的工作。在广泛的仿真研究基础上，我们认为本文提出的算法可以大大提高性能。我们还计算出工作负载区域，其中具有N个调度程序的集群中非周期性作业的响应时间与相应M / M / N模型中响应时间的理想范围相同。
展开▼
