Algorithms for pattern matching
Software—Practice & Experience
Introduction to algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Computer Algorithms: String Pattern Matching Strategies
Computer Algorithms: String Pattern Matching Strategies
Performance Optimization for Large Scale Computing: The Scalable VAMPIR Approach
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
Compressible memory data structures for event-based trace analysis
Future Generation Computer Systems
Scalable event-based performance measurement in high-end environments
ACM SIGMETRICS Performance Evaluation Review
Evaluating similarity-based trace reduction techniques for scalable performance analysis
Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
Compressible memory data structures for event-based trace analysis
Future Generation Computer Systems
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
Trace profiling: Scalable event tracing on high-end parallel systems
Parallel Computing
| Hi-index | 0.00 |
The paper presents an innovative solution to the problem of the very huge data sets that are regularly produced by performance tracing techniques - especially on HPC programs. It designs an adapted data compression scheme that takes advantage of regularities frequently found in program traces. Algorithms to reveal repetition patterns in a programs call structure and run time behavior are discussed in detail, solutions to some problems arising on practical application are addressed as well. Two examples demonstrate the capabilities of the approach and document its behavior. Finally, some thoughts are given regarding how the patterns revealed in the process of data compression may assist the automatic analysis of traces.