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...
Main Authors: | Gang Mei, Jiayin Zhang, Nengxiong Xu, Kunyang Zhao |
---|---|
Format: | Article |
Language: | English |
Published: |
Elsevier
2018-01-01
|
Series: | Heliyon |
Subjects: | |
Online Access: | http://www.sciencedirect.com/science/article/pii/S2405844016326032 |
Similar Items
Similar Items
-
PList-based Divide and Conquer Parallel Programming
by: Virginia Niculescu, et al.
Published: (2020-06-01) -
A Case Study of Semi-Automatic Parallelization of Divide and Conquer Algorithms Using Invasive Interactive Parallelization
by: Hansson, Erik
Published: (2009) -
Autotuning divide-and-conquer matrix-vector multiplication
by: Pantawongdecha, Payut
Published: (2016) -
Parallel implementation of funtional languages using divide-and-conquer strategies
by: Esmaeili, Javad
Published: (1995) -
Parallel Junction Tree Algorithm on GPU
by: Zheng, Lu
Published: (2013)