TY - GEN
T1 - A small, fast and low-power register file by bit-partitioning
AU - Kondo, Masaaki
AU - Nakamura, Hiroshi
PY - 2005
Y1 - 2005
N2 - A large multi-ported register file is indispensable for exploiting instruction level parallelism (ILP) in today's dynamically scheduled superscalar processors. The number of ports and the size of the register file must be enlarged as the issue width and instruction window size increase. However, a larger register file causes longer access delays and more power consumption. To tackle these problems, we propose Bit-Partitioned Register File which reduces the area, access time, and energy consumption of the register file. The proposed method relies on the fact that many operands do not need the full-bit width (typically a 32-bit or 64-bit width) of a register entry. Because the effective bit-width of most register operands is narrower than the full-bit width of a register entry, the upper bits of the register entries assigned to such narrow-width operands are useless. Thus, we propose to use of these useless upper bits for other operands by partitioning the register entries. In this paper, we show the mechanism of the proposed register file and evaluate its performance and power consumption. The evaluation results reveal that the proposed register file achieves higher Instruction Per Cycle (IPC) in a smaller physical area, and consequently with shorter access time and less power consumption.
AB - A large multi-ported register file is indispensable for exploiting instruction level parallelism (ILP) in today's dynamically scheduled superscalar processors. The number of ports and the size of the register file must be enlarged as the issue width and instruction window size increase. However, a larger register file causes longer access delays and more power consumption. To tackle these problems, we propose Bit-Partitioned Register File which reduces the area, access time, and energy consumption of the register file. The proposed method relies on the fact that many operands do not need the full-bit width (typically a 32-bit or 64-bit width) of a register entry. Because the effective bit-width of most register operands is narrower than the full-bit width of a register entry, the upper bits of the register entries assigned to such narrow-width operands are useless. Thus, we propose to use of these useless upper bits for other operands by partitioning the register entries. In this paper, we show the mechanism of the proposed register file and evaluate its performance and power consumption. The evaluation results reveal that the proposed register file achieves higher Instruction Per Cycle (IPC) in a smaller physical area, and consequently with shorter access time and less power consumption.
UR - http://www.scopus.com/inward/record.url?scp=28444458474&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=28444458474&partnerID=8YFLogxK
U2 - 10.1109/HPCA.2005.3
DO - 10.1109/HPCA.2005.3
M3 - Conference contribution
AN - SCOPUS:28444458474
SN - 0769522750
T3 - Proceedings - International Symposium on High-Performance Computer Architecture
SP - 40
EP - 49
BT - Proceedings - 11th International Symposium on High-Performance Computer Architecture, HPCA-11 2005
T2 - 11th International Symposium on High-Performance Computer Architecture, HPCA-11 2005
Y2 - 12 February 2005 through 16 February 2005
ER -