Thiago Nascimento Rodrigues

Work place: Regional Electoral Court of ParanĂ¡, Curitiba, 80.220-902, Brazil



Research Interests: Computational Engineering, Software Development Process, Software Engineering


Thiago Nascimento Rodrigues holds a bachelor’s degree in Computational Mathematics from the Federal University of Minas Gerais (UFMG), Brazil. Before his master’s degree, he specialized in computer network infrastructure for IT business environments at Faculdades Integradas Espírito-Santenses (FAESA), Brazil. His master’s degree in Informatics was obtained at the Federal University of Espírito Santo (UFES), Brazil, and was focused on the parallelization of irregular algorithms for reordering sparse matrices. For the last decade, he has been a software engineer on large enterprise systems projects for the Brazilian government.

Author Articles
A Fast Topological Parallel Algorithm for Traversing Large Datasets

By Thiago Nascimento Rodrigues

DOI:, Pub. Date: 8 Feb. 2023

This work presents a parallel implementation of a graph-generating algorithm designed to be straightforwardly adapted to traverse large datasets. This new approach has been validated in a correlated scenario known as the word ladder problem. The new parallel algorithm induces the same topological structure proposed by its serial version and also builds the shortest path between any pair of words to be connected by a ladder of words. The implemented parallelism paradigm is the Multiple Instruction Stream - Multiple Data Stream (MIMD) and the test suite embraces 23-word ladder instances whose intermediate words were extracted from a dictionary of 183,719 words (dataset). The word morph quality (the shortest path between two input words) and the word morph performance (CPU time) were evaluated against a serial implementation of the original algorithm. The proposed parallel algorithm generated the optimal solution for each pair of words tested, that is, the minimum word ladder connecting an initial word to a final word was found. Thus, there was no negative impact on the quality of the solutions comparing them with those obtained through the serial ANG algorithm. However, there was an outstanding improvement considering the CPU time required to build the word ladder solutions. In fact, the time improvement was up to 99.85%, and speedups greater than 2.0X were achieved with the parallel algorithm.

[...] Read more.
Other Articles