Skip to main content
Log in

An Efficient Value Predictor Dynamically Using Loop and Locality Properties

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Value prediction, a technique to break data dependency, is important in enhancing instruction-level parallelism and processor performance. A new value predictor utilizing both the loop and locality properties of data values has been proposed in this paper to pursue desirable prediction accuracy at reasonable cost. The proposed value predictor, called the Dynamic Loop and Locality-based (DLL) predictor, makes predictions by dynamically practicing the loop or locality-based prediction policy according to the state. With certain simple designs, the DLL predictor gains prediction accuracy in an efficient way. To secure more comprehensive experimental evaluation of value predictors, a new performance measure, accuracy improvement per cost, briefed as the A/C ratio, is introduced in the paper. Simulation results show that, compared with other existing value predictors, the proposed DLL predictor produces better A/C ratios in almost all situations due to flexible application of different prediction policies and reduced cost.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. D. Burger, T. M. Austin, and S. Bennett. Evaluating future microprocessors: The SimpleScalar tool set. Technical Report CS-TR-96-1308, University of Wisconsin-Madison, July 1996.

  2. T. Chen and J. L. Baer. Effective hardware-based data prefetching for high-performance processors. IEEE Trans. on Computers, 44(5):609–623, 1995.

    Google Scholar 

  3. F. Dahlgren and P. Stenstrom. Evaluation of hardware-based stride and sequential prefetching in shared-memory multiprocessors. IEEE Trans. on Parallel and Distributed Systems, 7(4):385–398, 1996.

    Google Scholar 

  4. B. Goeman, H. Vandierendonck, and K. DeBosschere. Differential FCM: Increasing value prediction accuracy by improving table usage efficiency. Proc. 7th Int'l Symp. on High-Performance Computer Architecture, Feb. 2001, pp. 207–216.

  5. M. H. Lipasti and J. P. Shen. Exceeding the dataflow limit via value prediction. Proc. 29th Annual IEEE/ACM Int'l Symp. on Microarchitecture, Nov. 1996, pp. 226–237.

  6. Y. Sazeides and J. E. Smith. The predictability of data values. Proc. 30th Annual IEEE/ACM Int'l Symp. on Microarchitecture, Nov. 1997, pp. 248–258.

  7. A. Sodani and G. S. Sohi. Understanding the differences between value prediction and instruction reuse. Proc. 31st Annual IEEE/ACM Int'l Symp. on Microarchitecture, Nov. 1998.

  8. SPEC CPU '95, Technical Manual, Aug. 1995.

  9. K. Wang and M. Franklin, Highly accurate data value prediction using hybrid predictors. Proc. 30th Annual IEEE/ACM Int'l Symp. on Microarchitecture, Nov. 1997, pp. 281–290.

  10. T.-Y. Yeh and Y. N. Patt. Alternative implementations of two-level adaptive branch prediction. Proc. 19th Int'l Symp. on Computer Architecture, May 1992, pp. 124–134.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chuang, PJ., Hsiao, YT. & Chiu, YS. An Efficient Value Predictor Dynamically Using Loop and Locality Properties. The Journal of Supercomputing 30, 19–36 (2004). https://doi.org/10.1023/B:SUPE.0000032779.88101.24

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:SUPE.0000032779.88101.24

Navigation