Ignore:
Timestamp:
Aug 31, 2011, 7:47:40 PM (8 years ago)
Author:
ksherdy
Message:
 
File:
1 edited

Legend:

Unmodified
Added
Removed
  • docs/HPCA2012/01-intro.tex

    r1413 r1421  
    3333(parsers/finite state machines) that is considered to be the hardest
    3434application class to parallelize~\cite{Asanovic:EECS-2006-183}. We
    35 present Parabix, a novel execution framework and software run-time
     35present Parabix, a novel execution framework and software runtime
    3636environment that can be used to dramatically improve the efficiency of
    3737text processing and parsing on commodity processors.  Parabix
     
    9494Overall we make the following contributions:
    9595
    96 1) We outline the Parabix architecture, tool chain and run-time
     961) We outline the Parabix architecture, tool chain and runtime
    9797environment and describe how it may be used to produce efficient
    9898XML parser implementations on a variety of commodity processors.
     
    124124parsing and provides insight into the inefficiency of traditional
    125125parsers.  Section~\ref{section:parabix} describes the Parabix
    126 architecture, tool chain and run-time environment.
     126architecture, tool chain and runtime environment.
    127127Section~\ref{section:parser} describes the our design of an XML parser
    128128based on the Parabix framework.  Section~\ref{section:baseline}
Note: See TracChangeset for help on using the changeset viewer.