Primes.jl
Prime numbers in Julia (by JuliaMath)
Folds.jl
A unified interface for sequential, threaded, and distributed fold (by JuliaFolds)
| Primes.jl | Folds.jl | |
|---|---|---|
| 2 | 1 | |
| 90 | 84 | |
| - | - | |
| 6.7 | 0.0 | |
| 23 days ago | over 1 year ago | |
| Julia | Julia | |
| GNU General Public License v3.0 or later | MIT License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Primes.jl
Posts with mentions or reviews of Primes.jl.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-12-17.
-
My experience using Julia
https://github.com/trizen/julia-scripts/blob/master/Math/elliptic-curve_factorization_method.jl and https://github.com/trizen/julia-scripts/blob/master/Math/continued_fraction_factorization_method.jl are two possible significant algorithmic improvements mentioned in https://github.com/JuliaMath/Primes.jl/issues/49. The elliptic curve method in particular looks like a good compromise of speed and performance. It is (according to wikipedia) the best algorithm for numbers up to around 60 digits and is only around 70 lines of code.
-
Concurrency in Julia
This article uses very inefficient mathematical computations to illustrate concurrency. That’s fine, they are just examples. But you might also be interested in learning how it’s really done, for example by reading the Primes package. [1]
[1] https://github.com/JuliaMath/Primes.jl/blob/master/src/Prime...
Folds.jl
Posts with mentions or reviews of Folds.jl.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-11-09.
-
Concurrency in Julia
The Folds.jl [1] package mentioned in the article is very nicely written.
For another alternative to Julia's built-in `Threads.@threads` macro, folks may also be interested in checking out `@batch` from Polyester.jl [2] (formerly CheapThreads.jl), which features particularly low-overhead threading.
[1] https://github.com/JuliaFolds/Folds.jl
[2] https://github.com/JuliaSIMD/Polyester.jl
What are some alternatives?
When comparing Primes.jl and Folds.jl you can also consider the following projects:
Polyester.jl - The cheapest threads you can find!
parallel_primes_rs - A very naïve implementation of rust algorithm that finds all primes between two numbers