The Java profiler based on byte code analysis and instrumentation for many-core hardware accelerators

• Autorzy: Pietroń M. , Karwatowski M. , Wiatr K.
• Języki publikacji: EN

Abstrakty

EN

One of the most challenging issues in the case of many and multi-core architectures is how to exploit their potential computing power in legacy systems without a deep knowledge of their architecture. The analysis of static dependence and dynamic data dependences of a program run, can help to identify independent paths that could have been computed by individual parallel threads. The statistics of reusing the data and its size is also crucial in adapting the application in GPU many-core hardware architecture because of specific memory hierarchies. The proposed profiling system accomplishes static data analysis and computes dynamic dependencies for Java programs as well as recommends parts of source code with the highest potential for parallelization in GPU. Such an analysis can also provide starting point for automatic parallelization.

Słowa kluczowe

EN

virtual machine; CUDA; GPU; profiling; parallel computing

• Wydawca: Wydawnictwo PAK
• Czasopismo: Measurement Automation Monitoring
• Rocznik: 2015
• Tom: Vol. 61, No. 7
• Strony: 385--387
• Opis fizyczny: Bibliogr. 13 poz., rys., schem., tab.

Twórcy

autor

Pietroń M.

• AGH University of Science and technology, 30 Mickiewicza Ave., 30-059 Krakow, Poland
• ACC CYFRONET AGH, 11 Nawojki St., 30-950 Krakow, Poland

autor

Karwatowski M.

• AGH University of Science and technology, 30 Mickiewicza Ave., 30-059 Krakow, Poland
• ACC CYFRONET AGH, 11 Nawojki St., 30-950 Krakow, Poland

autor

Wiatr K.

• AGH University of Science and technology, 30 Mickiewicza Ave., 30-059 Krakow, Poland
• ACC CYFRONET AGH, 11 Nawojki St., 30-950 Krakow, Poland

Bibliografia

• [1] BCEL tool - https://commons.apache.org/proper/commons-bcel/
• [2] Baskaran M., Bondhugula U., Krishnamoorthy S., Ramanujam J., Rountev A., and Sadayappan P.: A compiler framework for optimization of affine loop nests for gpgpus. In ICS’08: Proceedings of the 22nd annual international conference on Supercomputing, pp. 225-234, New York, NY, USA, 2008. ACM.
• [3] Verdoolaege S., Isl: An integer set library for the polyhedral model. Mathematical Software – ICMS 2010. Lecture Notes in Computer Science Series, vol. 6327. Springer, pp. 299-302.
• [4] Verdoolaege S., Grosser T.. Polyhedral extraction tool. IMPACT 2012, Paris, France.
• [5] NVIDIA CUDA Programming Guide 7.0. Nvidia Corporation.
• [6] Bridges M. J., Vachharajani N., Zhang Y., Jablin T., and August D.I.: Revisiting the sequential programming model for the multicore era. Proceedings of the 40th Annual IEEE/ACM International Symposium on Microarchitecture, pp. 69-84, January 2008.
• [7] Harris T. and Singh S.: Feedback directed implicit parallelism. In ICFP’07: Proceedings of the 12th ACM SIGPLAN international conference on functional programming, pp. 251-264, New York, NY, USA, 2007.
• [8] Rul S., Vandierendonck H., and Bosschere K. D.: Extracting coarse-grain parallelism in general-purpose programs. In Proceedings of the 2008 ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 281-282, Salt Lake City, Feb. 2008.
• [9] Thies W., Chandrasekhar V., and Amarasinghe S.: 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, pp. 356-369, Washington, DC, USA, 2007. IEEE Computer Society.
• [10] von Praun C., Ceze L., and Cascaval C.: Implicit parallelism with ordered transactions. Proceedings of the 12th ACM SIGPLAN Symposium on Principles and Practices of Parallel Programming, pp. 79-89, New York, NY, USA, 2007, ACM.
• [11] Baskaran M., Ramanujam J., and Sadayappan P.: Automatic c-to-cuda code generation for affine programs. In Proceedings of the International Conference on Compiler Constructions, number 6011 in Lecture Notes in Computer Science, pp. 244-263. Springer-Verlag, March 2010.
• [12] Feautrier P.: Dataflow analysis of array and scalar references. International Journal of Parallel Programming, vol. 20, pp. 23-53, 1991.
• [13] Feautrier P.: Some efficient solutions to the affine scheduling problem. International Journal of Parallel Programming, vol. 21, pp. 313-347, 1992.