多任务袋应用的非合作调度
Non-Cooperative Scheduling of Multiple Bag-of-Task Applications
摘要:
在异构平台上并发执行的多个应用程序竞争CPU和网络资源。在本文中,我们分析的行为$K$非合作的路由器使用的最佳策略,最大限度地提高他们的效率,同时在系统级的公平性,忽略应用程序的特点。我们限制我们的研究,简单的单级主工人平台的情况下,每个调度程序负责一个单一的应用程序组成的大量独立的任务。给定应用程序的任务都具有相同的计算和通信要求,但这些要求可能因应用程序而异。在这种情况下,我们假设每个调度器的目标是最大化其吞吐量。我们给出了这种系统所达到的平衡点的封闭形式的公式,并研究了它的性能。我们的特点的情况下,这个纳什均衡是最佳的(在帕累托意义上),并表明,即使没有灾难性的情况下(Braess悖论)可能会发生,这样的均衡可以任意坏的任何经典的性能指标。
英文摘要:
Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and network resources. In this paper we analyze the behavior of $K$ non-cooperative schedulers using the optimal strategy that maximize their efficiency while fairness is ensured at a system level ignoring applications characteristics. We limit our study to simple single-level master-worker platforms and to the case where each scheduler is in charge of a single application consisting of a large number of independent tasks. The tasks of a given application all have the same computation and communication requirements, but these requirements can vary from one application to another. In this context, we assume that each scheduler aims at maximizing its throughput. We give closed-form formula of the equilibrium reached by such a system and study its performance. We characterize the situations where this Nash equilibrium is optimal (in the Pareto sense) and show that even though no catastrophic situation (Braess-like paradox) can occur, such an equilibrium can be arbitrarily bad for any classical performance measure.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。