https://github.com/ankitsultana/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)
https://github.com/ankitsultana/parallel-df
cpp document-frequency openmp openmp-parallelization
Last synced: 2 months ago
JSON representation
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)
- Host: GitHub
- URL: https://github.com/ankitsultana/parallel-df
- Owner: ankitsultana
- License: gpl-3.0
- Created: 2018-03-31T19:03:23.000Z (about 8 years ago)
- Default Branch: master
- Last Pushed: 2018-03-31T20:11:37.000Z (about 8 years ago)
- Last Synced: 2024-12-30T15:48:31.507Z (over 1 year ago)
- Topics: cpp, document-frequency, openmp, openmp-parallelization
- Language: C++
- Size: 20.5 KB
- Stars: 4
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# parallel-df
An OpenMP based solution for computing K-most frequent words in a corpus.
### Dependencies
* C++11 or higher
* OpenMP
### Usage
* Build the project
```
make
```
* Add path to the corpus to a file (see `exp.txt`). In case you want to try
this on multiple corpus, add each of their top level paths in a different line
in `exp.txt`
* The executable is `bin/exec`, which you can run like so:
```
time bin/exec -config exp.txt -k 2 -nt 2
```
### License
GNU GPL v3