Cargando…
Parallel Multi-Deque Partition Dual-Deque Merge sorting algorithm using OpenMP
Quicksort is an important algorithm that uses the divide and conquer concept, and it can be run to solve any problem. The performance of the algorithm can be improved by implementing this algorithm in parallel. In this paper, the parallel sorting algorithm named the Multi-Deque Partition Dual-Deque...
Autores principales: | Ketchaya, Sirilak, Rattanatranurak, Apisit |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group UK
2023
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10115789/ https://www.ncbi.nlm.nih.gov/pubmed/37076726 http://dx.doi.org/10.1038/s41598-023-33583-4 |
Ejemplares similares
-
Parallel programming in OpenMP
por: Chandra, Rohit, et al.
Publicado: (2001) -
Parallelization of maximum likelihood fits with OpenMP and CUDA
por: Jarp, S, et al.
Publicado: (2011) -
Using OpenMP : portable shared memory parallel programming /
por: Chapman, Barbara, 1954-
Publicado: (2008) -
International Workshop on OpenMP
Publicado: (2007) -
Using OpenMP: portable shared memory parallel programming
por: Chapman, Barbara, et al.
Publicado: (2008)