Scheduling with advanced reservations
Scheduling with advanced reservations
复制标题
DOI：
10.1109/ipdps.2000.845974
复制
发表时间：
2000-05
期刊：
影响因子：
--
通讯作者：
Warren Smith;Ian T Foster;V. Taylor
中科院分区：
文献类型：
--
作者：
Warren Smith;Ian T Foster;V. Taylor
一些计算网格应用程序具有非常大的资源需求，并且需要从多台并行计算机同时访问资源。当前的调度系统不提供在没有计算机系统的人工管理员的帮助的情况下获得这种同时访问的机制。在这项工作中，我们提出并评估了几种在超级计算调度系统中支持提前资源预留的算法。这些高级预订允许用户在特定时间向调度系统请求资源。我们发现，当支持预约时，提交到队列的申请的等待时间增加，并且增加的程度取决于如何支持预约。此外，我们发现，当我们假设应用程序可以终止和重新启动，执行回填，并使用相对准确的运行时预测时，可以获得最佳性能。
Some computational grid applications have very large resource requirements and need simultaneous access to resources from more than one parallel computer. Current scheduling systems do not provide mechanisms to gain such simultaneous access without the help of human administrators of the computer systems. In this work, we propose and evaluate several algorithms for supporting advanced reservation of resources in supercomputing scheduling systems. These advanced reservations allow users to request resources from scheduling systems at specific times. We find that the wait times of applications submitted to the queue increases when reservations are supported and the increase depends on how reservations are supported. Further, we find that the best performance is achieved when we assume that applications can be terminated and restarted, backfilling is performed, and relatively accurate run-time predictions are used.