Parallelizing Plan Recognition
| Autor: | Christopher W. Geib, Christopher E. Swetenham |
|---|---|
| Rok vydání: | 2015 |
| Předmět: | |
| Zdroj: | AI Magazine; Vol 36, No 2: Summer 2015; 22-32 |
| ISSN: | 2371-9621 0738-4602 |
| Popis: | Modern multicore computers provide an opportunity to parallelize plan recognition algorithms to decrease runtime. Viewing plan recognition as parsing based on a complete breadth first search, makes ELEXIR (engine for lexicalized intent recognition) (Geib 2009; Geib and Goldman 2011) particularly suited for parallelization. This article documents the extension of ELEXIR to utilize such modern computing platforms. We will discuss multiple possible algorithms for distributing work between parallel threads and the associated performance wins. We will show, that the best of these algorithms provides close to linear speedup (up to a maximum number of processors), and that features of the problem domain have an impact on the achieved speedup. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|