Reorder Buffer Structure with Shelter Buffer for Out-of-Order Issue Superscalar Processors

Mun-Suek CHANG; Choung-Shik PARK; Sang-Bang CHOI

Reorder Buffer Structure with Shelter Buffer for Out-of-Order Issue Superscalar Processors

Mun-Suek CHANG, Choung-Shik PARK, Sang-Bang CHOI

Full Text Views

0

Cite this

Summary :

The reorder buffer is usually employed to maintain the instruction execution in the correct order for a superscalar pipeline with out-of-order issue. In this paper, we propose a reorder buffer structure with shelter buffer for out-of-order issue superscalar processors not only to control stagnation efficiently, but also to reduce the buffer size. We can get remarkable performance improvement with only one or two buffers. Simulation results show that if the size of reorder buffer is between 8 and 32, performance gain obtained from the shelter is noticeable. For the shelter buffer of size 4, there is no performance improvement compared to that of size 2, which means that the shelter buffer of size 2 is large enough to handle most of the stagnation. If the shelter buffer of size 2 is employed, we can reduce the reorder buffer by 44% in Whetstone, 50% in FFT, 60% in FM, and 75% in Linpack benchmark program without loss of any throughput. Execution time is also improved by 19.78% in Whetstone, 19.67% in FFT, 23.93% in FM, and 8.65% in Linpack benchmark when the shelter buffer is used.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E83-A No.6 pp.1091-1099

Publication Date: 2000/06/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section of Papers Selected from 1999 International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC'99))

Category

Cite this

Copy

Mun-Suek CHANG, Choung-Shik PARK, Sang-Bang CHOI, "Reorder Buffer Structure with Shelter Buffer for Out-of-Order Issue Superscalar Processors" in IEICE TRANSACTIONS on Fundamentals, vol. E83-A, no. 6, pp. 1091-1099, June 2000, doi: .
Abstract: The reorder buffer is usually employed to maintain the instruction execution in the correct order for a superscalar pipeline with out-of-order issue. In this paper, we propose a reorder buffer structure with shelter buffer for out-of-order issue superscalar processors not only to control stagnation efficiently, but also to reduce the buffer size. We can get remarkable performance improvement with only one or two buffers. Simulation results show that if the size of reorder buffer is between 8 and 32, performance gain obtained from the shelter is noticeable. For the shelter buffer of size 4, there is no performance improvement compared to that of size 2, which means that the shelter buffer of size 2 is large enough to handle most of the stagnation. If the shelter buffer of size 2 is employed, we can reduce the reorder buffer by 44% in Whetstone, 50% in FFT, 60% in FM, and 75% in Linpack benchmark program without loss of any throughput. Execution time is also improved by 19.78% in Whetstone, 19.67% in FFT, 23.93% in FM, and 8.65% in Linpack benchmark when the shelter buffer is used.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e83-a_6_1091/_p

Copy

@ARTICLE{e83-a_6_1091,
author={Mun-Suek CHANG, Choung-Shik PARK, Sang-Bang CHOI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Reorder Buffer Structure with Shelter Buffer for Out-of-Order Issue Superscalar Processors},
year={2000},
volume={E83-A},
number={6},
pages={1091-1099},
abstract={The reorder buffer is usually employed to maintain the instruction execution in the correct order for a superscalar pipeline with out-of-order issue. In this paper, we propose a reorder buffer structure with shelter buffer for out-of-order issue superscalar processors not only to control stagnation efficiently, but also to reduce the buffer size. We can get remarkable performance improvement with only one or two buffers. Simulation results show that if the size of reorder buffer is between 8 and 32, performance gain obtained from the shelter is noticeable. For the shelter buffer of size 4, there is no performance improvement compared to that of size 2, which means that the shelter buffer of size 2 is large enough to handle most of the stagnation. If the shelter buffer of size 2 is employed, we can reduce the reorder buffer by 44% in Whetstone, 50% in FFT, 60% in FM, and 75% in Linpack benchmark program without loss of any throughput. Execution time is also improved by 19.78% in Whetstone, 19.67% in FFT, 23.93% in FM, and 8.65% in Linpack benchmark when the shelter buffer is used.},
keywords={},
doi={},
ISSN={},
month={June},}

Copy

TY - JOUR
TI - Reorder Buffer Structure with Shelter Buffer for Out-of-Order Issue Superscalar Processors
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1091
EP - 1099
AU - Mun-Suek CHANG
AU - Choung-Shik PARK
AU - Sang-Bang CHOI
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E83-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 2000
AB - The reorder buffer is usually employed to maintain the instruction execution in the correct order for a superscalar pipeline with out-of-order issue. In this paper, we propose a reorder buffer structure with shelter buffer for out-of-order issue superscalar processors not only to control stagnation efficiently, but also to reduce the buffer size. We can get remarkable performance improvement with only one or two buffers. Simulation results show that if the size of reorder buffer is between 8 and 32, performance gain obtained from the shelter is noticeable. For the shelter buffer of size 4, there is no performance improvement compared to that of size 2, which means that the shelter buffer of size 2 is large enough to handle most of the stagnation. If the shelter buffer of size 2 is employed, we can reduce the reorder buffer by 44% in Whetstone, 50% in FFT, 60% in FM, and 75% in Linpack benchmark program without loss of any throughput. Execution time is also improved by 19.78% in Whetstone, 19.67% in FFT, 23.93% in FM, and 8.65% in Linpack benchmark when the shelter buffer is used.
ER -