XARK: An extensible framework for automatic recognition of computational kernels

ACM Transactions on Programming Languages and Systems

Volumn 30, Issue 6, 2008, Pages

  Arenaz, Manuel ^a   Tourĩo, Juan ^a   Doallo, Ramon ^a  

^a UNIVERSITY OF A CORUÑA   (Spain)

Author keywords

Automatic kernel recognition; Demand driven algorithms; Gated single assignment; Strongly connected component; Symbolic analysis; Use def chains

Indexed keywords

ARSENIC; BENCHMARKING; CODES (SYMBOLS); PARTIAL DIFFERENTIAL EQUATIONS;

AUTOMATIC KERNEL RECOGNITION; DEMAND-DRIVEN ALGORITHMS; GATED SINGLE ASSIGNMENT; STRONGLY CONNECTED COMPONENT; SYMBOLIC ANALYSIS; USE-DEF CHAINS;

PROGRAM COMPILERS;

EID: 56349135455     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/1391956.1391959     Document Type: Article

References (50)

1. AHO, A. V., LAM, M. S., SETHI, R., ANDULLMAN, J. D. 2006. Compilers: Principles, Techniques, and Tools, 2nd ed. Addison-Wesley, Reading, MA.
2. ALLEN, R. ANDKENNEDY, K. 2002. Optimizing Compilers for Modern Architectures: A Dependence-Based Approach. Morgan-Kaufmann, San Francisco, CA.
3. AMMARGUELLAT, Z. ANDHARRISON, W. L. 1990. Automatic recognition of induction and recurrence relations by abstract interpretation. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM, New York, 283-295.
4. ANDRADE, D., ARENAZ, M., FRAGUELA, B. B., TOURIÑO, J., ANDDOALLO, R. 2007. Automated and accurate cache behavior analysis for codes with irregular access patterns. Concur. Comput. Pract. Exper. 19, 18 (Dec), 2407-2423.
5. ARENAZ, M. 2003. Compiler framework for the automatic detection of loop-level parallelism. Ph.D. dissertation, Department of Electronics and Systems, University of A Coruña. (Available at http://www.des.udc.es/ ~arenaz/papers/phdthesis_arenaz.pdf.
6. ARENAZ, M., TOURIÑO, J., ANDDOALLO, R. 2003. A GSA-based compiler infrastructure to extract parallelism from complex loops. In Proceedings of the 17th International Conference on Super-computing. (San Francisco, CA). ACM, New York, 193-204.
7. ARENAZ, M., TOURIÑO, J., ANDDOALLO, R. 2004. Compiler support for parallel code generation through kernel recognition. In Proceedings of the 18th International Parallel and Distributed Processing Symposium (Santa Fe, NM). IEEE Computer Society Press, Los Alamitos, CA.
8. BALLANCE, R. A., MACCABE, A. B., ANDOTTENSTEIN, K. J. 1990. The program dependence web: A representation supporting control, data, and demand-driven interpretation of imperative languages. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM, New York, 257-271.
9. BANK, R. E. 2007. PLTMGpackage. Available at http://cam.ucsd.edu/~reb/software.html.
10. BERRY, M., CHEN, D., KOSS, P., KUCK, D., POINTER, L., LO, S., PANG, Y., ROLOFF, R., SAMEH, A., CLEMENTI, E., CHIN, S., SCHNEIDER, D., FOX, G., MESSINA, P., WALKER, D., HSIUNG, C., SCHWARZMEIER, J., LUE, K., ORZAG, S., SEIDL, F., JOHNSON, O., SWANSON, G., GOODRUM, R., ANDMARTIN, J. 1989. The Perfect Club benchmarks: Effective performance evaluation of supercomputers. Int. J. Supercomput. Apps. 3, 3, 5-40.
11. BHANSALI, S. ANDHAGEMEISTER, J. R. 1995. A pattern matching approach for reusing software libraries in parallel systems. In Proceedings of Workshop on Knowledge Based Systems for the Reuse of Program Libraries (Sophia Anthipolis, France).
12. BLUME, W., DOALLO, R., EIGENMANN, R., GROUT, J., HOEFLINGER, J., LAWRENCE, T., LEE, J., PADUA, D. A., PAEK, Y., POTTENGER, W. M., RAUCHWERGER, L., ANDTU, R 1996. Parallel programming with Polaris. IEEE Computer 29, 12 (Dec), 78-82.
13. CALLAHAN, D. 1991. Recognizing and parallelizing bounded recurrences. In Proceedings of the 4th International Workshop on Languages and Compilers for Parallel Computing (Santa Clara, CA). Lecture Notes in Computer Science, vol. 589. Springer-Verlag, New York, 169-185.
14. CYTRON, R., FERRANTE, J., ROSEN, B. K., WEGMAN, M. N., ANDZADECK, F. K. 1991. Efficiently computing static single assignment form and the control dependence graph. ACM Trans. Program. Lang. Syst. 13, 4 (Oct.), 451-490.
15. DI MARTINO, B. ANDIANNELLO, G. 1996. PAP recognizer: A tool for automatic recognition of parallelizable patterns. In Proceedings of the 4th International Workshop on Program Comprehension (Berlin, Germany). IEEE Computer Society Press, Los Alamitos, CA, 164-174.
16. FAHRINGER, T ANDSCHOLZ, B. 2000. A unified symbolic evaluation framework for parallelizing compilers. IEEE Trans. Parallel Dist. Syst. 11, 11 (Nov.), 1105-1125.
17. FAIGIN, K. A., WEATHERFORD, S. A., HOEFLINGER, J. P., PADUA, D. A., ANDPETERSEN, R M. 1994. The Polaris internal representation. Int. J. Parall. Prog. 22, 5 (Oct.), 553-586.
18. FISHER, A. L. ANDGHULOUM, A. M. 1994. Parallelizing complex scans and reductions. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (Orlando, FL). ACM, New York, 135-146.
19. GCC INTERNALS. GNU Compiler Collection Internals (GCC). Available at http://gcc.gnu.org/onlinedocs/gccint.pdf.
20. GERLEK, M. P., STOLTZ, E., ANDWOLFE, M. 1995. Beyond induction variables: Detecting and classifying sequences using a demand-driven SSA. ACM Trans. Program. Lang. Syst. 17, 1 (Jan.), 85-122.
21. HAGHIGHAT, M. R. ANDPOLYCHRONOPOULOS, C. D. 1996. Symbolic analysis for parallelizing compilers. ACM Trans. Program. Lang. Syst. 18, 4 (July), 477-518.
22. HARANDI, M. T. ANDNING, J. Q. 1990. Knowledge-based program analysis. IEEE Softw. 7, 1, 74-81.
23. JOUVELOT, R ANDDEHBONEI, B. 1989. A unified semantic approach for the vectorization and parallelization of generalized reductions. In Proceedings of the 3rd International Conference on Supercomputing (Heraklion, Crete). ACM, New York, 186-194.
24. KEßLER, C. W. 1996. Pattern-driven automatic parallelization. Scient. Progr. 5, 3, 251-274.
25. KEßLER, C. W. ANDSMITH, C. 1999. The SPARAMAT approach to automatic comprehension of sparse matrix computations. In Proceedings of the 7th International Workshop on Program Comprehension (Pittsburgh, PA). IEEE Computer Society Press, Los Alamitos, CA, 200-207.
26. KNOBE, K. ANDSARKAR, V. 1998. Array SSA form and its use in parallelization. In Proceedings of the 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (San Diego, CA). ACM, New York, 107-120.
27. KNOBE, K. ANDSARKAR, V. 2000. Enhanced parallelization via analyses and transformations on Array SSA form. In Proceedings of the 8th International Workshop on Compilers for Parallel Computers (Aussois, France).
28. KOZACZYNSKL, W., NING, J. Q., ANDENGBERTS, A. 1992. Program concept recognition and transformation. IEEE Trans. Softw. Eng. 18, 12, 1065-1075.
29. LIN, Y. ANDPADUA, D. A. 1998. On the automatic parallelization of sparse and irregular Fortran programs. In Proceedings of the 4th International Workshop on Languages, Compilers, and RunTime Systems for Scalable Computers (Pittsburgh, PA). Lecture Notes in Computer Science, vol. 1511. Springer-Verlag, New York, 41-56.
30. MERRILL, J. 2003. GENERIC and GIMPLE: A new tree representation for entire functions. In Proceedings of the 2003 GCC Developers Summit. 171-180. (Available at http://www.gccsummit.org/2003.
31. METZGER, R. 1995. Automated recognition of parallel algorithms in scientific applications. In IJCAI-95 Workshop Program Working Notes: "The Next Generation of Plan Recognition Systems".
32. MUCHNICK, S. S. 1997. Advanced, Compiler Design and Implementation. Morgan-Kaufmann, San Francisco, CA.
33. PAUL, S. ANDPRAKASH, A. 1994. A framework for source code search using program patterns. IEEE Trans. Softw. Eng. 20, 6, 463-475.
34. PINTER, S. S. ANDPINTER, R. Y 1994. Program optimization and parallelization using idioms. ACM Trans. Program,. Lang. Syst. 16, 3 (May), 305-327.
35. POTTENGER, W. M. ANDEIGENMANN, R. 1995. Idiom recognition in the Polaris parallelizing compiler. In Proceedings of the 9th International Conference on Supercomputing (Barcelona, Spain). ACM, New York, 444-448.
36. REDON, X. ANDFEAUTRIER, R 1993. Detection of recurrences in sequential programs with loops. In Proceedings of the 5th International Parallel Architectures and Languages Europe Conference (Munich, Germany). Lecture Notes in Computer Science, vol. 694. Springer-Verlag, New York, 132-145.
37. SAAD, Y. 1994. SPARSKIT: A Basic Tool Kit for Sparse Matrix Computations (Version 2). (Available at http://www.cs.umn.edu/~saad/ software/SPARSKIT/sparskit.html.
38. SABOT, G. ANDWHOLEY, S. 1993. CMAX: A Fortran translator for the connection machine system. In Proceedings of the 7th International Conference on Supercomputing (Tokyo, Japan). ACM, New York, 147-156.
39. SPEC. SPEC CPU2000. Standard Performance Evaluation Corporation. Available at http://www.spec.org/cpu2000/.
40. SUGANUMA, T., KOMATSU, H., ANDN AKATANI, T. 1996. Detection and global optimization of reduction operations for distributed parallel machines. In Proceedings of the 10th International. Conference on Supercomputing (Philadelphia, PA). ACM, New York, 18-25.
41. TARJAN, R. E. 1972. Depth-first search and linear graph algorithms. SIAM J. Comput. 1, 2 (June), 146-160.
42. TU, R ANDPADUA, D. A. 1995. Gated SSA-based demand-driven symbolic analysis for parallelizing compilers. In Proceedings of the 9th International Conference on Supercomputing (Barcelona, Spain). ACM, New York, 414-423.
43. VAN ENGELEN, R. 2001. Efficient symbolic analysis for optimizing compilers. In Proceedings of the 10th International Conference on Compiler Construction (Genova, Italy). Lecture Notes in Computer Science, vol. 2027. Springer-Verlag, New York, 118-132.
44. VAN ENGELEN, R., BIRCH, J., SHOU, Y., WALSH, B., ANDGALLIVAN, K. 2004. A unified framework for nonlinear dependence testing and symbolic analysis. In Proceedings of the 18th International Conference on Supercomputing (Saint Malo, France). ACM, New York, 106-115.
45. WILLS, L. M. 1990. Automated program recognition: A feasibility demonstration. Artif. Intell. 45, 1-2, 113-171.
46. WOLFE, M. 1996. High Performance Compilers for Parallel Computing. Addison-Wesley, Reading, MA.
47. WU, P., COHEN, A., HOEFLINGER, J., ANDPADUA, D. A. 2001. Monotonie evolution: An alternative to induction variable substitution for dependence analysis. In Proceedings of the 15th International Conference on Supercomputing (Sorrento, Italy). ACM, New York, 78-91.
48. ZHANG, F. ANDD'HOLLANDER, E. H. 1994. Enhancing parallelism by removing cyclic data dependencies. In Proceedings of the 6th International Parallel Architectures and Languages Europe Conference (Athens, Greece). Lecture Notes in Computer Science, vol. 817. Springer-Verlag, New York, 387-397.
49. ZIMA, E. V. 1986. Automatic construction of systems of recurrence relations. USSR Comput. Math. Math. Phys. 24, 11-12, 193-197.
50. ZIMA, E. V. 1995. Simplification and optimization transformations of chains of recurrences. In Proceedings of the 8th International Symposium on Symbolic and Algebraic Computation (Montreal, Ont., Canada). ACM New York, 42-50.