Data Cache Performance When Vector-Like Accesses Bypass the Cache

نویسندگان

  • Michael Nahas
  • W illiam Wulf
چکیده

A Stream Memory Controller, when added to a conventional memory hierarchy, routes vector-like accesses around the data cache. A memory system was simulated under these conditions and the data cache performance increased dramatically. The gain in performance was a result of the increased temporal locality of the access pattern. The access pattern also showed a decrease in spatial locality, making smaller cache lines nearly as effective as long ones. This research attempts to quantify the effect on the data cache when vector-like accesses are handled outside the cache system. We hypothesized that vector-like accesses took up large amounts of space in the cache, had poor temporal locality, and, therefore, would cause cache pollution. In the primary experiments, we removed the vector-like accesses from the cache system and saw cache performance increase. Additional experiments , which examined the causes of the increase in cache performance, provided evidence to support our hypothesis We wanted to examine a memory system where vector-like accesses bypass the cache because our research group has designed a piece of hardware called the Stream Memory Controller (SMC) [7,9] which can increase the speed of vector-like memory accesses which go directly to DRAM. Since previous research [8] had studied the effect of the SMC on the vector-like data, we needed to simulate the memory system where the

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Method to Improve the Estimated Worst-Case Performance of Data Caching

This paper presents a method for tight prediction of worst-case performance of data caches in highperformance real-time systems. Our approach is to distinguish between data structures that exhibit a predictable versus unpredictable cache behavior. Cache performance of accesses to predictable data structures can be automatically and accurately determined by our method whereas we let accesses to ...

متن کامل

Characteristics of an On-Chip Cache on NEC SX Vector Architecture

Thanks to the highly effective memory bandwidth of the vector systems, they can achieve the high computation efficiency for computation-intensive scientific applications. However, they have been encountering the memory wall problem and the effective memory bandwidth rate has decreased, resulting in the decrease in the bytes per flop rates of recent vector systems from 4 (SX-7 and SX-8) to 2 (SX...

متن کامل

Reducing Memory Bandwidth for Chip- Multiprocessors using Cache Injection

Current and future high-performance systems will be constructed using multi-core chips. These systems impose higher demands to the memory system. Lack of adequate memory bandwidth will limit application performance. To reduce memory bandwidth we propose to use cache injection of incoming network messages. The objective of this work is to demonstrate benefits of cache injection and provide a bas...

متن کامل

Empirical Bounds on Data Caching in High- Performance Real-Time Systems

can be an order of magnitude longer than the best-case execution time; in the worst-case an instruction can result in two cache misses which can easily stall the processor for tens of cycles. At the same time, cache memories often handle a vast majority of all memory accesses in a single cycle. This has motivated us to develop methods to predict data cache behavior so as to provide tighter boun...

متن کامل

MadCache: A PC-aware Cache Insertion Policy

While the field of computer architecture is always looking for novel research directions to bring improved performance and efficiency, it is often simple improvements to more mature topics that have the most substantial impact. Cache replacement policy is one such research area, where innovations are highly sought after because of their direct improvement on performance. Furthermore, as chip-mu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997