{"id":18850704,"url":"https://github.com/ankitsultana/parallel-df","last_synced_at":"2026-02-03T11:30:15.597Z","repository":{"id":91529894,"uuid":"127562391","full_name":"ankitsultana/parallel-df","owner":"ankitsultana","description":"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)","archived":false,"fork":false,"pushed_at":"2018-03-31T20:11:37.000Z","size":21,"stargazers_count":4,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2024-12-30T15:48:31.507Z","etag":null,"topics":["cpp","document-frequency","openmp","openmp-parallelization"],"latest_commit_sha":null,"homepage":null,"language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/ankitsultana.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2018-03-31T19:03:23.000Z","updated_at":"2024-09-16T13:03:21.000Z","dependencies_parsed_at":null,"dependency_job_id":"45f0b77c-7701-46d3-ab09-63fc4b5c9bf0","html_url":"https://github.com/ankitsultana/parallel-df","commit_stats":null,"previous_names":[],"tags_count":1,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ankitsultana%2Fparallel-df","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ankitsultana%2Fparallel-df/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ankitsultana%2Fparallel-df/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ankitsultana%2Fparallel-df/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ankitsultana","download_url":"https://codeload.github.com/ankitsultana/parallel-df/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":239786386,"owners_count":19696807,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["cpp","document-frequency","openmp","openmp-parallelization"],"created_at":"2024-11-08T03:30:48.886Z","updated_at":"2026-02-03T11:30:15.448Z","avatar_url":"https://github.com/ankitsultana.png","language":"C++","readme":"# parallel-df\n\nAn OpenMP based solution for computing K-most frequent words in a corpus.\n\n### Dependencies\n\n* C++11 or higher\n* OpenMP\n\n### Usage\n\n* Build the project\n\n```\nmake\n```\n\n* Add path to the corpus to a file (see `exp.txt`). In case you want to try\nthis on multiple corpus, add each of their top level paths in a different line\nin `exp.txt`\n\n* The executable is `bin/exec`, which you can run like so:\n\n```\ntime bin/exec -config exp.txt -k 2 -nt 2\n```\n\n### License\n\nGNU GPL v3\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fankitsultana%2Fparallel-df","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fankitsultana%2Fparallel-df","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fankitsultana%2Fparallel-df/lists"}