Parallel Algorithm for Longest Common Subsequence in a String

TL;DR

This paper introduces a parallel algorithm for computing the Longest Common Subsequence using OpenMP, demonstrating a 3.22x speedup on a four-processor system, enhancing pattern matching efficiency.

Contribution

The paper presents a novel parallel algorithm for LCS computation utilizing OpenMP, improving performance over traditional sequential methods.

Findings

Speedup of 3.22 times on four processors

Effective utilization of OpenMP for parallel processing

Demonstrated performance improvement in pattern recognition tasks

Abstract

In the area of Pattern Recognition and Matching, finding a Longest Common Subsequence plays an important role. In this paper, we have proposed one algorithm based on parallel computation. We have used OpenMP API package as middleware to send the data to different processors. We have tested our algorithm in a system having four processors and 2 GB physical memory. The best result showed that the parallel algorithm increases the performance (speed of computation) by 3.22.