4 ms·
The repeated patterns in the SIMD implementation (see https://github.com/lemire/FastPFor/blob/master/src/bitpacksimd.cpp#L649 https://github.com/lemire/FastPFor
by kevingadd 14y ago
The repeated patterns in the SIMD implementation (see https://github.com/lemire/FastPFor/blob/master/src/bitpacksimd.cpp#L649 https://github.com/lemire/FastPFor/blob/master/src/bitpacksi...) seem like they're dying for some simplification via macros. I can't imagine trying to spot a bug or typo in an implementation written out raw that way.
On the other hand, this seems like a pretty clever approach to improving compression for this space. SIMD is often underutilized.
- evincarofautumn 14y agoFactoring is the simplest way of making code better. It makes me uncomfortable to see loads of repetition like this.
- wmf 14y agoThis calls for a DSL like Halide.
- sedachv 14y agoThere's a couple of Common Lisp projects that generate SSE and CUDA code: http://common-lisp.net/project/sb-simd/ http://common-lisp.net/project/sb-simd/ https://github.com/angavrilov/cl-gpu https://github.com/angavrilov/cl-gpu CMUCL comes with SSE2. There hasn't been any effort to revive StarLisp or Paralations or NESL (http://www.cs.cmu.edu/~scandal/nesl.html http://www.cs.cmu.edu/~scandal/nesl.html) as libraries on top of that though. Not to be snarky, but the state of the art in data-parallel programming languages hasn't even caught up with NESL yet.