Ignore:
Timestamp:
Feb 2, 2015, 1:49:07 PM (4 years ago)
Author:
cameron
Message:

References

File:
1 edited

Legend:

Unmodified
Added
Removed
  • docs/Working/icGrep/introduction.tex

    r4446 r4448  
    1515single input stream is more difficult.  Indeed, the finite state machines (FSMs)
    1616underlying are considered the hardest to parallelize (embarassingly sequential)
    17 of the 13 dwarves identified in the Berkeley landscape of parallel computing research \cite{}.
     17of the 13 dwarves identified in the Berkeley landscape of parallel computing research \cite{asanovic2006landscape}.
    1818However, some success has been reported recently along two independent lines of
    1919research.   Mytkowicz...   Cameron/Parabix....
     
    2626a high-performance, full-featured open-source grep implementation
    2727with systematic support for Unicode regular expressions addressing the
    28 requirements of Unicode Technical Standard \#18 \cite{}.  As an alternative
     28requirements of Unicode Technical Standard \#18 \cite{davis2012unicode}.  As an alternative
    2929to classical grep implementations, ICgrep offers dramatic performance
    3030acceleration in ASCII-based and Unicode matching performance alike.
Note: See TracChangeset for help on using the changeset viewer.