Code Optimization for Code Compression

With the emergence of software delivery platforms such as Microsoft’s .NET, reduced size of transmitted binaries has become a very important system parameter strongly affecting system performance. In this paper, we present two novel pre-processing steps for code compression that explore program binaries’ syntax and semantics to achieve superior compression ratios. The first preprocessing step involves heuristic partitioning of a program binary into streams with high auto-correlation. The second preprocessing step uses code optimization via instruction rescheduling in order to improve prediction probabilities for a given compression engine. We have developed three heuristics for instruction rescheduling that explore tradeoffs of the solution quality versus algorithm run-time. The pre-processing steps are integrated with the generic paradigm of prediction by partial matching (PPM) which is the fundament of our compression codec. The compression algorithm is implemented for x86 bina...

• Type: Conference
• Year: 2003
• Where: CGO
• Authors: Milenko Drinic, Darko Kirovski, Hoi Vo
• Keywords: CGO 2003, Compression Codec, Pre-processing Steps, Preprocessing Step, Software Engineering