Parallelized Sieve of Eratosthenes with Message Passing model.
-
Updated
Apr 6, 2018 - C
Parallelized Sieve of Eratosthenes with Message Passing model.
🚀 Fastest (probably) Sieve of Eratosthenes implementation, in C
Prime Number Generator - Fast and Simple - 64 Bit Numeric Range
Parallel Sieve of Eratosthenes for prime numbers generation.
Sieve of Eratosthenes implementation using pthreads in C
In this project we plan on parallelizing the Sieve of Eratosthenes, which is an algorithm for finding prime numbers.
A set of crypto tools and libraries
Finds prime numbers in a specified range, fast.
High performance palindromic prime number generator
Math library written in C++
Some Personal C Projects
Cyclop (C-lang - Consecutive List Of Primes)
Fast prime generator
Multithreaded implementation of the Segmented Sieve variant of Sieve of Eratosthenes
Prime sieve impementation.
Add a description, image, and links to the sieve-of-eratosthenes topic page so that developers can more easily learn about it.
To associate your repository with the sieve-of-eratosthenes topic, visit your repo's landing page and select "manage topics."