You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
bzip2 is by now long superseded by other algorithms that provide better ratios for a fraction of the cost in terms of CPU, cspeed and dspeed.
Some alternatives are lzma, lzma2, and fast-lzma2, an lzma2 version with a fast match finder based on a radix sort. It can compress about ~2 - 3x times faster than lzma2, use much less memory, and efficiently utilize all CPU threads available for a negligible increase in memory (as opposed to conventional xz algorithms where every thread needs to have its own memory pool). The drawback is some ~1 - 2% less compression for single-threaded applications (but can have a much better ratio with big blocks compressed using several threads).
Decompression speed is about the same as lzma2.
bzip2 is by now long superseded by other algorithms that provide better ratios for a fraction of the cost in terms of CPU, cspeed and dspeed.
Some alternatives are lzma, lzma2, and fast-lzma2, an lzma2 version with a fast match finder based on a radix sort. It can compress about ~2 - 3x times faster than lzma2, use much less memory, and efficiently utilize all CPU threads available for a negligible increase in memory (as opposed to conventional xz algorithms where every thread needs to have its own memory pool). The drawback is some ~1 - 2% less compression for single-threaded applications (but can have a much better ratio with big blocks compressed using several threads).
Decompression speed is about the same as lzma2.
https://github.com/conor42/fast-lzma2
The text was updated successfully, but these errors were encountered: