Visual Search Optimization

Prashanth Thinakaran, Diana Guttman, Mahmut Kandemir, Meenakshi Arunachalam, Rahul Khanna, Praveen Yedlapalli, Narayan Ranganathan

Research output: Chapter in Book/Report/Conference proceedingChapter

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.

Original languageEnglish (US)
Title of host publicationHigh Performance Parallelism Pearls
Subtitle of host publicationMulticore and Many-core Programming Approaches
PublisherElsevier Inc.
Pages191-209
Number of pages19
Volume2
ISBN (Electronic)9780128038901
ISBN (Print)9780128038192
DOIs
StatePublished - Jul 23 2015

Fingerprint

Scalability
Image matching

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

Cite this

Thinakaran, P., Guttman, D., Kandemir, M., Arunachalam, M., Khanna, R., Yedlapalli, P., & Ranganathan, N. (2015). Visual Search Optimization. In High Performance Parallelism Pearls: Multicore and Many-core Programming Approaches (Vol. 2, pp. 191-209). Elsevier Inc.. https://doi.org/10.1016/B978-0-12-803819-2.00021-5
Thinakaran, Prashanth ; Guttman, Diana ; Kandemir, Mahmut ; Arunachalam, Meenakshi ; Khanna, Rahul ; Yedlapalli, Praveen ; Ranganathan, Narayan. / Visual Search Optimization. High Performance Parallelism Pearls: Multicore and Many-core Programming Approaches. Vol. 2 Elsevier Inc., 2015. pp. 191-209
@inbook{0ef954ef4a2445f7bf9569fc7d738539,
title = "Visual Search Optimization",
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.",
author = "Prashanth Thinakaran and Diana Guttman and Mahmut Kandemir and Meenakshi Arunachalam and Rahul Khanna and Praveen Yedlapalli and Narayan Ranganathan",
year = "2015",
month = "7",
day = "23",
doi = "10.1016/B978-0-12-803819-2.00021-5",
language = "English (US)",
isbn = "9780128038192",
volume = "2",
pages = "191--209",
booktitle = "High Performance Parallelism Pearls",
publisher = "Elsevier Inc.",
address = "United States",

}

Thinakaran, P, Guttman, D, Kandemir, M, Arunachalam, M, Khanna, R, Yedlapalli, P & Ranganathan, N 2015, Visual Search Optimization. in High Performance Parallelism Pearls: Multicore and Many-core Programming Approaches. vol. 2, Elsevier Inc., pp. 191-209. https://doi.org/10.1016/B978-0-12-803819-2.00021-5

Visual Search Optimization. / Thinakaran, Prashanth; Guttman, Diana; Kandemir, Mahmut; Arunachalam, Meenakshi; Khanna, Rahul; Yedlapalli, Praveen; Ranganathan, Narayan.

High Performance Parallelism Pearls: Multicore and Many-core Programming Approaches. Vol. 2 Elsevier Inc., 2015. p. 191-209.

Research output: Chapter in Book/Report/Conference proceedingChapter

TY - CHAP

T1 - Visual Search Optimization

AU - Thinakaran, Prashanth

AU - Guttman, Diana

AU - Kandemir, Mahmut

AU - Arunachalam, Meenakshi

AU - Khanna, Rahul

AU - Yedlapalli, Praveen

AU - Ranganathan, Narayan

PY - 2015/7/23

Y1 - 2015/7/23

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84982899042&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84982899042&partnerID=8YFLogxK

U2 - 10.1016/B978-0-12-803819-2.00021-5

DO - 10.1016/B978-0-12-803819-2.00021-5

M3 - Chapter

SN - 9780128038192

VL - 2

SP - 191

EP - 209

BT - High Performance Parallelism Pearls

PB - Elsevier Inc.

ER -

Thinakaran P, Guttman D, Kandemir M, Arunachalam M, Khanna R, Yedlapalli P et al. Visual Search Optimization. In High Performance Parallelism Pearls: Multicore and Many-core Programming Approaches. Vol. 2. Elsevier Inc. 2015. p. 191-209 https://doi.org/10.1016/B978-0-12-803819-2.00021-5