(Enter summary)
Abstract: Software pipelining for instruction-level parallel computers
with non-blocking caches usually assigns memory access latency by assuming
either all accesses are cache hits or all are cache misses. We
contend setting memory latencies by cache reuse analysis leads to better
software pipelining than either an all-hit or all-miss assumption. Using a
simple cache-reuse model, our software pipelining optimization achieved
10% improved execution performance over assuming all-cache-hits and
used... (Update)
Cited by: More
Improving Software Pipelining By Hiding Memory Latency With.. - Bedy, al.
(Correct)
Improving Software Pipelining with Hardware Support for.. - Carr, Sweany (1998)
(Correct)
Software Data Prefetching for Software Pipelined Loops - Sanchez, Gonzalez (1999)
(Correct)
Similar documents (at the sentence level):
26.2%: Modulo Scheduling with Cache Reuse Information - Ding, Carr, Sweany (1997)
(Correct)
Active bibliography (related documents): More All
0.0: Latency Tolerant Architectures - Bennett (1998)
(Correct)
0.0: Software Methods to Improve Data Locality and Cache Behavior - Beyls (2004)
(Correct)
0.0: Data Locality Optimizations for Multigrid Methods on Structured.. - Weiß
(Correct)
Similar documents based on text: More All
0.3: Improving Software Pipelining with Unroll-and-Jam and Memory Reuse .. - Ding (1996)
(Correct)
0.2: Improving Effective Bandwidth through Compiler Enhancement of.. - Ding (2000)
(Correct)
0.2: Improving Software Pipelining With Unroll-and-Jam - Carr, Ding, Sweany (1996)
(Correct)
Related documents from co-citation: More All
5: A Data Locality Optimizing Algorithm (context) - Wolf, Lam - 1991
5: Design and evaluation of a compiler algorithm for prefetching
- Mowry, Lam et al. - 1992
5: Software pipelining: An effective scheduling technique for VLIW machines (context) - Lam - 1988
BibTeX entry: (Update)
Chen Ding, Steve Carr, and Phil Sweany. Modulo scheduling with cache reuse information. In Proceedings of EuroPar '97, pages 1079--1083, August 1997. http://citeseer.ist.psu.edu/ding97modulo.html More
@inproceedings{ ding97modulo,
author = "Chen Ding and Steve Carr and Philip H. Sweany",
title = "Modulo Scheduling with Cache Reuse Information",
booktitle = "European Conference on Parallel Processing",
pages = "1079-1083",
year = "1997",
url = "citeseer.ist.psu.edu/ding97modulo.html" }
Citations (may not include all citations):
353
Software pipelining: An effective scheduling technique for v.. (context) - Lam - 1988
344
Design and evaluation of a compiler algorithm for prefetchin..
- Mowry, Lam et al. - 1992
162
Improving data locality with loop transformations
- McKinley, Carr et al. - 1996
90
Reducing memory latency via non-blocking and prefetching cac..
- Chen, Baer - 1992
40
Iterative modulo scheduling (context) - Rau - 1994
21
Predictability loadstore instruction latencie (context) - Windheiser, Gupta et al. - 1993
1
Software pipelining with cache-reuse information (context) - Ding, Carr et al. - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.mtu.edu/%7Ecarr/MyPublications.html): More
Race Conditions: A Case Study - Carr, Mayo, Shene (2002)
(Correct)
Channels, Visualization, and Topology Editor - Steve Carr Ping
(Correct)
Compiler Blockability of Dense Matrix - Steve Carr Michigan
(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