See this document in CiteSeerX!

Investigating Optimal Local Memory Performance (1998)  (Make Corrections)  (8 citations)
Olivier Temam PRiSM, Versailles University, Versailles, France...
Architectural Support for Programming Languages and Operating Systems



  Home/Search   Context   Related

Links:   ACM   DBLP

 
View or download:
prism.uvsq.fr/archi/pubs/p...Te98.ps.gz
masi.uvsq.fr/~temam/Articl...Te98.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  prism.uvsq.fr/archi/pubs/ (more)
From:  masi.uvsq.fr/~tema...publications
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Recent work has demonstrated that cache space is often poorly utilized. However, no previous work has yet demonstrated upper bounds on what a cache or local memory could achieve when exploiting both spatial and temporal locality. Belady's MIN algorithm does yield an upper bound, but exploits only temporal locality. In this article, we present an optimal replacement algorithm for local memory that exploits temporal locality and spatial locality simultaneously. This algorithm is an extension of... (Update)

Context of citations to this paper:   More

...the profiling technique. The references that are labeled as capacity miss are references that are identified by the algorithm described in [19]. 3.2 Computing Scores After the profiles have been gathered the scores are computed. For a set index function H the score is the sum of...

.... will have the minimal number of cache misses any cache of the same size for any possible sequence of references can have [SA93, Tem98] 2.4 State of the Art In the following, an overview of the state of the art in microprocessor technology is given with an emphasis on the...

Cited by:   More
Fast and Accurate Method for Determining a Lower Bound .. - Fursin, O'Boyle.. (2004)   (Correct)
An Overview of Cache Optimization Techniques and Cache-Aware .. - Kowarschik, Weiß (2003)   (Correct)
Analysis of Profiling Information for Cache Sensitive Scheduling - Lindenmaier (1999)   (Correct)

Similar documents (at the sentence level):
61.2%:   Unknown - Apparently There Is   (Correct)
58.4%:   Investigating Optimal Local Memory Performance - Temam (1998)   (Correct)

Active bibliography (related documents):   More   All
0.0:   Software Methods to Improve Data Locality and Cache Behavior - Beyls (2004)   (Correct)
0.0:   Hardware Techniques To Improve The Performance Of The.. - Burger (1998)   (Correct)
0.0:   A Quantitative Analysis of Loop Nest Locality - McKinley, Temam (1996)   (Correct)

Similar documents based on text:   More   All
0.2:   Quantifying Loop Nest Locality Using SPEC'95 and the Perfect.. - McKinley, Temam (1999)   (Correct)
0.2:   Influence of Cross-Interferences on Blocked Loops: A Case.. - Fricker, Temam, Jalby (1995)   (Correct)
0.1:   Software Assistance for Data Caches - Temam, Drach (1995)   (Correct)

Related documents from co-citation:   More   All
5:   Efficient simulation of caches under optimal replacement with applications to mi.. - Sugumar, Abraham - 1993
4:   Computer Architecture: a Quantitative Approach (context) - Hennessy, Patterson - 1996
4:   A Data Locality Optimizing Algorithm (context) - Wolf, Lam - 1991

BibTeX entry:   (Update)

Olivier Temam. Investigating Optimal Local Memory Performance. In Proceedings of the Eighth Symposium on Architectural Support for Programming Languages and Operating Systems, pages 218--226, October 1998. http://citeseer.ist.psu.edu/article/temam98investigating.html   More

@inproceedings{ temam98investigating,
    author = "Olivier Temam",
    title = "Investigating Optimal Local Memory Performance",
    booktitle = "Architectural Support for Programming Languages and Operating Systems",
    pages = "218-227",
    year = "1998",
    url = "citeseer.ist.psu.edu/article/temam98investigating.html" }
Citations (may not include all citations):
232   A Study of Replacement Algorithms for a Virtual-Storage Comp.. (context) - Belady - 1966
124   A study of integrated prefetching and caching strategies - Cao, Felten et al. - 1995
110   Memory bandwidth limitations of future microprocessors - Burger, Kagi et al. - 1996  ACM   DBLP
94   Stride Directed Prefetching in Scalar Processors (context) - Fu, Patel et al.
57   Digital Equipment Corporation (context) - Corporation, user et al. - 1995
38   Efficient simulation of caches under optimal replacement wit.. - Abraham, Sugumar - 1993  ACM   DBLP
30   The Declining Effectiveness of Dynamic Caching for GeneralPu.. - Burger, Kagi et al. - 1996
19   Design of the hp pa-7200 cpu - Chan, Hay et al. - 1996



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.prism.uvsq.fr/archi/pubs/):   More
Using Virtual Lines to Enhance Locality Exploitation - Temam, Jegou (1994)   (Correct)
Streaming Prefetch - Temam (1995)   (Correct)
Cache Interference Phenomena - Temam, Fricker, Jalby (1994)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC