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.9 page(s
Best paper awardInternational audienceStochastic simulations need multiple replications in order to ...
The advent of multi-core architecture has highly influenced the area of high performance computing. ...
The high computational throughput of modern graphics processing units (GPUs) make them the de-facto ...
This paper examines the ways in which par-allelism can be used to speed the parsing of dense PCFGs. ...
During the last decade increasing interest in parallel programming can be observed. It is caused by ...
applications, the main time-consuming process is string matching due to the large size of lexicon. I...
With processor clock speeds having stagnated, parallel computing architectures have achieved a break...
Parallel graph algorithms have become one of the principal applications of high-performance computin...
The end of Dennard scaling also brought an end to frequency scaling as a means to improve performanc...
Constituency parsing with rich grammars re-mains a computational challenge. Graph-ics Processing Uni...
[[abstract]]Graphics processing units (GPUs) have attracted a lot of attention due to their cost-eff...
General purpose graphical processing units were proven to be useful for accelerating computationally...
The rate of scientific discovery depends on the speed at which accurate results and analysis can be...
The stream processing paradigm is used in several scientific and enterprise applications in order to...
Graphics Processing Units (GPUs) are a fast evolving architecture. Over the last decade their progra...
Best paper awardInternational audienceStochastic simulations need multiple replications in order to ...
The advent of multi-core architecture has highly influenced the area of high performance computing. ...
The high computational throughput of modern graphics processing units (GPUs) make them the de-facto ...
This paper examines the ways in which par-allelism can be used to speed the parsing of dense PCFGs. ...
During the last decade increasing interest in parallel programming can be observed. It is caused by ...
applications, the main time-consuming process is string matching due to the large size of lexicon. I...
With processor clock speeds having stagnated, parallel computing architectures have achieved a break...
Parallel graph algorithms have become one of the principal applications of high-performance computin...
The end of Dennard scaling also brought an end to frequency scaling as a means to improve performanc...
Constituency parsing with rich grammars re-mains a computational challenge. Graph-ics Processing Uni...
[[abstract]]Graphics processing units (GPUs) have attracted a lot of attention due to their cost-eff...
General purpose graphical processing units were proven to be useful for accelerating computationally...
The rate of scientific discovery depends on the speed at which accurate results and analysis can be...
The stream processing paradigm is used in several scientific and enterprise applications in order to...
Graphics Processing Units (GPUs) are a fast evolving architecture. Over the last decade their progra...
Best paper awardInternational audienceStochastic simulations need multiple replications in order to ...
The advent of multi-core architecture has highly influenced the area of high performance computing. ...
The high computational throughput of modern graphics processing units (GPUs) make them the de-facto ...