Cargando…
A sample implementation for parallelizing Divide-and-Conquer algorithms on the GPU
The strategy of Divide-and-Conquer (D&C) is one of the frequently used programming patterns to design efficient algorithms in computer science, which has been parallelized on shared memory systems and distributed memory systems. Tzeng and Owens specifically developed a generic paradigm for paral...
Autores principales: | Mei, Gang, Zhang, Jiayin, Xu, Nengxiong, Zhao, Kunyang |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Elsevier
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5857513/ https://www.ncbi.nlm.nih.gov/pubmed/29560430 http://dx.doi.org/10.1016/j.heliyon.2018.e00512 |
Ejemplares similares
-
Improving GPU-accelerated adaptive IDW interpolation algorithm using fast kNN search
por: Mei, Gang, et al.
Publicado: (2016) -
Unscented Particle Filter Algorithm Based on Divide-and-Conquer Sampling for Target Tracking
por: Du, Sichun, et al.
Publicado: (2021) -
A divide-and-conquer algorithm for quantum state preparation
por: Araujo, Israel F., et al.
Publicado: (2021) -
Cheaters divide and conquer
por: Bomblies, Kirsten
Publicado: (2014) -
Kart: a divide-and-conquer algorithm for NGS read alignment
por: Lin, Hsin-Nan, et al.
Publicado: (2017)