Loading...
Please wait, while we are loading the content...
Similar Documents
The blacklisting memory scheduler: achieving high performance and fairness at low cost.
| Content Provider | CiteSeerX |
|---|---|
| Author | Subramanian, Lavanya Lee, Donghyuk Seshadri, Vivek Rastogi, Harsha Mutlu, Onur |
| Abstract | Abstract—In a multicore system, applications running on different cores interfere at main memory. This inter-application interference degrades overall system performance and unfairly slows down applications. Prior works have developed application-aware memory request schedulers to tackle this problem. State-of-the-art application-aware memory request schedulers prioritize memory requests of applications that are vulnerable to interfer-ence, by ranking individual applications based on their memory access characteristics and enforcing a total rank order. In this paper, we observe that state-of-the-art application-aware memory schedulers have two major shortcomings. First, ranking applications individually with a total order based on memory access characteristics leads to high hardware cost and complexity. Second, ranking can unfairly slow down applications that are at the bottom of the ranking stack. To overcome these |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Achieving High Performance Blacklisting Memory Scheduler Low Cost Memory Access Characteristic Prior Work Hardware Cost Individual Application Multicore System Main Memory Total Rank Order State-of-the-art Application-aware Memory Scheduler Memory Request Major Shortcoming Different Core State-of-the-art Application-aware Memory Request Scheduler Total Order Application-aware Memory Request Scheduler Ranking Stack |
| Content Type | Text |
