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...

Descripción completa

Detalles Bibliográficos
Autores principales: Mei, Gang, Zhang, Jiayin, Xu, Nengxiong, Zhao, Kunyang
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Elsevier 2018
Materias:
Article
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

Internet

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