利用可变时间量子改善抢占式轮询调度任务的等待时间
Improving Waiting Time of Tasks Scheduled Under Preemptive Round Robin Using Changeable Time Quantum
摘要：
最小化任务在队列中等待执行的时间是一个重要的调度准则，在抢占式任务调度中占有广泛的应用。本文提出了一种结合轮询算法的可变时间量子（Changeable Time Quantum，CTQ）方法，试图根据就绪队列中任务的突发次数来调整时间量子。使用（CTQ）方法有两个重要的好处：最小化任务的平均等待时间，从而最小化平均周转时间;保持上下文切换的数量尽可能少，从而最小化调度开销。在本文中，我们考虑抢占式任务的调度问题，这些任务的时间成本是已知的先验。我们的实验结果表明，CTQ可以提供更低的调度开销和更好的调度标准。
英文摘要：
Minimizing waiting time for tasks waiting in the queue for execution is one of the important scheduling cri-teria which took a wide area in scheduling preemptive tasks. In this paper we present Changeable Time Quan-tum (CTQ) approach combined with the round-robin algorithm, we try to adjust the time quantum according to the burst times of the tasks in the ready queue. There are two important benefits of using (CTQ) approach: minimizing the average waiting time of the tasks, consequently minimizing the average turnaround time, and keeping the number of context switches as low as possible, consequently minimizing the scheduling overhead. In this paper, we consider the scheduling problem for preemptive tasks, where the time costs of these tasks are known a priori. Our experimental results demonstrate that CTQ can provide much lower scheduling overhead and better scheduling criteria.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
