Treat specific condition.
General bottleneck is in compress algorithm.
Some is fast, but compressibility is low.
Some compresses algorithmic support to run paralell, can multi-line Cheng.
Treat specific condition.
General bottleneck is in compress algorithm.
Some is fast, but compressibility is low.
Some compresses algorithmic support to run paralell, can multi-line Cheng.
Use file compress. . . . This calculates do not be effective answer. . .
This should call @evilic bale, compression goal is not to let file decrescent
Keyword Parallel ZipHttps://www.nongnu.org/lzip/plzip.html
@deasty #3 I think to go to the lavatory transmit also be one of compression goals. . . E.g. , one by sheet piece the folder of a 500G that 4M size Jpg comprises is transmitted rise may let a person wait for ages, after compressing, when transmit speed is met very fast ah.
LZMZ2 can run multi-line Cheng
But bottleneck perhaps is IO. . .
@evilic you this demand hits a Tar to go, only IO serves as bottleneck
The time that the compressibility province that compresses the time of solution pressing to be more than that 5%3% absolutely comes down
Higher rate is cost with lower compression ratio normally, you need a basis balance of setting proper motion.
LZ can try Lz4, lzo
Pied Piper
You are worth to have [the hand uses dog head]
@zhujoen is not to be able to draw mouse
I feel the original poster’s problem, can instead, “What is there to compress software below Linux, is supportive multi-line Cheng compressed? “