CREGS: A new kind of memory for referencing arrays and pointers

Henry Dietz, Chi Hung Chi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Scopus citations

Abstract

Pointer and subscripted array references often touch memory locations for which there are several possible aliases; hence these references cannot be made from registers. Although conventional caches can increase performance somewhat, they do not provide many of the benefits of registers, and do not permit the compiler to perform many optimizations associated with register references. The CReg (pronounced 'C-Reg') mechanism combines the hardware structures of cache and registers to create a novel kind of memory structure, which can be used either as processor registers or as a replacement for conventional cache memory. By permitting aliased names to be grouped together, CRegs resolve ambiguous alias problems in hardware, resulting in more efficient execution that even the combination of conventional registers and cache can provide. The authors discuss both the conceptual CReg hardware structure and the compiler analysis and optimization techniques to manage that structure.

Original languageEnglish
Title of host publicationProc Supercomputing 88
Pages360-367
Number of pages8
StatePublished - 1988

Publication series

NameProc Supercomputing 88

ASJC Scopus subject areas

  • Engineering (all)

Fingerprint

Dive into the research topics of 'CREGS: A new kind of memory for referencing arrays and pointers'. Together they form a unique fingerprint.

Cite this