Hi, I'm interested in speeding up compression for mksquashfs, which uses independent blocks of input length 2**17 bytes. I have in mind a specialized match finder which would take advantage of the small fixed block size, and tailor its memory usage to the common L2 cache size of 256KB. Is anyone else looking into this?
--
