What question did this study set out to answer?

The aim is to enhance the parallelization of imperative programs through improved interprocedural heap analysis.

December 30, 2002

Interprocedural heap analysis for parallelizing imperative programs

View Full Paper

Ask AI

Bookmark

Authors

Randomized trial analyzes heap data structures to improve parallelization in imperative programs, highlighting algorithm enhancements.

The aim is to enhance the parallelization of imperative programs through improved interprocedural heap analysis.
Developed a new interprocedural heap analysis algorithm with summary nodes involving recursion.
Implemented the analysis on a low-level intermediate language.
Modified a propagation method to address inaccuracies in the original algorithm.
Successfully handled arbitrary call graphs including recursion for heap data structures.
Demonstrated effective parallelization of loops and recursions based on the information derived from the analysis.

Aßman et al. (2002) studied this question.

View Full Paper

Ask AI

Bookmark