Efficient parallel implementations of various sorting algorithms on modern hardware
platforms are essential to numerous application areas. In this paper, we first measure the …

Many real-world problems require a sorting operation as part of their efficient solution. Some
examples of this are real-time plasma diagnostic, image re-ranking, and suffix array …

In order to solve many real problems, we have to sort array segments of data. This sorting
task is called segmented sorting. Problems like image processing and suffix array …

Min-min heuristic is one of the most indicated algorithm to solve HCSP, when we are looking
for performance. A previous result presented an efficient implementation to this problem with …

O problema do escalonamento de tarefas consiste na distribuição de tarefas entre as
máquinas disponíveis no ambiente. Uma das formas de resolver esse problema é usando a …

Parallel sorting algorithms are widely studied nowadays. The difficulty in improving sorting
run-time when run serially has lead to a lot of research in this area. Efficient sorting is …

Resumo O Problema dos K-Caminhos mais Curtos sem Repetições de Vértices (K-
Shortest Loopless Paths–KSLP) consiste em encontrar K| K> 1 caminhos, sem repetições …