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 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
