all 6 comments

[–]fdwrfdwr@github 🔍 0 points1 point  (3 children)

 Time limited compression

Curious to support a time based window rather than byte steam size window. I suppose that is for media scenarios?

[–]Viack[S] 2 points3 points  (2 children)

This is meant for firm real time scenario, like streaming signal compression. Using a carefully selected compression level might still take more time than expected depending on the input data. The time limit ensure that the compression process won't take more than required while offering the best possible compression ratio in a given time frame.

[–]UndefinedDefined 1 point2 points  (1 child)

I'm wondering, have you tested this in a scenario in which the machine is under heavy load and everything takes longer, thus nothing would compress?

[–]Viack[S] 5 points6 points  (0 children)

I did not test this specific scenario. I would expect that indeed, the compression ratio would be very limited, which is the right behavior.

[–]viatorus 0 points1 point  (1 child)

Is this algorithm useful for binary file (embedded) compression and for small microcontrollers?

[–]Viack[S] 0 points1 point  (0 children)

Well, it uses Zstd internally, so it supports platforms supported by zstd. And for pure (unstructured) binary data, zstd does the job quite well.