Automating parallel runtime optimizations using post-mortem analysis

Sanjeev Krishnan, Laxmikant V. Kale

Research output: Contribution to conferencePaperpeer-review


Attaining good performance for parallel programs frequently requires substantial expertise and effort, which can be reduced by automated optimizations. In this paper we concentrate on run-time optimizations and techniques to automate them without programmer intervention, using post-mortem analysis of parallel program execution. We classify the characteristics of parallel programs with respect to object placement (mapping), scheduling and communication, then describe techniques to discover these characteristics by post-mortem analysis, present heuristics to choose appropriate optimizations based on these characteristics, and describe techniques to generate concise hints to runtime optimization libraries. Our ideas have been developed in the framework of the Paradise post-mortem analysis tool for the parallel object-oriented language Charm++. We also present results for optimizing simple parallel programs running on the Thinking Machines CM-5.

Original languageEnglish (US)
Number of pages8
StatePublished - 1996
EventProceedings of the 1996 International Conference on Supercomputing - Philadelphia, PA, USA
Duration: May 25 1996May 28 1996


OtherProceedings of the 1996 International Conference on Supercomputing
CityPhiladelphia, PA, USA

ASJC Scopus subject areas

  • Computer Science(all)


Dive into the research topics of 'Automating parallel runtime optimizations using post-mortem analysis'. Together they form a unique fingerprint.

Cite this