Minimizing Memory Access Schedule for Memories

Jingtong Hu, Chun Jason Xue, Wei-Che Tseng, Meikang Qiu, Yingchao Zhao, Edwin Hsing-Mean ShaICPADS 2009 · OpenReview

Abstract

According to the characteristics of the "3-D" structure of contemporary DRAM chips, the row first column ordered (RFCO) algorithm is proposed in this paper to minimize memory access schedule length. In memory systems with a single memory controller, assuming that the memory access trace is known before scheduling, the RFCO algorithm can generate schedules which are 7.89% shorter than burst scheduling on average. If memory accesses are coming to the single memory controller in real time, the RFCO algorithm can generate schedules which are 8.03% shorter than burst scheduling on average.
BibTeX
@inproceedings{hu2009minimizing,
  author = {Jingtong Hu and Chun Jason Xue and Wei-Che Tseng and Meikang Qiu and Yingchao Zhao and Edwin Hsing-Mean Sha},
  title = {{Minimizing Memory Access Schedule for Memories}},
  booktitle = {ICPADS},
  year = {2009},
  url = {https://openreview.net/forum?id=0UkFhE0P-p4},
}

Loading related content...

Figure