Re: Sparse Matrix-Vector Multiply (again) and Bit-Vector Compression


Hi all,

If I use EDIV to compute SpMV y = A * x as size r * c blocks, I might have to load size r of y and size c of x, these are shorter than VL = r * c, is there an efficient way to do this by current support?

If I would like to use a mask to compress, for VL = 16, I can store 16-bit value to memory and load it to GPR, then how can I transform it to a vector mask?

Thank you,

Join { to automatically receive all group messages.