DocumentCode
3243200
Title
Minimizing Memory Access Schedule for Memories
Author
Hu, Jingtong ; Xue, Chun Jason ; Tseng, Wei-Che ; Qiu, Meikang ; Zhao, Yingchao ; Sha, EdwinH M.
Author_Institution
Dept. of Comput. Sci., Univ. of Texas at Dallas, Richardson, TX, USA
fYear
2009
fDate
8-11 Dec. 2009
Firstpage
104
Lastpage
111
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.
Keywords
DRAM chips; processor scheduling; DRAM chips; burst scheduling; memory access schedule length; memory access schedule minimization; row first column ordered algorithm; single memory controller; Bandwidth; Clocks; Computer science; Control systems; Delay; Fabrication; Frequency; Processor scheduling; Random access memory; Scheduling algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Systems (ICPADS), 2009 15th International Conference on
Conference_Location
Shenzhen
ISSN
1521-9097
Print_ISBN
978-1-4244-5788-5
Type
conf
DOI
10.1109/ICPADS.2009.86
Filename
5395228
Link To Document