This chapter presents an image-matching application that can take advantage of many-core architectures. Different parallelization strategies are explored that can take advantage of inter- and intraimage parallelism. The two main metrics that determine the application performance, tree creation time and search time, were studied in the context of scalability. Important insights obtained from a profiler-based analysis help identify the challenges in scalability of DB threads. The scalability with respect to increasing DBThreads with optimal KD-trees is shown to lead to 5.8× speedup in create time and 2.8× speedup in search time in the case of 120 threads when compared to single-threaded Xeon Phi performance.
|Original language||English (US)|
|Title of host publication||High Performance Parallelism Pearls|
|Subtitle of host publication||Multicore and Many-core Programming Approaches|
|Number of pages||19|
|State||Published - Jul 23 2015|
All Science Journal Classification (ASJC) codes
- Computer Science(all)