source:docs/Working/icGrep/Paper88.tex@4780

Last change on this file since 4780 was 4780, checked in by nmedfort, 3 years ago

Figure and table alignment

File size: 2.1 KB
RevLine
[4446]2\usepackage{tikz}
[4474]4\usepackage{pgfplots}
5\usepackage{pgfplotstable}
[4502]6\usepackage{booktabs,siunitx,ragged2e}
[4455]7\usepackage{subfig}
8\usepackage{amsmath}
9\newcommand{\BigO}[1]{\ensuremath{\operatorname{O}\bigl(#1\bigr)}}
10\usepackage[official]{eurosym}
11\usepackage[utf8]{inputenc}
[4780]12\usepackage{listings}
13\lstset{breaklines=true,basicstyle=\small\ttfamily}
[4779]14\usepackage{bbding}
[4455]15
[4472]16\newcommand{\comment}[1]{}
17\newcommand{\icGrep}[1]{icGrep}
18
[4476]19\def\RegularExpression{RegEx}
[4499]20\def\Pablo{Parabix}
[4476]21\def\CodeUnit{Code Unit}
22\def\REParser{\RegularExpression{} Parser}
23\def\CodeUnitCompiler{\CodeUnit{} Compiler}
24\def\RegularExpressionCompiler{\RegularExpression{} Compiler}
25\def\PabloCompiler{\Pablo{} Compiler}
[4472]26
[4779]27\pagestyle{empty}
[4476]28
[4446]29\begin{document}
30
[4550]31\title{Bitwise Data Parallelism with LLVM: The icGrep Case Study}
[4779]32\author{Robert D. Cameron \inst{1 (}\Envelope\inst{)}
33\and Nigel Medforth \inst{1}
34\and Dan Lin \inst{1}
35\and Dale Denis \inst{1}
36\and William N. Sumner \inst{1}
37}
38\institute{School of Computing Science, Simon Fraser University}
[4446]39\maketitle
40
41\begin{abstract}
[4550]42Bitwise data parallelism using short vector (SIMD) instructions has recently been shown to have considerable promise
[4446]43as the basis for a new, fundamentally parallel, style of regular expression
[4550]44processing.
45This paper examines the application of this
[4446]46approach to the development a full-featured Unicode-capable open-source grep
47implementation.  Constructed using a layered architecture
48combining Parabix and LLVM compiler technologies, icGrep is the
49first instance of a potentially large class of text processing
50applications that achieve high performance text processing through the combination
51of dynamic compilation and bitwise data parallelism.
52In performance comparisons with several contemporary alternatives,
[4550]5310$\times$ or better speedups are often observed.
[4446]54\end{abstract}
55
56
57\input{introduction.tex}
58
59\input{background.tex}
60