In case anyone is interested...for some reason the HPC community is in love with Python (SciPy, etc) - probably because it reminds them of Fortran, but whatever:). From the PDL list, here's an interesting opportunity.
I don't know much about implementing a regex engine such as the one in Perl, but in terms of the underlying formal methods for creating NFAs & DFAs, a CUDA interface could make it things very fast - maybe even by matching non-deterministically (breadth-first, first match "wins"). Brett ----- Forwarded message from David Mertens <[email protected]> ----- Date: Fri, 5 Aug 2011 06:45:51 -0500 From: David Mertens <[email protected]> To: perldl <[email protected]>, PDL Porters <[email protected]> Subject: [Perldl] Recruiting for CUDA Regex Hey everybody, this is slightly off topic but... After putting my minimal CUDA bindings out on Github (hopefully they'll get on CPAN soon), I was approached about implementing a regular expression engine on CUDA. I am working to quickly assemble a team of developers for this project and would like to get to beta in a few months. If this sounds interesting to you, please contact me. If you know somebody who might be interested, please have them contact me or give me their email address so I can write them. Thanks! David P.S. This is not PDL related, but it is CUDA related. Anything that furthers Perl + CUDA is likely to be good for scientific computing with Perl, which will hopefully benefit PDL in one form or another. _______________________________________________ Perldl mailing list [email protected] http://mailman.jach.hawaii.edu/mailman/listinfo/perldl ----- End forwarded message ----- -- B. Estrade <[email protected]> _______________________________________________ Houston mailing list [email protected] http://mail.pm.org/mailman/listinfo/houston Website: http://houston.pm.org/
