Therefore we have to use wiser algorithms, which usually wouldn’t work that good on a classic GPU. The problem is that huffman based algorithms are more efficient on big matrix, so you could lose the beneficial effect by choosing too big a(i) square matrix. Up to today compression algorithms has been thought to work on a single CISC cpu, but this doesn’t mean that we can’t have better, faster algorithms on GPGPU.įor simplicity, think a file of n^2 bits as a A=n*n square matrix (eventually filled with zeros at the end).Ī stupid way to do this is to divide A in smaller a(i) square matrix, then apply a traditional compression to every matrix.
0 kommentar(er)
