DocumentCode
389560
Title
Dynamic addressing memory arrays with physical locality
Author
Hsu, Steven ; Lu, Shih-Lien ; Shih-Chang Lai ; Krishnamurthy, Ram ; Lai, Shih-Chang
Author_Institution
Intel Labs., Intel Corp., USA
fYear
2002
fDate
2002
Firstpage
161
Lastpage
170
Abstract
As pipeline width and depth grow to improve performance, memory arrays in microprocessors are growing in entries and ports. Arrays will increase in physical size, which prolongs the access time due to wiring delay. In order to boost clock frequency, these memory arrays must take multiple cycles to complete an access. This delays the scheduling of dependent instructions and affects overall performance. This paper proposes a different circuit organization to enable fast and slow accesses solely dependent on physical locality. Since the access time depends on a fixed physical location, it is pre-determined to scheduling dependent instructions. Furthermore, this paper presents a mechanism to re-configure the address decoding of the physical register file to increase the occurrence of fast accesses. Detailed circuit simulation using this proposed method determines the access cycle time. Reduction in average access cycle time for the register file and the first level data cache recovers 73% of the IPC degradation.
Keywords
computer architecture; microcomputers; performance evaluation; storage management; dependent instructions; memory arrays; microprocessors; performance; register file; scalability; scheduling; superscalar microprocessor performance; Circuits; Clocks; Decoding; Delay effects; Frequency; Microprocessors; Pipelines; Processor scheduling; Registers; Wiring;
fLanguage
English
Publisher
ieee
Conference_Titel
Microarchitecture, 2002. (MICRO-35). Proceedings. 35th Annual IEEE/ACM International Symposium on
ISSN
1072-4451
Print_ISBN
0-7695-1859-1
Type
conf
DOI
10.1109/MICRO.2002.1176247
Filename
1176247
Link To Document