Rzip - A new compression star is born

Remember when Bzip first came out and out-compressed Gzip\? Well, then came LZMA with another significant increase in compression ration a bit later. And then one of the authors of Samba, Andrew Tridgell, developed a new compression algorithm called Rzip. It compresses even more efficient, though it needs large amounts (may be 1 GB) of memory to do so. And now Con Kolivas, author of the great Desktop Latency patches including the BFS scheduler and the man who designed the current kernel scheduler (though another implementation of his design was used), took it to himself to further develop the rzip algorithm. And the results are quite promising: The linux kernel is compressed about 3 times as fast as with LZMA2 with just 2 percent difference in final size. I look forward to this going downstream into end-user desktop software.

Update: Con just commented with a link to more detailed and accurate lrzip statistics.

3 comments:

  1. wow! quite a difference... compressing and uncompressing package in arch takes hell of a time.. i hope this makes it into the default package comression format

    ReplyDelete
  2. Thanks for linking my post about lrzip. I find it interesting that a few graphs get attention when I have a page full of benchmarks for lrzip that show more accurately where and how lrzip is beneficial compared to xz or even the multithreaded 7z.

    README.benchmarks

    ReplyDelete
  3. Thanks for noticing! Yes, but don't we all love to see dry numbers to be wrapped in pretty graphics? :D
    But it can be quite time consuming and a pain as I just found out: http://linux-tipps.blogspot.com/2011/05/graphing-power-management-statistics.html

    ReplyDelete

I appreciate comments. And I do read them.