A fast parallel algorithm for finding the largest common 4-connected component from two matricesReport as inadecuate




A fast parallel algorithm for finding the largest common 4-connected component from two matrices - Download this document for free, or read online. Document in PDF available to download.

Technical gazette, Vol.23 No.4 August 2016. -

We describe a new design of parallel algorithm for solving the two-dimensional longest common substring 2D LCS problem, taking advantage of the multi-core graphic processing unit architecture offered by Compute Unified Device Architecture CUDA. In this article we also define the 2D LCS problem as finding the largest common 4-connected component from two input matrices and present an algorithm which can exactly solve this problem in 0 mnst-P time with a P-core GPU.

CUDA; largest common 4-connected component; parallel algorithm; 2DLCS



Author: Ying Gao - ; School of Computer Science and Engineering, South China University of Technology, Waihuan Dong Road No. 382, Panyu D

Source: http://hrcak.srce.hr/



DOWNLOAD PDF




Related documents