Visual Search Optimization
Prashanth Thinakaran*; Diana Guttman*; Mahmut Taylan Kandemir*; Meenakshi Arunachalam†; Rahul Khanna†; Praveen Yedlapalli*; Narayan Ranganathan† * Pennsylvania State University, USA† Intel Corporation, USA
Abstract
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 ...
Get High Performance Parallelism Pearls Volume Two now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
