This paper examines the ways in which parallelism can be used to speed the parsing of dense PCFGs. We focus on two kinds of parallelism here: Symmetric Multi-Processing (SMP) parallelism on shared-memory multicore CPUs, and Single-Instruction Multiple- Thread (SIMT) parallelism on GPUs. We describe how to achieve speed-ups over an already very efficient baseline parser using both kinds of technology. For our dense PCFG parsing task we obtained a 60×speed-up using SMP and SSE parallelism coupled with a cache-sensitive algorithm design, parsing section 24 of the Penn WSJ treebank in a little over 2 secs.
|Number of pages||9|
|Journal||Proceedings of the Australasian Language Technology Association Workshop 2011|
|Publication status||Published - 2011|
|Event||Australasian Language Technology Workshop (9th : 2011) - Canberra|
Duration: 1 Dec 2011 → 2 Dec 2011