mlemanczyk/even-perfect-numbers-scanner
1
0 Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Warm GPU resources before thread startup

Browse Source
This commit is contained in:
Marek Lemańczyk authored and mlemanczyk committed 2025-11-02 11:22:28 +01:00
1 parent 2281d9535e
commit ab6a416de2
9 files changed
+822 -403
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

PerfectNumbers.Core/HeuristicPrimeSieves.cs
+20 -19
View File
@@ -15,19 +15,19 @@ public static class HeuristicPrimeSieves
private static readonly ushort[] GroupBResiduesEnding7 = [17, 37, 47, 67, 97, 107, 127, 137, 157, 167, 187, 197];
private static readonly ushort[] GroupBResiduesEnding9 = [19, 29, 59, 79, 89, 109, 139, 149, 169, 179, 199, 209];
private static readonly int[] GroupADivisorsStorage;
private static readonly ulong[] GroupADivisorsStorage;
private static readonly ulong[] GroupADivisorSquaresStorage;
private static readonly int[] GroupBDivisorsEnding1Storage;
private static readonly ulong[] GroupBDivisorsEnding1Storage;
private static readonly ulong[] GroupBDivisorSquaresEnding1Storage;
private static readonly int[] GroupBDivisorsEnding3Storage;
private static readonly ulong[] GroupBDivisorsEnding3Storage;
private static readonly ulong[] GroupBDivisorSquaresEnding3Storage;
private static readonly int[] GroupBDivisorsEnding7Storage;
private static readonly ulong[] GroupBDivisorsEnding7Storage;
private static readonly ulong[] GroupBDivisorSquaresEnding7Storage;
private static readonly int[] GroupBDivisorsEnding9Storage;
private static readonly ulong[] GroupBDivisorsEnding9Storage;
private static readonly ulong[] GroupBDivisorSquaresEnding9Storage;
static HeuristicPrimeSieves()
@@ -46,45 +46,46 @@ public static class HeuristicPrimeSieves
// Intentionally left blank. Accessing this method forces the static constructor to run.
}
public static ReadOnlySpan<int> GroupADivisors => GroupADivisorsStorage;
public static ReadOnlySpan<ulong> GroupADivisors => GroupADivisorsStorage;
public static ReadOnlySpan<ulong> GroupADivisorSquares => GroupADivisorSquaresStorage;
public static ReadOnlySpan<int> GroupBDivisorsEnding1 => GroupBDivisorsEnding1Storage;
public static ReadOnlySpan<ulong> GroupBDivisorsEnding1 => GroupBDivisorsEnding1Storage;
public static ReadOnlySpan<ulong> GroupBDivisorSquaresEnding1 => GroupBDivisorSquaresEnding1Storage;
public static ReadOnlySpan<int> GroupBDivisorsEnding3 => GroupBDivisorsEnding3Storage;
public static ReadOnlySpan<ulong> GroupBDivisorsEnding3 => GroupBDivisorsEnding3Storage;
public static ReadOnlySpan<ulong> GroupBDivisorSquaresEnding3 => GroupBDivisorSquaresEnding3Storage;
public static ReadOnlySpan<int> GroupBDivisorsEnding7 => GroupBDivisorsEnding7Storage;
public static ReadOnlySpan<ulong> GroupBDivisorsEnding7 => GroupBDivisorsEnding7Storage;
public static ReadOnlySpan<ulong> GroupBDivisorSquaresEnding7 => GroupBDivisorSquaresEnding7Storage;
public static ReadOnlySpan<int> GroupBDivisorsEnding9 => GroupBDivisorsEnding9Storage;
public static ReadOnlySpan<ulong> GroupBDivisorsEnding9 => GroupBDivisorsEnding9Storage;
public static ReadOnlySpan<ulong> GroupBDivisorSquaresEnding9 => GroupBDivisorSquaresEnding9Storage;
private static (int[] divisors, ulong[] squares) BuildGroupADivisors()
private static (ulong[] divisors, ulong[] squares) BuildGroupADivisors()
{
var divisors = new int[SieveLength];
var divisors = new ulong[SieveLength];
var squares = new ulong[SieveLength];
int index = 0;
for (; index < GroupAConstants.Length && index < divisors.Length; index++)
{
int value = GroupAConstants[index];
ulong value = (ulong)GroupAConstants[index];
divisors[index] = value;
squares[index] = (ulong)value * (ulong)value;
squares[index] = value * value;
}
int candidate = 23;
int incrementIndex = 0;
while (index < divisors.Length)
{
divisors[index] = candidate;
squares[index] = (ulong)candidate * (ulong)candidate;
ulong value = (ulong)candidate;
divisors[index] = value;
squares[index] = value * value;
candidate += GroupAIncrementPattern[incrementIndex];
incrementIndex ^= 1;
@@ -94,9 +95,9 @@ public static class HeuristicPrimeSieves
return (divisors, squares);
}
private static (int[] divisors, ulong[] squares) BuildGroupBResidueSieve(ReadOnlySpan<ushort> residues)
private static (ulong[] divisors, ulong[] squares) BuildGroupBResidueSieve(ReadOnlySpan<ushort> residues)
{
var divisors = new int[SieveLength];
var divisors = new ulong[SieveLength];
var squares = new ulong[SieveLength];
int index = 0;
@@ -112,7 +113,7 @@ public static class HeuristicPrimeSieves
continue;
}
divisors[index] = (int)candidate;
divisors[index] = candidate;
squares[index] = candidate * candidate;
index++;
}