首页> 外文期刊>ACM transactions on computer systems >Fairness via Source Throttling: A Configurable and High-Performance Fairness Substrate for Multicore Memory Systems
【24h】

Fairness via Source Throttling: A Configurable and High-Performance Fairness Substrate for Multicore Memory Systems

机译:通过源节流实现公平:一种用于多核存储系统的可配置和高性能公平基板

获取原文
获取原文并翻译 | 示例

摘要

Cores in chip-multiprocessors (CMPs) share multiple memory subsystem resources. If resource sharing is unfair, some applications can be delayed significantly while others are unfairly prioritized. Previous research proposed separate fairness mechanisms for each resource. Such resource-based fairness mechanisms implemented independently in each resource can make contradictory decisions, leading to low fairness and performance loss. Therefore, a coordinated mechanism that provides fairness in the entire shared memory system is desirable. This article proposes a new approach that provides fairness in the entire shared memory system, thereby eliminating the need for and complexity of developing fairness mechanisms for each resource. Our technique, Fairness via Source Throttling (FST), estimates unfairness in the entire memory system. If unfairness is above a system-software-set threshold, FST throttles down cores causing unfairness by limiting the number of requests they create and the frequency at which they do. As such, our source-based fairness control ensures fairness decisions are made in tandem in the entire memory system. FST enforces thread priorities/weights, and enables system-software to enforce different fairness objectives in the memory system. Our evaluations show that FST provides the best system fairness and performance compared to three systems with state-of-the-art fairness mechanisms implemented in both shared caches and memory controllers.
机译:芯片多处理器(CMP)中的内核共享多个内存子系统资源。如果资源共享不公平,则某些应用程序可能会严重延迟,而其他应用程序的优先级则会受到不公平的影响。先前的研究针对每种资源提出了单独的公平机制。在每种资源中独立实施的基于资源的公平机制可能会做出相互矛盾的决策,从而导致较低的公平性和性能损失。因此,期望在整个共享存储系统中提供公平的协调机制。本文提出了一种在整个共享内存系统中提供公平性的新方法,从而消除了为每种资源开发公平性机制的需求和复杂性。我们的技术,即通过源节流(FST)进行的公平性估计整个内存系统中的不公平性。如果不公平性超过系统软件设置的阈值,则FST会通过限制它们创建的请求数量和执行频率来抑制导致不公平性的内核。这样,我们基于源的公平性控制可确保在整个内存系统中串联做出公平性决定。 FST强制执行线程优先级/权重,并使系统软件能够在内存系统中强制执行不同的公平性目标。我们的评估表明,与在共享缓存和内存控制器中均实现了最新公平性机制的三个系统相比,FST提供了最佳的系统公平性和性能。

著录项

  • 来源
    《ACM transactions on computer systems》 |2012年第2期|p.7.1-7.35|共35页
  • 作者单位

    Department of Electrical and Computer Engineering, University of Texas at Austin;

    Department of Electrical and Computer Engineering, University of Texas at Austin;

    Department of Electrical and Computer Engineering, Carnegie Mellon University;

    Department of Electrical and Computer Engineering, University of Texas at Austin;

  • 收录信息 美国《科学引文索引》(SCI);美国《工程索引》(EI);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    chip-multiprocessors; memory system; fairness;

    机译:芯片多处理器;内存系统;公平;

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号