Profiling java programs for parallelism

Proceedings of the 2009 ICSE Workshop on Multicore Software Engineering, IWMSE 2009

Volumn , Issue , 2009, Pages 49-55

  Hammacher, Clemens ^a   Streit, Kevin ^a   Hack, Sebastian ^a   Zeller, Andreas ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC DATA; JAVA PROGRAM; MULTICORE ARCHITECTURES; PARALLELIZATIONS; SPECULATIVE PARALLELIZATION;

JAVA PROGRAMMING LANGUAGE; LEGACY SYSTEMS; MANAGEMENT INFORMATION SYSTEMS;

COMPUTER SOFTWARE;

EID: 70349743829     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IWMSE.2009.5071383     Document Type: Conference Paper

References (12)

1. S. M. Blackburn, R. Garner, C. Hoffman, A. M. Khan, K. S. McKinley, R. Bentzur, A. Diwan, D. Feinberg, D. Frampton, S. Z. Guyer, M. Hirzel, A. Hosking, M. Jump, H. Lee, J. E. B. Moss, A. Phansalkar, D. Stefanović, T. VanDrunen, D. von Dincklage, and B.Wiedermann. The DaCapo benchmarks: Java benchmarking development and analysis. In OOPSLA '06: Proceedings of the 21st annual ACM SIGPLAN conference on Object-Oriented Programing, Systems, Languages, and Applications, pages 169-190, New York, NY, USA, Oct. 2006. ACM Press.
2. M. J. Bridges, N. Vachharajani, Y. Zhang, T. Jablin, and D. I. August. Revisiting the sequential programming model for the multicore era. IEEE Micro, January 2008.
3. A. Darte, Y. Robert, and F. Vivien. Scheduling and Automatic Parallelization. Birkhäuser, 2000.
4. C. Hammacher. Design and implementation of an efficient dynamic slicer for Java. Bachelor's Thesis, November 2008.
5. T. Harris and S. Singh. Feedback directed implicit parallelism. In ICFP '07: Proceedings of the 12th ACM SIGPLAN international conference on Functional programming, pages 251-264, New York, NY, USA, 2007. ACM.
6. C. G. Nevill-Manning and I. H. Witten. Linear-time, incremental hierarchy inference for compression. In Data Compression Conference, 1997. DCC '97. Proceedings, pages 3-11, 1997.
7. G. Ramalingam. On loops, dominators, and dominance frontiers. ACM Trans. Program. Lang. Syst., 24(5):455-490, 2002.
8. S. Rul, H. Vandierendonck, and K. D. Bosschere. Extracting coarse-grain parallelism in general-purpose programs. In Proceedings of the 2008 ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 281-282, Salt Lake City, Feb. 2008.
9. W. Thies, V. Chandrasekhar, and S. Amarasinghe. A practical approach to exploiting coarse-grained pipeline parallelism in c programs. In MICRO '07: Proceedings of the 40th Annual IEEE/ACM International Symposium on Microarchitecture, pages 356-369, Washington, DC, USA, 2007. IEEE Computer Society.
10. C. von Praun, L. Ceze, and C. Casçaval. Implicit parallelism with ordered transactions. In PPoPP '07: Proceedings of the 12th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 79-89, New York, NY, USA, 2007. ACM.
11. T. Wang and A. Roychoudhury. Using compressed bytecode traces for slicing Java programs. In ACM/IEEE International Conference on Software Engineering (ICSE), pages 512-521, 2004.
12. X. Zhang, R. Gupta, and Y. Zhang. Precise dynamic slicing algorithms. In IEEE/ACM International Conference on Software Engineering, pages 319-329, 2003.