Scalable and Efficient Spatial-Aware Parallelization Strategies for Multimedia Retrieval
Resumo
Similarity search is a key operation in several multimedia applications, including online Content-Based Multimedia Retrieval (CBMR) services. These applications have to deal with very large databases and are submitted to high query rates. In this context, scalability in distributed memory system is critical to assemble the required computing power and memory space. However, we have identified that the Data Equal Split (DES) parallelization and associated data partition strategy employed by the related works on the domain have limitations in terms of efficiency and scalability. Therefore, in this paper, we developed and implemented a framework for similarity search execution on distributed memory machines and proposed a novel class of data partition strategies that takes into account the data spatial organization in its distribution. This approach leads to a reduction in communication traffic and in costs associated with processing each task in local searches carried out in the distributed machine. Our approach attained a speedup of 2.4× on top of DES in the baseline case (5 nodes) and also achieves higher scalability efficiency and is 14.5× faster when 160 nodes are used. In fact, our novel data organization led to superlinear scalability in all configurations evaluated.
Palavras-chave:
Scalability, Memory management, Distributed databases, Organizations, Multimedia databases, Spatial databases, Task analysis
Publicado
08/09/2020
Como Citar
ANDRADE, Guilherme; TEODORO, George; FERREIRA, Renato.
Scalable and Efficient Spatial-Aware Parallelization Strategies for Multimedia Retrieval. In: INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE AND HIGH PERFORMANCE COMPUTING (SBAC-PAD), 32. , 2020, Porto/Portugal.
Anais [...].
Porto Alegre: Sociedade Brasileira de Computação,
2020
.
p. 124-131.
