http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
An Effective Method to Reduce Recovery Cache Size by Using Hash Table Search
Ye Jiongyao,Tang MengYuan,Watanabe Takahiro 대한전자공학회 2009 ITC-CSCC :International Technical Conference on Ci Vol.2009 No.7
The recovery mechanism using a special purpose cache (afterward, called recovery cache) can effectively reduce misprediction penalty in deeply pipelined processors. The recovery cache keeps a few mispredicted instructions after a branch misprediction, and reuses those during the subsequent branch. Thus, the recovery cache hit rates increase depending on its size. This paper proposes an effective method to reduce recovery cache size by using Hash Table Search (HTS). Simulation results show that HTS can provide an average 14.5% reduction in the recovery cache size ensuring that the performance is almost same.
Ye JiongYao,Watanabe Takahiro 대한전자공학회 2008 ITC-CSCC :International Technical Conference on Ci Vol.2008 No.7
A branch prediction is indispensable to modern superscalar processors for high performance. Although it has great possibility to improve performance, the advantage may be lost due to miss-prediction. To reduce such a branch miss-prediction penalty, finer recovery mechanisms are needed. One of those mechanisms is a RcB (recovery buffer), which preserves instructions to be restarted when miss-prediction occurs. But RcB cannot recover instructions issued out of order for a superscalar processor. This paper proposes a L1 recovery cache embedded in a superscalar processing, RcC for short, which overcomes weakness of RcB and can recover instructions issued out of order so that recovery penalty is reduced. Our proposed L1 RcC scheme can work supplementing the conventional 1-bit dynamic branch predictor used in a superscalar processor, so that miss-prediction penalty can be effectively reduced.