Skip to main content

Predicate Analysis Based on Path Information

  • Conference paper
Advanced Parallel Processing Technologies (APPT 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2834))

Included in the following conference series:

Abstract

Predicated execution leads new challenges to traditional optimizers. Limited by predicate representations, current predicate analysis methods could only perform locally or have low efficiency. A new representation based on path information is proposed in this paper, based on which a global predicate relation query system is constructed. Experiment results indicate that precise and efficient global predicate analysis could be achieved with this system and the performance of optimized codes can also be improved.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kathail, U., Schlansker, M., Rau, B.: HPL PlayDoh Architecture Specification: Version 1.0. Hewlett-Packard Laboratories Technical Report, HPL-93-80 (February 1993)

    Google Scholar 

  2. Allen, J.R., Kennedy, K., Portfield, C., et al.: Conversion of Control Dependence to Data Dependence. In: Conf. Record of the 10th ACM Symp. on Principles of Programming Languages, January, 1983, pp. 177–189 (1983)

    Google Scholar 

  3. Mahlke, S.A., Lin, D.C., Chen, W.Y., et al.: Effective compiler support for predicated execution using the hyperblock. In: Proc. of the 25th Int’l Symp. on Microarchitecture, December, 1992, pp. 45–54 (1992)

    Google Scholar 

  4. Tyson, G.S.: The effects of predicated execution on branch prediction. In: Proc. of the 27th Int’l Symp. on Microarchitecture, November 30–December 2, pp. 196–206 (1994)

    Google Scholar 

  5. Mahlke, S.A., Hank, R.E., Bringman, R.A., et al.: Characterizing the impact of predicated execution on branch prediction. In: Proc. of the 27th Int’l Symp. on Microarchitecture, November 30–December 2, pp. 217–227 (1994)

    Google Scholar 

  6. Eichenberger, A.E., Davidson, E.S.: Register Allocation for Predicated Code. In: Proc. of the 28th of Int’l Symp. on Microarchitecture (November 1995)

    Google Scholar 

  7. Johnson, R., Schlansker, M.: Analysis Techniques for Predicated Code. In: Proc. of the 29th Int’l Symp. on Microarchtecture (December 1996)

    Google Scholar 

  8. Sias, J.W., Hsu, W.W., August, D.I.: Accurate and Efficient Predicate Analysis with Binary Decision Diagrams. In: Proc. of the 33rd of Int’l Symp. on Microarchitecture, December 2000, pp. 112–123 (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shen, L., Wang, Z., Lu, J. (2003). Predicate Analysis Based on Path Information. In: Zhou, X., Xu, M., Jähnichen, S., Cao, J. (eds) Advanced Parallel Processing Technologies. APPT 2003. Lecture Notes in Computer Science, vol 2834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39425-9_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39425-9_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20054-3

  • Online ISBN: 978-3-540-39425-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics