search

TheFighters / Smith-Waterman

Parallel implementation of Smith–Waterman using OpenMP
MIT License
8 stars 16 forks source link

Serial version is showing less elapsed time #1

Open apalmk opened 7 years ago

apalmk commented 7 years ago

When I ran both with same sized matrix the serial version showed less time.

danielholanda commented 7 years ago

The technique used for making the algorithm parallel causes some overhead during indexing. The technique is only advantageous when the problem size is large and you have several CPUs available.