arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1809.08628cs.DC
收藏

多插槽多核服务器内存密集型工作负载的OS调度算法

OS Scheduling Algorithms for Memory Intensive Workloads in Multi-socket Multi-core servers

Murthy Durbhakula

摘要:

主要的芯片制造商都推出了多核微处理器。由这些处理器构建的多插槽系统通常用于运行各种服务器应用程序。根据系统上运行的应用程序,远程内存访问可能会影响整体性能。本文提出了一种新的操作系统(OS)调度优化,以减少这种远程内存访问的影响。通过观察每个调度量子中每个线程的本地和远程DRAM访问模式并应用不同的算法,我们为下一个量子提出了一个新的线程调度。这种新的调度可能会减少下一个调度量的远程DRAM访问,并提高整体性能。我们提出了三个这样的新算法的不同复杂度的算法,这是一个适应匈牙利算法。我们使用了三种不同的合成工作负载来评估算法。我们还对不同的DRAM延迟进行了敏感性分析。我们表明,这些算法可以减少DRAM访问延迟高达55%,这取决于所使用的算法。从算法中获得的好处取决于它们的复杂性。一般来说,复杂性越高,收益越高。匈牙利算法产生最优解。我们发现,四分之二的算法提供了一个很好的权衡性能和复杂性的工作负载,我们研究。

英文摘要:

Major chip manufacturers have all introduced multicore microprocessors. Multi-socket systems built from these processors are routinely used for running various server applications. Depending on the application that is run on the system, remote memory accesses can impact overall performance. This paper presents a new operating system (OS) scheduling optimization to reduce the impact of such remote memory accesses. By observing the pattern of local and remote DRAM accesses for every thread in each scheduling quantum and applying different algorithms, we come up with a new schedule of threads for the next quantum. This new schedule potentially cuts down remote DRAM accesses for the next scheduling quantum and improves overall performance. We present three such new algorithms of varying complexity followed by an algorithm which is an adaptation of Hungarian algorithm. We used three different synthetic workloads to evaluate the algorithm. We also performed sensitivity analysis with respect to varying DRAM latency. We show that these algorithms can cut down DRAM access latency by up to 55% depending on the algorithm used. The benefit gained from the algorithms is dependent upon their complexity. In general higher the complexity higher is the benefit. Hungarian algorithm results in an optimal solution. We find that two out of four algorithms provide a good trade-off between performance and complexity for the workloads we studied.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑