Abstract
This experiment studies the speed-up increase that alias analysis (AA) produces on code for very long instruction word machines. AA is done on-demand when requested by the scheduler, in order to eliminate critical arcs of the data dependence graph. Different heuristic criteria are investigated for deciding when to compute alias information,and they show that only a fraction of the alias relation really contributes to the program speed-up. A qualitative study shows that the quality of the initial code affects the speedup alias analysis can give. The results should help compiler designers for VLIW machines in making cost effective AA decisions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. V. Aho, R. Sethi, and J. D. Ullman. Compilers Principles, Techniques, and Tools. Addison Wesley, 1986.
W. Amme, P. Braun, E. Zehendner, and F. Thomasset. Data dependence analysis of assembly code. In Proceedings of the 1998 PACT, pages 340–347, 1998.
B. Cheng and W. W. Hwu. A practical interprocedural pointer analysis framework. Technical Report IMPACT-99-01, University of Illinois, Urbana, IL, USA, 1999.
R. Costa. Integrating on-demand alias analysis into schedulers for advanced microprocessors. Master’s thesis, Politecnico di Milano, December 2001.
S. Debray, R. Muth, and M. Weippert. Alias analysis of executable code. In Conference Record of POPL’ 98, pages 12–24, San Diego, California, 1998.
G. Aigner et al. An Overview of the SUIF2 Compiler Infrastructure. Computer Systems Laboratory, Stanford University.
N. Heintze and O. Tardieu. Demand-driven pointer analysis. ACM SIGPLAN Notices, 36(5):24–34, May 2001.
W. Landi and B. G. Ryder. A safe approximate algorithm for interprocedural pointer aliasing. In Proceedings PLDI, volume 27, pages 235–248, New York, NY, July 1992. ACM Press.
S. S. Muchnick. Advanced compiler design and implementation. Morgan Kaufmann, 1997.
D. A. Patterson and J. L. Hennessy. Computer Architecture: A Quantitative Approach. Morgan Kaufmann, San Mateo, CA, 1990.
M. Shapiro and S. Horwitz. The effects of the precision of pointer analysis. Lecture Notes in Computer Science, 1302, 1997.
M. Shapiro and S. Horwitz. Fast and accurate flow-insensitive points-to analysis. In ACM, editor, Conference record of POPL’ 97, pages 1–14, 1997.
M. D. Smith and G. Holloway. An Introduction to Machine SUIF and Its portable Libraries for Analysis and Optimization. DEAS, Harvard University, 2001.
B. Steensgaard. Points-to analysis in almost linear time. In Conference Record of POPL’96), pages 32–41. ACM Press, January 21–24, 1996.
R. P. Wilson and M. S. Lam. Efficient context-sensitive pointer analysis for C programs. In Proceedings of the PLDI’ 95, pages 1–12, 18–21 June 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Garatti, M., Costa, R., Reghizzi, S.C., Rohou, E. (2002). The Impact of Alias Analysis on VLIW Scheduling. In: Zima, H.P., Joe, K., Sato, M., Seo, Y., Shimasaki, M. (eds) High Performance Computing. ISHPC 2002. Lecture Notes in Computer Science, vol 2327. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47847-7_10
Download citation
DOI: https://doi.org/10.1007/3-540-47847-7_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43674-4
Online ISBN: 978-3-540-47847-8
eBook Packages: Springer Book Archive