source: docs/ICA3PP2015/conclusion.tex @ 5433

Last change on this file since 5433 was 4497, checked in by cameron, 5 years ago


File size: 927 bytes
3\icGrep{} demonstrates that predictable high-performance Unicode regular
4expression search can be achieved using a systematically parallel approach
5based on bitwise data parallelism.   On modern commodity processors with
6SSE2 or better SIMD instruction sets, performance is dramatically better
7than that achievable using sequential state-transition methods based on DFAs, NFAs
8or backtracking.   Multithread parallelism further enhances performance using
9a pipeline parallelism model.
11Future research includes the investigation of regular expression matching techniques
12to handle Unicode level 2 and 3 requirements as well as the extension of
13optimization techniques to take advantage of MatchStar for more complex repetitions.
14Beyond regular expression matching, investigation of the bitwise data parallel model
15for other demanding Unicode processing tasks also seems worthwhile.
Note: See TracBrowser for help on using the repository browser.