{"id":19082674,"url":"https://github.com/stuartajd/prime-sieve","last_synced_at":"2026-05-23T07:30:18.900Z","repository":{"id":110615767,"uuid":"181675192","full_name":"stuartajd/prime-sieve","owner":"stuartajd","description":"🧵 Implementation of a Prime Number Sieve using multi-threading \u0026 MPJ to benchmark parallel speedup - Distributed Systems and Parallel Programming Coursework","archived":false,"fork":false,"pushed_at":"2019-05-01T15:49:21.000Z","size":23,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-01-02T20:36:15.623Z","etag":null,"topics":["distributed-systems","mpj","multithreading","parallel-programming","parallel-speedup","prime-numbers","university-of-portsmouth"],"latest_commit_sha":null,"homepage":"","language":"Java","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/stuartajd.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,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2019-04-16T11:22:14.000Z","updated_at":"2020-03-02T20:21:36.000Z","dependencies_parsed_at":null,"dependency_job_id":"fcd8c0fb-b101-430b-b09f-0dcb718654d8","html_url":"https://github.com/stuartajd/prime-sieve","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/stuartajd%2Fprime-sieve","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/stuartajd%2Fprime-sieve/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/stuartajd%2Fprime-sieve/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/stuartajd%2Fprime-sieve/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/stuartajd","download_url":"https://codeload.github.com/stuartajd/prime-sieve/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240133131,"owners_count":19752992,"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":["distributed-systems","mpj","multithreading","parallel-programming","parallel-speedup","prime-numbers","university-of-portsmouth"],"created_at":"2024-11-09T02:44:00.199Z","updated_at":"2026-05-23T07:30:18.831Z","avatar_url":"https://github.com/stuartajd.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Prime Sieve\nImplementation of a Prime Number Sieve using multi-threading \u0026amp; MPJ to benchmark - Distributed Systems and Parallel Programming\n\n## SequentialPrime\nThe SequentialPrime class calculates prime numbers from 1 to the N value. They are calculated on one thread \u0026 on one machine. Once calculated, the total time taken is calculated and returned along with total number of prime numbers found.\n\n## ThreadedPrime\nThe ThreadedPrime class calculates prime numbers from 1 to the N value. They are calculated evenly split across T threads. Once calculated, each thread returns the list of prime numbers and the main calculated the execution time and adds the total result up, displaying both.\n\n## MpjPrime\nThe MpjPrimes class calculates prime numbers from 1 to the N value. They are calculated evenly split across the total threads / machines provided by the MPI COMM_WORLD size variables. Once calculated, each thread / machine returns the list of prime numbers and the main calculated the execution time and adds the total result up, displaying both.","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fstuartajd%2Fprime-sieve","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fstuartajd%2Fprime-sieve","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fstuartajd%2Fprime-sieve/lists"}