2004Unpublished venueRequires access

Reducing operand transport complexity of superscalar processors using distributed register files

S. Bunchua, D.S. Wills, L.M. Wills

Open publisher page 7 citations

Abstract

A critical problem in wide-issue superscalar processors is the limit on cycle time imposed by the central register file and operand bypass network. Here, a distributed register file architecture that employs fully distributed functional unit clusters is presented. It utilizes a local register mapping table and a dedicated register transfer network to support distributed register operations. In addition, an eager transfer mechanism is developed to reduce penalties caused by incomplete operand transport interconnection. Distributed register files can be employed to reduce operand access time by a factor of two with associated average IPC penalties of 14% and 21% on 4- and 8-way superscalar architectures across a broad range of symbolic, scientific, and multimedia applications. The IPC penalties are only 3% and 10% for SpecINT2000 applications.

About this research paper

What this paper is about

A critical problem in wide-issue superscalar processors is the limit on cycle time imposed by the central register file and operand bypass network. Here, a distributed register file architecture that employs fully distributed functional unit clusters is presented. It utilizes a local register mapping table and a dedicated register transfer network to support distributed register operations. In addition, an eager transfer mechanism is developed to reduce penalties caused by incomplete operand transport interconnection. Distributed register files can be employed to reduce operand access time by a factor of two with associated average IPC penalties of 14% and 21% on 4- and 8-way superscalar architectures across a broad range of symbolic, scientific, and multimedia applications. The IPC penalties are only 3% and 10% for SpecINT2000 applications.

Why it matters

OpenAlex reports 7 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A critical problem in wide-issue superscalar processors is the limit on cycle time imposed by the central register file and operand bypass network. Here, a distributed register file architecture that employs fully distributed functional unit clusters is presented. It utilizes a local register mapping table and a dedicated register transfer network to support distributed register operations. In addition, an eager transfer mechanism is developed to reduce penalties caused by incomplete operand transport interconnection. Distributed register files can be employed to reduce operand access time by a factor of two with associated average IPC penalties of 14% and 21% on 4- and 8-way superscalar architectures across a broad range of symbolic, scientific, and multimedia applications. The IPC penalties are only 3% and 10% for SpecINT2000 applications.

Key concepts: Operand, Register file, Computer science, Parallel computing, Processor register, Register (sociolinguistics), Lookup table, Interconnection

Related papers

Back to paper searchBrowse research topicsOriginal source
Reducing operand transport complexity of superscalar processors using distributed register files — Research Paper | ScholarLens