arrow
返回

Parallelization Strategies for Graph-Code-Based Similarity Search

delete2023-04-06
delete0
delete
OA
AI
P
Patrick Steinert *
S
Stefan Wagenpfeil
P
Paul Mc Kevitt
I
Ingo Frommholz
M
Matthias Hemmje
DOI:10.3390/bdcc7020070delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
The volume of multimedia assets in collections is growing exponentially, and the retrieval of information is becoming more complex. The indexing and retrieval of multimedia content is generally implemented by employing feature graphs. Feature graphs contain semantic information on multimedia assets. Machine learning can produce detailed semantic information on multimedia assets, reflected in a high volume of nodes and edges in the feature graphs. While increasing the effectiveness of the information retrieval results, the high level of detail and also the growing collections increase the processing time. Addressing this problem, Multimedia Feature Graphs (MMFGs) and Graph Codes (GCs) have been proven to be fast and effective structures for information retrieval. However, the huge volume of data requires more processing time. As Graph Code algorithms were designed to be parallelizable, different paths of parallelization can be employed to prove or evaluate the scalability options of Graph Code processing. These include horizontal and vertical scaling with the use of Graphic Processing Units (GPUs), Multicore Central Processing Units (CPUs), and distributed computing. In this paper, we show how different parallelization strategies based on Graph Codes can be combined to provide a significant improvement in efficiency. Our modeling work shows excellent scalability with a theoretical speedup of 16,711 on a top-of-the-line Nvidia H100 GPU with 16,896 cores. Our experiments with a mediocre GPU show that a speedup of 225 can be achieved and give credence to the theoretical speedup. Thus, Graph Codes provide fast and effective multimedia indexing and retrieval, even in billion-scale use cases.
Keyword:
indexing
retrieval
explainability
semantic
multimedia
feature graph
Graph Code

期刊

B
Big Data and Cognitive Computing
IF:
4.4
论文数:
1.3K
被引数:
2.4K

机构

F
fern university hagen
学者数:
639
论文数: 640
被引数: 0
U
University of Wolverhampton
学者数:
1.7K
论文数: 1.7K
被引数: 1.9K
引用论文

引用论文

err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
Biorthogonal Wavelet Expansions
err1997-07-01
err0
PREAI
errW. Dahmen; C. A. Micchelli
err分享
err收藏
err分享
err收藏
Living at risk
err2012-04-25
err0
PREAI
errAbira Reizer; Tsachi Ein-Dor; Chaya Possick
err分享
err收藏
The Use of Ontology in Retrieval: A Study on Textual, Multilingual, and Multimedia Retrieval本体在检索中的使用: 文本,多语言和多媒体检索的研究
err2019-01-01
err34
errOAAI
errAsim, Muhammad Nabeel; Wasim, Muhammad; Khan, Muhammad Usman Ghani; Mahmood, Nasir; Mahmood, Waqar
err分享
err收藏
err分享
err收藏
Thinking About God Encourages Prosociality Toward Religious Outgroups: A Cross-Cultural Investigation
err2023-04-18
err0
PREAI
errMichael H. Pasek; John Michael Kelly; Crystal Shackleford; Cindel J. M. White; Allon Vishkin; Julia M. Smith; Ara Norenzayan; Azim Shariff; Jeremy Ginges
err分享
err收藏
err分享
err收藏
学者 查看更多内容