Popular x64 Tags
- autocad x64 download
- solidworks x64 download
- intellicad x64 download
- dxf x64 download
- cad x64 download
- dwg x64 download
- architectural x64 download
- visualization x64 download
- home x64 download
- design x64 download
- hpgl x64 download
- progecad x64 download
- animation x64 download
- cam x64 download
- dwg to pdf x64 download
- fence x64 download
- architect x64 download
- vrml x64 download
- viz x64 download
- convert x64 download
- gear x64 download
- landscape x64 download
- deck x64 download
- strength check x64 download
- batch x64 download
- garden x64 download
- yard x64 download
- gardening x64 download
- landscaping x64 download
- backyard x64 download
primesieve x64 12.3
Sponsored links:
license: Open Source
downloads: 369
size: 246 kB
updated: 2024-04-18
tags: x64 Eratosthenes sieve, x64 prime number sieve, x64 filter prime number, x64 Eratosthenes, x64 prime number, x64 sieve
Add to Basket
Kim Walisch
primesieve x64 uses the segmented sieve of Eratosthenes with wheel factorization, this algorithm has a complexity of operations and uses space.
Segmentation is currently the best known practical improvement to the sieve of Eratosthenes. Instead of sieving the interval [2, n] at once one subdivides the sieve interval into a number of equal sized segments that are then sieved consecutively. Segmentation drops the memory requirement of the sieve of Eratosthenes from to . The segment size is usually chosen to fit into the CPU's fast L1 or L2 cache memory which significantly speeds up sieving. A segmented version of the sieve of Eratosthenes was first published by Singleton in 1969 [1], Bays and Hudson in [2] describe the algorithm in more detail.
Wheel factorization is used to skip multiples of small primes. If a kth wheel is added to the sieve of Eratosthenes then only those multiples are crossed off that are coprime to the first k primes, i.e. multiples that are divisible by any of the first k primes are skipped. The 1st wheel considers only odd numbers, the 2nd wheel (modulo 6) skips multiples of 2 and 3, the 3rd wheel (modulo 30) skips multiples of 2, 3, 5 and so on. Pritchard has shown in [3] that the running time of the sieve of Eratosthenes can be reduced by a factor of if the wheel size is but for cache reasons the sieve of Eratosthenes usually performs best with a modulo 30 or 210 wheel. Sorenson explains wheels in [4].
Additionally primesieve uses Tomás Oliveira e Silva's cache-friendly bucket list algorithm if needed [5]. This algorithm is relatively new it has been devised by Tomás Oliveira e Silva in 2001 in order to speed up the segmented sieve of Eratosthenes for prime numbers past 32 bits. The idea is to store the sieving primes into lists of buckets with each list being associated with a segment. A list of sieving primes related to a specific segment contains only those primes that have multiple occurrence(s) in that segment. Whilst sieving a segment only the primes of the related list are used for sieving and each prime is reassigned to the list responsible for its next multiple when processed. The benefit of this approach is that it is now possible to use segments (i.e. sieve arrays) smaller than without deteriorating efficiency, this is important as only small segments that fit into the CPU's L1 or L2 cache provide fast memory access.
primesieve x64 is written entirely in C++ and does not depend on external libraries [6], it compiles with every standard compliant C++ compiler. Its speed is mainly due to the segmentation of the sieve of Eratosthenes which prevents cache misses when crossing off multiples in the sieve array and the use of a bit array instead of the more widely used byte (boolean) array. These are the optimizations I use in my implementation:
Uses a bit array with 30 numbers per byte for sieving
Pre-sieves multiples of small primes ? 19
Starts crossing off multiples at the square
Uses a modolo 210 wheel that skips multiples of 2, 3, 5 and 7
Uses specialized algorithms for small, medium and big sieving primes
Processes multiple sieving primes per loop iteration to increase instruction-level parallelism
Parallelized (multi-threaded) using OpenMP
To browse the latest primesieve source code online visit the 'Source' tab.
Segmentation is currently the best known practical improvement to the sieve of Eratosthenes. Instead of sieving the interval [2, n] at once one subdivides the sieve interval into a number of equal sized segments that are then sieved consecutively. Segmentation drops the memory requirement of the sieve of Eratosthenes from to . The segment size is usually chosen to fit into the CPU's fast L1 or L2 cache memory which significantly speeds up sieving. A segmented version of the sieve of Eratosthenes was first published by Singleton in 1969 [1], Bays and Hudson in [2] describe the algorithm in more detail.
Wheel factorization is used to skip multiples of small primes. If a kth wheel is added to the sieve of Eratosthenes then only those multiples are crossed off that are coprime to the first k primes, i.e. multiples that are divisible by any of the first k primes are skipped. The 1st wheel considers only odd numbers, the 2nd wheel (modulo 6) skips multiples of 2 and 3, the 3rd wheel (modulo 30) skips multiples of 2, 3, 5 and so on. Pritchard has shown in [3] that the running time of the sieve of Eratosthenes can be reduced by a factor of if the wheel size is but for cache reasons the sieve of Eratosthenes usually performs best with a modulo 30 or 210 wheel. Sorenson explains wheels in [4].
Additionally primesieve uses Tomás Oliveira e Silva's cache-friendly bucket list algorithm if needed [5]. This algorithm is relatively new it has been devised by Tomás Oliveira e Silva in 2001 in order to speed up the segmented sieve of Eratosthenes for prime numbers past 32 bits. The idea is to store the sieving primes into lists of buckets with each list being associated with a segment. A list of sieving primes related to a specific segment contains only those primes that have multiple occurrence(s) in that segment. Whilst sieving a segment only the primes of the related list are used for sieving and each prime is reassigned to the list responsible for its next multiple when processed. The benefit of this approach is that it is now possible to use segments (i.e. sieve arrays) smaller than without deteriorating efficiency, this is important as only small segments that fit into the CPU's L1 or L2 cache provide fast memory access.
primesieve x64 is written entirely in C++ and does not depend on external libraries [6], it compiles with every standard compliant C++ compiler. Its speed is mainly due to the segmentation of the sieve of Eratosthenes which prevents cache misses when crossing off multiples in the sieve array and the use of a bit array instead of the more widely used byte (boolean) array. These are the optimizations I use in my implementation:
Uses a bit array with 30 numbers per byte for sieving
Pre-sieves multiples of small primes ? 19
Starts crossing off multiples at the square
Uses a modolo 210 wheel that skips multiples of 2, 3, 5 and 7
Uses specialized algorithms for small, medium and big sieving primes
Processes multiple sieving primes per loop iteration to increase instruction-level parallelism
Parallelized (multi-threaded) using OpenMP
To browse the latest primesieve source code online visit the 'Source' tab.
OS: Windows 7 x64, Windows 8 x64, Windows 10 x64, Windows 11
Add Your Review or 64-bit Compatibility Report
Top CAD 64-bit downloads
AutoCAD 2019 2019
Tthe world's leading customizable and extendable CAD application
Trialware | $4 195.00
DAVID-Laserscanner 5.6.0.2037
A freeware software that allows you to scan/digitize three-dimensionals objects
Freeware
nanoCAD 5.1.2524.2017
nanoCAD - easy-to-use free CAD software delivering great user experience.
Freeware
MITCalc Slender strut buckling 1.20
Calculation of the slender strut (column) buckling
Shareware | $18.00
tags: buckling, slender strut, beam, column, moment, stress, safety, DIN 1025, 1026, 1028, 1029, cross-section, area characteristics, permitted stress, Johnson, Tetmajer, Euler, Secant
ShareCAD 2.0
Free online service to view DWG, DXF, IGS, STP, STL, SVG, CGM and other formats.
Freeware
tags: Sharecad, online viewer, free viewer, DWG viewer, free online viewer, CAD viewer, 2D viewer, 3D viewer, view DWG, iframe plugin, DWG, DXF, STEP, STP, IGES, IGS, STL, PDF, HPGL, PLT, CGM, SVG, EMF, WMF, PNG, JPEG
Members area
Top 64-bit Downloads
-
DWG TrueView 64-bit 2023
x64 freeware download -
CurveExpert Basic 2.2.3
x64 trialware download -
SewIconz 64-bit 1.9.0
x64 trialware download -
Strata Design 3D CX 8.0
x64 trialware download -
Embird x64 2023 B10.86
x64 trialware download -
Vextractor x64 7.20
x64 shareware download -
VisualMILL 2012 7.0.084
x64 demo download -
AutoCAD 2020 2025
x64 trialware download -
PolyTrans 5.6.5
x64 trialware download -
AKVIS Refocus 11.7
x64 trialware download
Top Downloads
-
CorelDRAW X5 2024 25.2.0.72
trialware download -
AutoCAD 2010
trialware download -
CorelDRAW X6 16.4.0.1280
trialware download -
CorelDRAW 2017 19.1.0.419
trialware download -
TinyPDF 3.00
freeware download -
DWG TrueView 64-bit 2023
freeware download -
AutoCAD 2019 2019
trialware download -
PhotoScape 3.7
freeware download -
AutoCAD 2014
trialware download -
Photo editor for Windows
10 XL 24.4.4
shareware download -
SortPix XL - Photo
Organizing Software 24.4.4
shareware download -
CurveExpert Basic 2.2.3
trialware download -
SewIconz 64-bit 1.9.0
trialware download -
nanoCAD 5.1.2524.2017
freeware download -
Real-DRAW PRO 5.2.4
trialware download