Kremlin: like gprof, but for parallelization

Authors:
Donghwan Jeon;Saturnino Garcia;Chris Louie;Sravanthi Kota Venkata;Michael Bedford Taylor
Affiliations:
University of California, San Diego, La Jolla, USA;University of California, San Diego, La Jolla, USA;University of California, San Diego, La Jolla, USA;University of California, San Diego, La Jolla, USA;University of California, San Diego, La Jolla, USA
Venue:
Proceedings of the 16th ACM symposium on Principles and practice of parallel programming
Year:
2011

Citing 2
Cited 6

Measuring Parallelism in Computation-Intensive Scientific/Engineering Applications

IEEE Transactions on Computers
The Cilk++ concurrency platform

Proceedings of the 46th Annual Design Automation Conference

Kremlin: rethinking and rebooting gprof for the multicore age

Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
Parkour: parallel speedup estimates for serial programs

HotPar'11 Proceedings of the 3rd USENIX conference on Hot topic in parallelism
Kismet: parallel speedup estimates for serial programs

Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
Fast loop-level data dependence profiling

Proceedings of the 26th ACM international conference on Supercomputing
Multi-slicing: a compiler-supported parallel approach to data dependence profiling

Proceedings of the 2012 International Symposium on Software Testing and Analysis
Detection and analysis of resource usage anomalies in large distributed systems through multi-scale visualization

Concurrency and Computation: Practice & Experience

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper overviews Kremlin, a software profiling tool designed to assist the parallelization of serial programs. Kremlin accepts a serial source code, profiles it, and provides a list of regions that should be considered in parallelization. Unlike a typical profiler, Kremlin profiles not only work but also parallelism, which is accomplished via a novel technique called hierarchical critical path analysis. Our evaluation demonstrates that Kremlin is highly effective, resulting in a parallelized program whose performance sometimes outperforms, and is mostly comparable to, manual parallelization. At the same time, Kremlin would require that the user parallelize significantly fewer regions of the program. Finally, a user study suggests Kremlin is effective in improving the productivity of programmers.