I was trying to implement a Parallel Kmer algorithm used in Bioinformatics Benchmarks, I started by working on a serial technique and then I improved upon that.
Link to the code K_mer_parallel.chpl
I First created a serial procedure for Kmer counting on a substring in a string then I divided the string into N pieces after that I used task parallelism to calculate N substring simultaneously. All over the logic is giving the right output. But I think the usage of Map can be improved.
I would love to get feedback about my approach and code, Is there any major flaw I didn't notice and how can I improve upon It.