-
- Hiroyuki Usui
- Carnegie Mellon University
-
- Lavanya Subramanian
- Carnegie Mellon University, Pittsburgh PA
-
- Kevin Kai-Wei Chang
- Carnegie Mellon University, Pittsburgh PA
-
- Onur Mutlu
- Carnegie Mellon University, Pittsburgh PA
書誌事項
- タイトル別名
-
- Deadline-Aware High-Performance Memory Scheduler for Heterogeneous Systems with Hardware Accelerators
- 公開日
- 2016-01-04
- 権利情報
-
- https://www.acm.org/publications/policies/copyright_policy#Background
- DOI
-
- 10.1145/2847255
- 公開者
- Association for Computing Machinery (ACM)
この論文をさがす
説明
<jats:p> Modern SoCs integrate multiple CPU cores and hardware accelerators (HWAs) that share the same main memory system, causing interference among memory requests from different agents. The result of this interference, if it is not controlled well, is missed deadlines for HWAs and low CPU performance. Few previous works have tackled this problem. State-of-the-art mechanisms designed for CPU-GPU systems strive to meet a target frame rate for GPUs by prioritizing the GPU close to the time when it has to complete a frame. We observe two major problems when such an approach is adapted to a heterogeneous CPU-HWA system. First, HWAs miss deadlines because they are prioritized <jats:italic>only when</jats:italic> close to their deadlines. Second, such an approach does <jats:italic>not</jats:italic> consider the diverse memory access characteristics of different applications running on CPUs and HWAs, leading to low performance for latency-sensitive CPU applications and deadline misses for some HWAs, including GPUs. </jats:p> <jats:p> In this article, we propose a Deadline-Aware memory Scheduler for Heterogeneous systems (DASH), which overcomes these problems using three key ideas, with the goal of meeting HWAs’ deadlines while providing high CPU performance. First, DASH prioritizes an HWA when it is not on track to meet its deadline <jats:italic>any time</jats:italic> during a deadline period, instead of prioritizing it only when close to a deadline. Second, DASH prioritizes HWAs over memory-intensive CPU applications based on the observation that memory-intensive applications’ performance is not sensitive to memory latency. Third, DASH treats short-deadline HWAs differently as they are more likely to miss their deadlines and schedules their requests based on worst-case memory access time estimates. </jats:p> <jats:p>Extensive evaluations across a wide variety of different workloads and systems show that DASH achieves significantly better CPU performance than the best previous scheduler while always meeting the deadlines for all HWAs, including GPUs, thereby largely improving frame rates.</jats:p>
収録刊行物
-
- ACM Transactions on Architecture and Code Optimization
-
ACM Transactions on Architecture and Code Optimization 12 (4), 1-28, 2016-01-04
Association for Computing Machinery (ACM)
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1361137043793268352
-
- DOI
- 10.1145/2847255
-
- ISSN
- 15443973
- 15443566
-
- データソース種別
-
- Crossref

