A parallel GPU-based approach for reporting flock patterns

Text Complet
A-parallel-GPU-based.pdf closed access
Sol·licita còpia a l'autor de l'article
En omplir aquest formulari esteu demanant una còpia de l'article dipositat al repositori institucional (DUGiDocs) al seu autor o a l'autor principal de l'article. Serà el mateix autor qui decideixi lliurar una còpia del document a qui ho sol•liciti si ho creu convenient. En tot cas, la Biblioteca de la UdG no intervé en aquest procés ja que no està autoritzada a facilitar articles quan aquests són d'accés restringit.
Compartir
Data analysis and knowledge discovery in trajectory databases is an emerging field with a growing number of applications such as managing traffic, planning tourism infrastructures or better understanding wildlife. In this paper, we study the problem of finding flock patterns in trajectory databases. A flock refers to a large enough subset of entities that move close to each other for, at least, a given time interval. We present parallel algorithms, to be run on a Graphics Processing Unit, for reporting three different variants of the flock pattern: (1) all maximal flocks, (2) the largest flock and (3) the longest flock. We also provide their complexity analysis together with experimental results showing the efficiency and scalability of our approach ​
​Tots els drets reservats