out-of-the-box #parallel sorting and #prefix-sum of arrays in #Java 8 for #performance.
on 02015-08-27A survey #paper of #parallel #prefix-sum #algorithms, finding that the Kogge-Stone algorithm is more common in #GPGPU code than Blelloch’s, and with handy diagrams so you can see what they’re talking about! Also they apparently wrote a thing to use #formal-methods to verify different implementations.
on 02015-08-15The Ladner & Fischer 1980 #paper on #parallel #algorithms for #finite-automata using #prefix-sum, with its unnecessary extra N² inefficiency compared to the N lg N in Hillis & Steele 1986. I think, anyway. I haven’t really read the paper.
on 02015-08-15#Algorithms for best #performance on a #parallel #prefix-sum in #CUDA for #GPGPU as of 2007.
on 02015-08-15“Data-Parallel Finite State Machines”: #parallel simulation of #finite-automata that are “up to 3× faster than optimized sequential implementations on a single processor” in #performance due to using #SIMD instructions. Seems to be some tweaks to the #prefix-sum thing Blelloch mentioned in his 1993 #paper, which they call “enumerative computation”? These algorithms are probably crucial to speeding up #CSV parsing.
on 02015-08-15