Call graph construction in object-oriented languages
Proceedings of the 12th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Experiences tuning SMG98: a semicoarsening multigrid benchmark based on the hypre library
ICS '02 Proceedings of the 16th international conference on Supercomputing
Reconsidering custom memory allocation
OOPSLA '02 Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Performance Optimization for Large Scale Computing: The Scalable VAMPIR Approach
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
Gprof: A call graph execution profiler
SIGPLAN '82 Proceedings of the 1982 SIGPLAN symposium on Compiler construction
A new data compression technique for event based program traces
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartIII
Visualization of repetitive patterns in event traces
PARA'06 Proceedings of the 8th international conference on Applied parallel computing: state of the art in scientific computing
Trace-based performance analysis for the petascale simulation code FLASH
International Journal of High Performance Computing Applications
Statistical methods for automatic performance bottleneck detection in MPI based programs
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I
New algorithms for performance trace analysis based on compressed complete call graphs
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II
Seshat collects MPI traces: extended abstract
PVM/MPI'07 Proceedings of the 14th European conference on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Towards I/O analysis of HPC systems and a generic architecture to collect access patterns
Computer Science - Research and Development
| Hi-index | 0.00 |
The paper presents a new compressible memory data structure for trace events. Its primary intention is to aid the analysis of huge traces by reducing the memory requirements significantly. Furthermore, customized evaluation algorithms reduce the computational effort. The data structure as well as algorithms for construction and evaluation are discussed in detail. Experiments with real-life traces demonstrate the theoretically derived capabilities of the new approach.