Decoupled Sectored Caches

نویسنده

  • André Seznec
چکیده

Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for crating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Abstract Maintaining a low tag array size is a major issue in many cache designs. In the decoupled sectored cache we present in this paper, the monolithic association betwewen a cache block and a tag location is broken; the address tag location associated with a cache line location is dynamically chosen at fetch time among several possible locations. The hit ratio for a decoupled sectored cache is very close to the hit ratio for a non-sectored cache. Then a decoupled sectored cache will allow the same level of performance as a non-sectored cache, but at a signiicantly lower hardware cost.

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

ثبت نام

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

منابع مشابه

On the effectiveness of sectored caches in reducing false sharing misses

In this paper we study the eeectiveness of sectored caches in reducing false sharing misses on bus-based multiprocessors. In a sectored cache, each cache line is divided into several subblocks. A subblock is a basic coherence unit. When false sharing occurs, the involved cache line needs not be invalidated or transferred , as long as the corresponding subblocks are kept coherent. To facilitate ...

متن کامل

Decoupled Compressed Cache

In multicore processor systems, last-level caches (LLCs) play a crucial role in reducing system energy by i) filtering out expensive accesses to main memory and ii) reducing the time spent executing in high-power states. Cache compression can increase effective cache capacity and reduce misses, improve performance, and potentially reduce system energy. However, previous compressed cache designs...

متن کامل

S-GPBE: A Power-Efficient Broadcast Routing Algorithm Using Sectored Antenna

In our previous work, we presented a power-efficient algorithm called Greedy Perimeter Broadcast Efficiency (GPBE) algorithm exploiting broadcast efficiency using an omnidirectional antenna. We showed that with remarkably simple code complexity (not computational complexity), we could derive an algorithm which is comparable to Broadcast Incremental Power (BIP) in terms of the total transmit pow...

متن کامل

Downlink Scheduling and Resource Management for Best Effort Service in TDD-OFDMA Cellular Networks

Throughput performance and geographical service fairness of best effort service used for downlink of a 802.16e based TDD-OFDMA sectored cellular networks are evaluated in conjunction with different scheduling schemes and frequency reuse plans. The OFDM systems are based on two multiple access schemes, which are the OFDM-TDM and OFDMA, and considered scheduling schemes are round robin, max C/I, ...

متن کامل

Simplifying Hardware for Out Of Order Execution using the Decoupling Paradigm

Future hardware and software technology will try to provide improved performance by extracting higher levels of parallelism. However the cost of a main memory access-in terms of missed instruction issue slots-increases with faster processors and greater issue widths. For this reason latency hiding technology remains one of the most important parts of high performance processor designs. In this ...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:
  • IEEE Trans. Computers

دوره 46  شماره 

صفحات  -

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