有效处理紧急作业-加快计算应用程序的调度
Effective Handling of Urgent Jobs - Speed Up Scheduling for Computing Applications
摘要：
当服务提供商无法处理超时到达的作业时，就需要使用队列。在一个高度灵活和动态的环境中，一些作业可能需要在运行时更快地执行，特别是当资源有限且作业正在竞争获取资源时。用户可能会要求在运行时间加速队列中的某些作业（减少等待时间）。在这种情况下，需要在队列中存在的其他作业之前加速（直接将作业发送到服务器）紧急作业（请求加速），以便更早地完成紧急作业。在没有额外资源的假设下，作业的这种加速将导致队列中存在的其他作业的减慢。在本文中，我们制定了问题的加速调度，而不需要获得任何额外的资源，调度的在线加速请求所构成的用户在运行时，目前的算法相同。我们将加速调度的思想应用到两个不同的领域-Web调度和CPU调度。我们展示了我们的结果与模拟为基础的模型，使用跟踪驱动的工作负载和合成数据集，以显示加速调度的有用性。加速算法为解决紧急任务提供了一种新的方法，为调度算法的比较提供了一种不同的评价标准，具有实际应用价值。
英文摘要：
A queue is required when a service provider is not able to handle jobs arriving over the time. In a highly flexible and dynamic environment, some jobs might demand for faster execution at run-time especially when the resources are limited and the jobs are competing for acquiring resources. A user might demand for speed up (reduced wait time) for some of the jobs present in the queue at run time. In such cases, it is required to accelerate (directly sending the job to the server) urgent jobs (requesting for speed up) ahead of other jobs present in the queue for an earlier completion of urgent jobs. Under the assumption of no additional resources, such acceleration of jobs would result in slowing down of other jobs present in the queue. In this paper, we formulate the problem of Speed Up Scheduling without acquiring any additional resources for the scheduling of on-line speed up requests posed by a user at run-time and present algorithms for the same. We apply the idea of Speed Up Scheduling to two different domains -Web Scheduling and CPU Scheduling. We demonstrate our results with a simulation based model using trace driven workload and synthetic datasets to show the usefulness of Speed Up scheduling. Speed Up provides a new way of addressing urgent jobs, provides a different evaluation criteria for comparing scheduling algorithms and has practical applications.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
