• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Performance Analysis of Optimized Code

Performance Analysis of Optimized Code

Paperback

General Computers

ISBN10: 3639079949
ISBN13: 9783639079944
Publisher: Blues Kids Of Amer
Published: Sep 3 2008
Pages: 96
Weight: 0.31
Height: 0.20 Width: 6.00 Depth: 9.00
Language: English
Modern applications frequently employ sophisticated object-oriented design. In these codes, deep loop nests are often spread across multiple routines. To achieve high performance, such codes rely on compilers to inline routines and optimize loops. Consequently, to effectively interpret performance, transformed loops must be understood in the calling context of transformed routines. *** To understand the performance of optimized object-oriented code, we describe how to analyze optimized object code and its debugging sections to recover its program structure and reconstruct a mapping back to its source code. Using this mapping, we combine the recovered static program structure with dynamic call path profiles to expose inlined frames and loop nests. Experiments show that performance visualizations based on this information provide unique insight into the performance of complex object-oriented codes written in C++. *** This work should be of interest to performance tools developers and, more broadly, application developers who care about performance. It is implemented in Rice University's HPCToolkit, a performance analysis toolkit.

Also in

General Computers