parallel-df. An OpenMP based solution for computing K-most frequent words in a corpus (see README for more). Also, my submission for Assignment 2 of Parallel Computing Course, BITS Pilani (2nd Sem 2017/18)

github.com/ankitsultana/parallel-df

Problem

Audience

Updates

No founder updates yet. Check back soon.