{"id":27305362,"url":"https://github.com/joaomhmpereira/parallel-and-distributed-computing","last_synced_at":"2025-09-17T23:49:10.892Z","repository":{"id":158120466,"uuid":"631606248","full_name":"joaomhmpereira/Parallel-and-Distributed-Computing","owner":"joaomhmpereira","description":"Travelling Salesman Problem (Serial, OpenMP and MPI) implementation using Branch and Bound algorithm.","archived":false,"fork":false,"pushed_at":"2023-05-19T17:32:40.000Z","size":461,"stargazers_count":2,"open_issues_count":0,"forks_count":3,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-04-12T03:35:23.691Z","etag":null,"topics":["branch-and-bound","mpi","openmp","parallel-computing","travelling-salesman-problem"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/joaomhmpereira.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null}},"created_at":"2023-04-23T14:56:22.000Z","updated_at":"2024-09-28T00:36:00.000Z","dependencies_parsed_at":"2023-05-25T06:00:10.175Z","dependency_job_id":null,"html_url":"https://github.com/joaomhmpereira/Parallel-and-Distributed-Computing","commit_stats":{"total_commits":101,"total_committers":4,"mean_commits":25.25,"dds":0.3366336633663366,"last_synced_commit":"97662b4a28bfe5deae1b23621f8d2369c48cc9a4"},"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/joaomhmpereira/Parallel-and-Distributed-Computing","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/joaomhmpereira%2FParallel-and-Distributed-Computing","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/joaomhmpereira%2FParallel-and-Distributed-Computing/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/joaomhmpereira%2FParallel-and-Distributed-Computing/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/joaomhmpereira%2FParallel-and-Distributed-Computing/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/joaomhmpereira","download_url":"https://codeload.github.com/joaomhmpereira/Parallel-and-Distributed-Computing/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/joaomhmpereira%2FParallel-and-Distributed-Computing/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":275685476,"owners_count":25509530,"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","status":"online","status_checked_at":"2025-09-17T02:00:09.119Z","response_time":84,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["branch-and-bound","mpi","openmp","parallel-computing","travelling-salesman-problem"],"created_at":"2025-04-12T03:28:33.053Z","updated_at":"2025-09-17T23:49:10.869Z","avatar_url":"https://github.com/joaomhmpereira.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# `Parallel and Distributed Computing` #\n\nThis repository contains work developed in the [Parallel and Distributed Computing](https://fenix.tecnico.ulisboa.pt/disciplinas/CPD2/2022-2023/2-semestre/pagina-inicial) masters course at IST.\n\nMore specifically, it contains three (one sequential and two parallel) implementations of the [Travelling Salesman Problem](https://en.wikipedia.org/wiki/Travelling_salesman_problem) using the [Branch and Bound](https://en.wikipedia.org/wiki/Branch_and_bound) algorithm. \n\nRegarding the parallel implementations, one was done using [OpenMP](https://en.wikipedia.org/wiki/OpenMP) and the other using [MPI (Message Passing Interface)](https://en.wikipedia.org/wiki/Message_Passing_Interface).\n\nGrade: 18/20.\n\nAuthor | Github\n-------|-------\nLeonor Barreiros      | https://github.com/leonormbarreiros\nCatarina Bento        | https://github.com/catarinab\nJoão Pereira          | https://github.com/joaomhmpereira\n\n### `Instructions to run each implementation` ###\n\nAll implementations have their own directory and each already include a Makefile to compile the program.\n\nDirectories `pub-instances` and `output` contain the available tests (input files) and expected outputs respectively.\n\nAfter compiling, use the following commands to run the programs:\n- Serial\n    - `./tsp \u003cpath-to-input-file\u003e \u003cmax-cost\u003e`\n- OpenMP\n    - `./tsp-omp \u003cpath-to-input-file\u003e \u003cmax-cost\u003e`\n- MPI\n    - `mpirun -n \u003cnumber-of-processes\u003e tsp-mpi \u003cpath-to-input-file\u003e \u003cmax-cost\u003e`\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjoaomhmpereira%2Fparallel-and-distributed-computing","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjoaomhmpereira%2Fparallel-and-distributed-computing","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjoaomhmpereira%2Fparallel-and-distributed-computing/lists"}