deposit_your_work

Memory Access Scheduling

Files in this item

Files Size Format View
Rix2000Jun5MemoryAcce.PDF 150.7Kb application/pdf Thumbnail

Show full item record

Item Metadata

Title: Memory Access Scheduling
Author: Rixner, Scott; Dally, William J.; Kapasi, Ujval J.; Mattson, Peter; Owens, John D.
Type: Conference Paper
Keywords: memory system architecture; DRAM organization; media processing
Citation: S. Rixner, W. J. Dally, U. J. Kapasi, P. Mattson and J. D. Owens,"Memory Access Scheduling," in International Symposium on Computer Architecture (ISCA),, pp. 128-138.
Abstract: The bandwidth and latency of a memory system are strongly dependent on the manner in which accesses interact with the "3-D" structure of banks, rows, and columns characteristic of contemporary DRAM chips. There is nearly an order of magnitude difference in bandwidth between successive references to different columns within a row and different rows within a bank. This paper introduces memory access scheduling, a technique that improves the performance of a memory system by reordering memory references to exploit locality within the 3-D memory structure. Conservative reordering, in which the first ready reference in a sequence is performed, improves bandwidth by 40% for traces from five media benchmarks. Aggressive reordering, in which operations are scheduled to optimize memory bandwidth, improves bandwidth by 93% for the same set of applications. Memory access scheduling is particularly important for media processors where it enables the processor to make the most efficient use of scarce memory bandwidth.
Date Published: 2000-06-20

This item appears in the following Collection(s)

  • ECE Publications [1082 items]
    Publications by Rice University Electrical and Computer Engineering faculty and graduate students