
TL;DR
This paper proposes a method for compressing MIPS machine code by splitting instruction components into separate streams and compressing them individually, resulting in up to 10% better compression ratios than standard utilities.
Contribution
It introduces a novel filtering approach that leverages MIPS code structure to improve compression efficiency over traditional byte-based methods.
Findings
Up to 10% reduction in compressed size with gzip and bzip2.
Different stream splitting methods analyzed for effectiveness.
Simple filtering significantly improves compression ratios.
Abstract
MIPS machine code is very structured: registers used before are likely to be used again, some instructions and registers are used more heavily than others, some instructions often follow each other and so on. Standard file compression utilities, such as gzip and bzip2, does not take full advantage of the structure because they work on byte-boundaries and don't see the underlying instruction fields. My idea is to filter opcodes, registers and immediates from MIPS binary code into distinct streams and compress them individually to achieve better compression ratios. Several different ways to split MIPS code into streams are considered. The results presented in this paper shows that a simple filter can reduce final compressed size by up to 10 % with gzip and bzip2.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Parallel Computing and Optimization Techniques · Cellular Automata and Applications
