Feedback-Directed Optimizations in GCC with Estimated Edge Profiles from Hardware Event Sampling
暂无分享,去创建一个
[1] Intel Corportation,et al. IA-32 Intel Architecture Software Developers Manual , 2004 .
[2] D. R. Fulkerson,et al. Maximal Flow Through a Network , 1956 .
[3] Robert L. Probert,et al. Optimal Insertion of Software Probes in Well-Delimited Programs , 1982, IEEE Transactions on Software Engineering.
[4] James R. Larus,et al. Efficient path profiling , 1996, Proceedings of the 29th Annual IEEE/ACM International Symposium on Microarchitecture. MICRO 29.
[5] Gadi Haber,et al. Complementing Missing and Inaccurate Profiling Using a Minimum Cost Circulation Algorithm , 2008, HiPEAC.
[6] Zheng Wang,et al. System support for automatic profiling and optimization , 1997, SOSP.
[7] James R. Larus,et al. Optimally profiling and tracing programs , 1992, POPL '92.
[8] Diego Novillo,et al. WHOPR-Fast and Scalable Whole Program Optimizations in GCC Initial Draft 12-Dec-2007 , 2022 .
[9] Robert Hundt,et al. Feedback-Directed Optimizations with Estimated Edge Profiles from Hardware Event Sampling , 2008 .
[10] Andrew V. Goldberg,et al. Finding minimum-cost circulations by canceling negative cycles , 1989, JACM.
[11] Lance M. Berc,et al. Continuous profiling: where have all the cycles gone? , 1997, ACM Trans. Comput. Syst..
[12] T. Lindvall. ON A ROUTING PROBLEM , 2004, Probability in the Engineering and Informational Sciences.