The 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“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