摘要: The paper presents an innovative solution to the problem of very huge data sets that are regularly produced by performance tracing techniques - especially on HPC programs. It designs adapted compression scheme takes advantage regularities frequently found in program traces. Algorithms reveal repetition patterns a programs call structure and run time behavior discussed detail, solutions some problems arising practical application addressed as well. Two examples demonstrate capabilities approach document its behavior. Finally, thoughts given regarding how revealed process may assist automatic analysis