Automatic trace-based parallelization of Java programs

Proceedings of the International Conference on Parallel Processing

Volumn , Issue , 2007, Pages

  Bradel, Borys J ^a   Abdelrahman, Tarek S ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; EMBEDDED SYSTEMS;

AUTOMATIC PARALLELIZATION; DATA LEVEL PARALLELISM (DLP); DATA PARALLEL; EXECUTION MODELS; FEEDBACK DIRECTED; INTERNATIONAL CONFERENCES; JAVA PROGRAMS; PARALLEL PROCESSING; PARALLELIZATION; SEQUENTIAL PROGRAMS;

JAVA PROGRAMMING LANGUAGE;

EID: 47249159924     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.2007.21     Document Type: Conference Paper

References (22)

1. G. Ammons and J. R. Larus. Improving data-flow analysis with path profiles. In PLDI, pages 72-84, 1998.
2. D. F. Bacon, S. L. Graham, and O. J. Sharp. Compiler transformations for high-performance computing. ACM Computing Surveys, 26(4):345-420, 1994.
3. V. Bala, E. Duesterwald, and S. Banerjia. Transparent dynamic optimization: The design and implementation of dynamo. HP Labs Tech Report, 1999.
4. V. Bala, E. Duesterwald, and S. Banerjia. Dynamo: a transparent dynamic optimization system. ACM SIGPLAN Notices, 35(5):1-12, 2000.
5. T. Ball and J. R. Larus. Efficient path profiling. In MICRO, pages 46-57, 1996.
6. B. J. Bradel and T. S. Abdelrahman. The use of traces for inlining in Java programs. In LCPC, pages 179-193, 2004.
7. D. Bruening, E. Duesterwald, and S. Amarasinghe. Design and implementation of a dynamic optimization framework for windows. In FDDO-4, 2001.
8. D. Bruening, T. Garnett, and S. Amarasinghe. An infrastructure for adaptive dynamic optimization. In CGO, pages 265-275, 2003.
9. B. Chan and T. S. Abdelrahman. Run-time support for the automatic parallelization of Java programs. In PDCS, pages 113-120, 2001.
10. M. Chen and K. Olukotun. The Jrpm system for dynamically parallelizing Java programs. In ISCA, 2003.
11. M. Chen and K. Olukotun. Test: A tracer for extracting speculative threads. In CGO, 2003.
12. J. A. Fisher. Trace scheduling : A technique for global microcode compaction. IEEE Trans. on Computers, C-30(7):478-490, 1981.
13. D. Geer. Chip makers turn to multicore processors. IEEE Computer, pages 11-13, May 2005.
14. Jikes research virtual machine. International Business Machines Corporation, 2007. http://jikesrvm.sourceforge.net/.
15. J. G. Steffan et al. A scalable approach to thread-level speculation. In ISCA, pages 1-24, 2000.
16. Java Grande Forum Benchmark Suite, 2003. http://www2.epcc.ed.ac.uk/ computing/research_activities/java_grande/index_1.html.
17. T. Johnson, R. Eigenmann, and T. N. Vijaykumar. Mincut program decomposition for thread-level speculation. In PLDI, pages 59-69, 2004.
18. S. Leung and J. Zahorjan. Improving the performance of runtime parallelization. In PPoPP, 1993.
19. M. Obata, K. Ishizaka, and H. Kasahara. Automatic coarse grain task parallel processing using OSCAR multigrain parallelizing compiler. In CPC, pages 173-182, 2001.
20. L. Rauchwerger and D. Padua. The LRPD test: Speculative run-time parallelization of loops with privatization and reduction parallelization. In PLDI, pages 218-232, 1995.
21. T. Yasue et al. Structural path profiling: An efficient online path profiling framework for just-in-time compilers. J. Instruction Level Parallelism, 6:1-28, 2004.
22. Z. Du et al. A cost-driven compilation framework for speculative parallelization of sequential programs. In PLDI, pages 59-69, 2004.