当前位置: X-MOL 学术arXiv.cs.DC › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Optimized Memoryless Fair-Share HPC Resources Scheduling using Transparent Checkpoint-Restart Preemption
arXiv - CS - Distributed, Parallel, and Cluster Computing Pub Date : 2021-02-25 , DOI: arxiv-2102.12953
Kfir Zvi, Gal Oren

Common resource management methods in supercomputing systems usually include hard divisions, capping, and quota allotment. Those methods, despite their 'advantages', have some known serious disadvantages including unoptimized utilization of an expensive facility, and occasionally there is still a need to dynamically reschedule and reallocate the resources. Consequently, those methods involve bad supply-and-demand management rather than a free market playground that will eventually increase system utilization and productivity. In this work, we propose the newly Optimized Memoryless Fair-Share HPC Resources Scheduling using Transparent Checkpoint-Restart Preemption, in which the social welfare increases using a free-of-cost interchangeable proprietary possession scheme. Accordingly, we permanently keep the status-quo in regard to the fairness of the resources distribution while maximizing the ability of all users to achieve more CPUs and CPU hours for longer period without any non-straightforward costs, penalties or additional human intervention.

中文翻译:

使用透明检查点-重新启动抢占来优化无内存公平共享HPC资源调度

超级计算系统中常见的资源管理方法通常包括硬划分,上限和配额分配。这些方法尽管具有“优点”,但仍具有一些已知的严重缺点,包括未优化利用昂贵的设备,并且偶尔仍然需要动态地重新计划和重新分配资源。因此,这些方法涉及不良的供需管理,而不是自由市场,最终将提高系统利用率和生产率。在这项工作中,我们提出了使用透明检查点-重新启动抢占的新优化的无记忆公平共享HPC资源调度,其中使用免费的可互换专有所有权计划来提高社会福利。因此,
更新日期:2021-02-26
down
wechat
bug