Optimization of data prefetch helper threads with path-expression based statistical modeling

Proceedings of the International Conference on Supercomputing

Volumn , Issue , 2007, Pages 210-221

  Aamodt, Tor M ^a   Chow, Paul ^b  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

Analytical modeling; Data prefetch; Helper threads; Multithreading; Optimization; Path expressions

Indexed keywords

COMPUTER SIMULATION; INFORMATION ANALYSIS; PARALLEL PROCESSING SYSTEMS; RESOURCE ALLOCATION; STATISTICAL METHODS;

ANALYTICAL MODELING; DATA PREFETCH; HELPER THREADS; MULTITHREADING; PATH EXPRESSIONS;

DATA COMPRESSION;

EID: 34548040931     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1274971.1275001     Document Type: Conference Paper

References (38)

1. T. M. Aamodt. Modeling and Optimization of Speculative Threads. PhD thesis, Department of Electrical and Computer Engineering, University of Toronto, 2006.
2. T. M. Aamodt, P. Marcuello, P. Chow, A. González, P. Hammarlund, H. Wang, and J. P. Shen. A Framework for Modeling and Optimization of Prescient Instruction Prefetch. In ACM SIGMETRICS Int'l Conf. on Measurement and Modeling of Computer Systems, pages 13-24, 2003.
3. H. Agrawal and J. R. Horgan. Dynamic Program Slicing. In Conf. on Programming Language Design and Implementation, pages 246-256, 1990.
4. T. Ball and J. R. Larus. Efficient path profiling. In Int'l Symp. on Microarchitecture, pages 46-57, 1996.
5. R. Bodik, R. Gupta, and M. L. Sofia. Interprocedural conditional branch elimination. In Conf. on Programming Language Design and Implementation, pages 146-158, 1997.
6. D. Burger and T. M. Austin. The SimpleScalar Tool Set, Version 2.0. http://www.simplescalar.com, 1997.
7. M. C Carlisle. Olden: Parallelizing Programs with Dynamic Data Structures on Distributed-Memory Machines. PhD thesis, Princeton University, Department of Computer Science, June 1996.
8. P. P. Chang, S. A. Mahlke, and W. Hwu. Using Profile Information to Assist Classic Code Optimizations. Software: Practice and Experience, 21(12):1301-1321, 1991.
9. R. S. Chappell, F. Tseng, A. Yoaz, and Y. N. Patt. Difficult-Path Branch Prediction Using Subordinate Microthreads. In 29th Int'l Symp. on Computer Architecture, pages 307-317, 2002.
10. P.-S. Chen, Y.-S. Hwang, R. D.-C. Ju, and J. K. Lee. Interprocedural probabilistic pointer analysis. IEEE Trans. Parallel Distrib. Syst., 15(10):893-907, 2004.
11. J. D. Collins, H. Wang, D. M. Tullsen, C. Hughes, Y.-F. Lee, D. Lavery, and J. P. Shen. Speculative Precomputation: Long-Range Prefetching of Delinquent Loads. In 28th Int'l Symp. on Computer Architecture, pages 14-25, 2001.
12. M. Dubois and Y. Song. Assisted execution. Technical Report CENG 98-25, Department of EE-Systems, University of Southern California, October 1998.
13. J. A. Fisher. Trace Scheduling: A Technique for Global Microcode Compaction. IEEE Trans. Computers, 30(7):478-490, 1981.
14. GrammaTech. Codesurfer. http://www.grammatech.com, 2007.
15. M. W. Hall, J. M. Anderson, S. P. Amarasinghe, B. R. Murphy, S.-W. Liao, E. Bugnion, and M. S. Lam. Maximizing Multiprocessor Performance with the SUIF Compiler. IEEE Computer, December 1996.
16. Intel Corporation. Intel®VTune™ Performance Analyzer. http://www.intel.com, 2007.
17. D. Kim, S.-W. Liao, P. H. Wang, J. del Cuvillo, X. Tian, X. Zou, H. Wang, D. Yeung, M. Girkar, and J. P. Shen. Physical Experimentation with Prefetching Helper Threads on Intel's Hyper-Threaded Processors. In 2nd Intl. Symp. on Code Generation and Optimization (CGO 2004), pages 27-38, 2004.
18. D. Kim and D. Yeung. Design and Evaluation of Compiler Algorithms for Pre-Execution. In ASPLOS-X, pages 159-170, 2002.
19. J. R. Larus. Whole program paths. In Conf. on Programming Language Design and Implementation, pages 259-269, 1999.
20. S. S. Liao, P. H. Wang, H. Wang, G. Hoflehner, D. Lavery, and J. P. Shen. Post-Pass Binary Adaptation for Software-Based Speculative Precomputation. In Conf. on Programming Language Design and Implementation, pages 117-128, 2002.
21. C.-K. Luk. Optimizing the Cache Performance of Non-numeric Applications. PhD thesis, Department of Computer Science, University of Toronto, January 2000.
22. E. Mehofer and B. Scholz. Probabilistic data now system with two-edge profiling. In Workshop on Dynamic and Adaptive Compilation and Optimization, pages 65-72, 2000.
23. A. Moshovos, D. N. Pnevmatikatos, and A. Baniasadi. Slice-Processors: An Implementation of Operation-Based Prediction. In 15th Int'l Conf. on Supercomputing, pages 321-334, 2001.
24. T. C Mowry and C-K. Luk. Predicting Data Cache Misses in Non-Numeric Applications Through Correlation Profiling. In 30th Int'l Symp. on Microarchitecture, pages 314-320, 1997.
25. S. Muchnick. Advanced Compiler Design and Implementation. Morgan Kaufmann, August 1997.
26. V. Petric and A. Roth. Energy-effectiveness of pre-execution and energy-aware p-thread selection. In 32nd Int 'I Symp. on Computer Architecture, pages 322-333, 2005.
27. G. Ramalingam. Data flow frequency analysis. In Conf. on Programming Language Design and Implementation, pages 267-277, 1996.
28. A. Roth and G. S. Sohi. Speculative Data-Driven Multithreading. In 7th Int'l Symp. on High-Performance Computer Architecture, pages 37-48, 2001.
29. A. Roth and G. S. Sohi. A Quantitative Framework for Automated Pre-Execution Thread Selection. In Int'l Symp. on Microarchitecture, pages 430-441, 2002.
30. B. Scholz and E. Mehofer. Dataflow frequency analysis based on whole program paths. In The 11th Int'l Conf. on Parallel Architectures and Compilation Techniques, pages 95-103, 2002.
31. T. Sherwood, E. Perelman, G. Hamerly, and B. Calder. Automatically characterizing large scale program behavior. In 10th Int'l Conf. on Architectural Support for Programming Languages and Operating Systems, 2002.
32. S. T. Srinivasan and A. R. Lebeck. Load latency tolerance in dynamically scheduled processors. In Int'l Symp. on Microarchitecture, pages 148-159, 1998.
33. Standard Performance Evaluation Corporation. SPEC 2000 CPU benchmarks, http://www.spec.org/.
34. R. E. Tarjan. A Unified Approach to Path Problems. Journal of the ACM, 28(3):577-593, 1981.
35. R. E. Tarjan. Fast Algorithms for Solving Path Problems. Journal of the ACM, 28(3):594-614, 1981.
36. P. H. Wang, J. D. Collins, H. Wang, D. Kim, B. Greene, K.-M. Chan, A. B. Yunus, T. Sych, S. F. Moore, and J. P. Shen. Helper threads via virtual multithreading on an experimental itanium 2 processor-based platform. In ASPLOS, pages 144-155, 2004.
37. C. Zilles and G. Sohi. Execution-based prediction using speculative slices. In 28th Int'l Symp. on Computer Architecture, pages 2-13, 2001.
38. C. B. Zilles and G. S. Sohi. Understanding the backward slices of performance degrading instructions. In 27th Int'l Symp. on Computer Architecture, pages 172-181, 2000.