Studying the impact of hardware prefetching and bandwidth partitioning in chip-multiprocessors

Liu, Fang; Solihin, Yan

doi:10.1145/1993744.1993749

Cited by 31 publications

(10 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A major limitation of cache bypassing technique is, it could prove to be partially benefited as it already pollutes the cache, by replacing data once. Liu et al (2008), and Liu and Solihin (2011) aim to predict deadblocks based on bursts of accesses to a cache block rather than individual accesses. The work investigates references made to a cache line when it moves from MRU position to LRU position to predict deadblocks.…”

Section: Deadblock Predictions To Reduce Cache Contentionmentioning

confidence: 99%

“…• Prefetching and bandwidth partitioning: According to Moore's law, the quantity of transistors is doubling rapidly as compared to bandwidth which hardly grows 10 to 15%, it becomes challenging for bandwidth to handle the pressure due to increasing cores and leads to the âŁ˜bandwidth wall' crises. Exploiting the combined effect of prefetching and bandwidth partitioning Liu and Solihin (2011) propose a scheme that investigates prefetching conditions and describes a bandwidth partitioning policy coupled with the effects due to prefetching.…”

Section: Studying Impact Of Prefetching With Other Shared Resourcesmentioning

confidence: 99%

See 1 more Smart Citation

A review on shared resource contention in multicores and its mitigating techniques

Jain¹,

Surve²

2020

IJHPSA

View full text Add to dashboard Cite

Chip multiprocessor (CMP) systems have become inevitable to meet high computing demands. In such systems sharing of resources is imperative for better resource utilisation. The challenge arises when various application programs running on neighbouring cores compete for these resources concurrently and introduce contention. We aim to present in a simple, lucid and captivating manner a review of previous work on contention in multicores due to various shared resources like shared caches, main memory, memory bus bandwidth, prefetchers etc. The work investigates key ideas proposed by the research community to alleviate resource contention due to these various resources, under a single umbrella. The prime objective of the study is to throw light upon the fact that, alone a single shared component is not a dominant reason for performance degradation in CMPs, rather all elements in the memory hierarchy introduce resource contention thereby affecting performance cumulatively. The work presented would assist novice readers, researchers and academicians to further serve to propose optimal policies to address contention in designing multicore applications, considering the overall impact of these resources on the performance of multicore systems.

show abstract

Section: Deadblock Predictions To Reduce Cache Contentionmentioning

confidence: 99%

Section: Studying Impact Of Prefetching With Other Shared Resourcesmentioning

confidence: 99%

A review on shared resource contention in multicores and its mitigating techniques

Jain¹,

Surve²

2020

IJHPSA

View full text Add to dashboard Cite

show abstract

“…Regarding the NoC, some interesting approaches [21,22] implement virtual channels and dynamically adjust the priority between regular and prefetch requests coming from multiple cores. With respect to memory controller policies, recent proposals [23,24,25] have also focused on multicores. These policies take into account the prefetcher performance to dynamically select the priority of both regular and prefetch requests.…”

Section: Related Workmentioning

confidence: 99%

Efficient selective multicore prefetching under limited memory bandwidth

Selfa

Sahuquillo

Gómez

et al. 2018

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

Current multicore systems implement multiple hardware prefetchers to tolerate long main memory latencies. However, memory bandwidth is a scarce shared resource which becomes critical with the increasing core count. To deal with this fact, recent works have focused on adaptive prefetchers, which control the prefetcher aggressiveness to regulate the main memory bandwidth consumption. Nevertheless, in limited bandwidth machines or under memory-hungry workloads, keeping active the prefetcher can damage the system performance and increase energy consumption. This paper introduces selective prefetching, where individual prefetchers are activated or deactivated to improve both main memory energy and performance, and proposes ADP, a prefetcher that deactivates local prefetchers in some cores when they present low performance and co-runners need additional bandwidth. Based on heuristics, an individual prefetcher is reactivated when performance enhancements are foreseen. Compared to a state-of-the-art adaptive prefetcher, ADP provides both performance and energy enhancements in limited memory bandwidth.

show abstract

“…characterize cache pollution in the real system and propose a prefetch manager that controls the aggressiveness at runtime. Liu and Solihin [2011] propose an analytical model to study the interaction of hardware prefetching and bandwidth partitioning on a multicore system.…”

Section: Caffeine On Ghb Prefetchermentioning

confidence: 99%

Caffeine

Panda

Balachandran

2015

ACM Trans. Archit. Code Optim.

View full text Add to dashboard Cite

Aggressive prefetching improves system performance by hiding and tolerating off-chip memory latency. However, on a multicore system, prefetchers of different cores contend for shared resources and aggressive prefetching can degrade the overall system performance. The role of a prefetcher aggressiveness engine is to select appropriate aggressiveness levels for each prefetcher such that shared resource contention caused by prefetchers is reduced, thereby improving system performance. State-of-the-art prefetcher aggressiveness engines monitor metrics such as prefetch accuracy, bandwidth consumption, and last-level cache pollution. They use carefully tuned thresholds for these metrics, and when the thresholds are crossed, they trigger aggressiveness control measures. These engines have three major shortcomings: (1) thresholds are dependent on the system configuration (cache size, DRAM scheduling policy, and cache replacement policy) and have to be tuned appropriately, (2) there is no single threshold that works well across all the workloads, and (3) thresholds are oblivious to the phase change of applications. To overcome these shortcomings, we propose CAFFEINE, a model-based approach that analyzes the effectiveness of a prefetcher and uses a metric called net utility to control the aggressiveness. Our metric provides net processor cycles saved because of prefetching by approximating the cycles saved across the memory subsystem, from last-level cache to DRAM. We evaluate CAFFEINE across a wide range of workloads and compare it with the state-of-theart prefetcher aggressiveness engine. Experimental results demonstrate that, on average (geomean), CAFFEINE achieves 9.5% (as much as 38.29%) and 11% (as much as 20.7%) better performance than the best-performing aggressiveness engine for four-core and eight-core systems, respectively.

show abstract

Studying the impact of hardware prefetching and bandwidth partitioning in chip-multiprocessors

Cited by 31 publications

References 38 publications

A review on shared resource contention in multicores and its mitigating techniques

A review on shared resource contention in multicores and its mitigating techniques

Efficient selective multicore prefetching under limited memory bandwidth

Caffeine

Contact Info

Product

Resources

About