Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

article · 2004

Optimization techniques for irregular and pointer-based programs

Rafael Asenjo, Francisco Corbera, Eladio Gutiérrez, M.A. Navarro, Óscar Plata, Emilio L. Zapata

Cited by 3Abstract and details only

Abstract

Current compilers show inefficiencies when optimizing complex applications, both analyzing dependences and exploiting critical performance issues, like data locality and instruction/thread parallelism. Complex applications usually present irregular and/or dynamic (pointer-based) computational/data structures. By irregular we means applications that arrange data as multidimensional arrays and issue memory references through array indirections. Pointer-based applications, on the other hand, organize data as pointer-based structures (lists, trees, etc.) and issue memory references by means of pointers. We discuss optimization/parallelization and program analysis techniques we have developed to instruct a compiler to generate efficient object code from important classes of irregular and pointer-based applications. These techniques are embodied into a methodology that proceeds in three stages: program structure recognition, data analysis and program optimization/parallelization based on code/data transformations.

Cite this paper

APA 7

Asenjo, R., Corbera, F., Gutiérrez, E., Navarro, M., Plata, Ó., & Zapata, E. L. (2004). Optimization techniques for irregular and pointer-based programs. https://doi.org/10.1109/empdp.2004.1271420

MLA 9

Asenjo, Rafael, et al. “Optimization techniques for irregular and pointer-based programs.” vol. crpc tr94492, 2004, pp. 2–13, https://doi.org/10.1109/empdp.2004.1271420.

Chicago

Asenjo, Rafael, Francisco Corbera, Eladio Gutiérrez, M.A. Navarro, Óscar Plata, and Emilio L. Zapata. 2004. “Optimization techniques for irregular and pointer-based programs.” https://doi.org/10.1109/empdp.2004.1271420.

Harvard

Asenjo, R. et al. (2004) ‘Optimization techniques for irregular and pointer-based programs’. Available at: https://doi.org/10.1109/empdp.2004.1271420.

BibTeX
@article{asenjo2004optimization,
  title = {{Optimization techniques for irregular and pointer-based programs}},
  author = {Asenjo, Rafael and Corbera, Francisco and Gutiérrez, Eladio and Navarro, M.A. and Plata, Óscar and Zapata, Emilio L.},
  volume = {crpc tr94492},
  pages = {2--13},
  year = {2004},
  doi = {10.1109/empdp.2004.1271420}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Related papers