Dynamic Access Ordering for Streamed Computations (2000)
Download From
IEEE
Download Links
- [www.cs.utah.edu]
- [www.csl.cornell.edu]
- [ftp2.cs.utah.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 24 - 3 self |
BibTeX
@MISC{Mckee00dynamicaccess,
author = {Sally A. Mckee and Wm. A. Wulf and James H. Aylor and Robert H. Klenke and Maximo H. Salinas and Sung I. Hong and Dee A.B. Weikle},
title = {Dynamic Access Ordering for Streamed Computations},
year = {2000}
}
Years of Citing Articles
OpenURL
Abstract
Memory bandwidth is rapidly becoming the limiting performance factor for many applications, particularly for streaming computations such as scientific vector processing or multimedia (de)compression. Although these computations lack the temporal locality of reference that makes traditional caching schemes effective, they have predictable access patterns. Since most modern DRAM components support modes that make it possible to perform some access sequences faster than others, the predictability of the stream accesses makes it possible to reorder them to get better memory performance. We describe a Stream Memory Controller (SMC) system that combines compile-time detection of streams with execution-time selection of the access order and issue. The SMC effectively prefetches read-streams, buffers write-streams, and reorders the accesses to exploit the existing memory bandwidth as much as possible. Unlike most other hardware prefetching or stream buffer designs, this system does no...







