Sunday, 05.19.2024, 10:21 AM
You're Welcome to our world Guest

Luckyfem Computer and Technological Insititute (Advancing Technology around the world)

Join me on facebook
Main » 2013 » January » 25 » Register versus Cache(Main memroy)
6:41 PM
Register versus Cache(Main memroy)
Abstract
In current computer memory system hierarchy,
registers and cache are both used to bridge
the reference delay gap between the fast
processor(s) and the slow main memory. While
registers are managed by the compiler using program
flow analysis, cache is mainly controlled by
hardware without any program understanding.
Due to the lack of coordination in managing these
two memory structures, significant loss of system
performance results because:
0 Cache space is wasted to hold inaccessible
copies of values in registers.
0 Inaccessible copies of values replace those
accessible ones from cache.
0 Despite the fact that register allocation has
long recognized the benefits of live range
analysis, current cache management has
completely ignored live range information.
In this paper, we propose an unified management
of registers and cache using liveness and cache
bypass. By using a single model to manage these
two memory structures, most redundant copies of
values in cache can be eliminated. Consequently,
bus traffic and memory traffic in data cache are
greatly reduced and cache effectiveness is
improved.
Keywords: cache, register, live range, cache
bypass, unified management.
1. Introduction
In current computer memory system hierarchy,
registers and cache are both used to bridge
the reference delay gap between the fast
processor(s) and the slow main memory. While
registers are managed by the compiler using pre
gram flow analysis, cache is mainly controlled by
hardware without any program understanding.
Due to the lack of coordination in managing these
two memory structures, significant loss of system
performance results because:
l Cache space is wasted to hold inaccessible
copies of values in registers.
0 Inaccessible copies of values replace those
accessible ones from cache.
l Despite the fact that register allocation has
long recognized the benefits of live range
analysis, current cache management has
completely ignored live range information.
This causes busy redundant memory traffic in
cache and decreases system performance substantially.
In load/store VLSI processor designs such
as RISC architecture [Pat851 [HeJ83] [Kat83], this
1. This work WaS completed and the first version of this report was written up before Chi-Hung Chi joined Philips
Laboratories.
Attachments: Image 1
Views: 610 | Added by: Luckyboy | Tags: Always happy | Rating: 0.0/0
Total comments: 0
Name *:
Email *:
Code *:
Login form
Calendar
«  January 2013  »
SuMoTuWeThFrSa
  12345
6789101112
13141516171819
20212223242526
2728293031
Our poll
Rate my site
Total of answers: 3