577 lines
16 KiB
C#
577 lines
16 KiB
C#
using System.Buffers;
|
|
using System.Collections.Concurrent;
|
|
using System.Runtime.CompilerServices;
|
|
using System.Runtime.InteropServices;
|
|
using ILGPU;
|
|
using ILGPU.Runtime;
|
|
|
|
namespace PerfectNumbers.Core.Gpu;
|
|
|
|
public sealed class MersenneNumberDivisorByDivisorGpuTester
|
|
{
|
|
private int _gpuBatchSize = GpuConstants.ScanBatchSize;
|
|
private readonly object _sync = new();
|
|
private ulong _divisorLimit;
|
|
private bool _isConfigured;
|
|
private ulong _lastStatusDivisor;
|
|
private bool _useDivisorCycles;
|
|
|
|
public readonly struct MontgomeryDivisorData(ulong modulus, ulong nPrime, ulong montgomeryOne, ulong montgomeryTwo)
|
|
{
|
|
public readonly ulong Modulus = modulus;
|
|
public readonly ulong NPrime = nPrime;
|
|
public readonly ulong MontgomeryOne = montgomeryOne;
|
|
public readonly ulong MontgomeryTwo = montgomeryTwo;
|
|
}
|
|
|
|
private readonly ConcurrentDictionary<Accelerator, Action<Index1D, ulong, ArrayView<MontgomeryDivisorData>, ArrayView<byte>>> _kernelCache = new();
|
|
private readonly ConcurrentDictionary<Accelerator, Action<Index1D, MontgomeryDivisorData, ArrayView<ulong>, ArrayView<byte>>> _kernelByPrimeCache = new();
|
|
|
|
private Action<Index1D, ulong, ArrayView<MontgomeryDivisorData>, ArrayView<byte>> GetKernel(Accelerator accelerator) =>
|
|
_kernelCache.GetOrAdd(accelerator, acc => acc.LoadAutoGroupedStreamKernel<Index1D, ulong, ArrayView<MontgomeryDivisorData>, ArrayView<byte>>(CheckKernel));
|
|
private Action<Index1D, MontgomeryDivisorData, ArrayView<ulong>, ArrayView<byte>> GetKernelByPrime(Accelerator accelerator) =>
|
|
_kernelByPrimeCache.GetOrAdd(accelerator, acc => acc.LoadAutoGroupedStreamKernel<Index1D, MontgomeryDivisorData, ArrayView<ulong>, ArrayView<byte>>(CheckKernelByPrime));
|
|
|
|
public int GpuBatchSize
|
|
{
|
|
get => _gpuBatchSize;
|
|
set => _gpuBatchSize = Math.Max(1, value);
|
|
}
|
|
|
|
public bool UseDivisorCycles
|
|
{
|
|
get => _useDivisorCycles;
|
|
set => _useDivisorCycles = value;
|
|
}
|
|
|
|
public void ConfigureFromMaxPrime(ulong maxPrime)
|
|
{
|
|
lock (_sync)
|
|
{
|
|
_divisorLimit = ComputeDivisorLimitFromMaxPrime(maxPrime);
|
|
_lastStatusDivisor = 0UL;
|
|
_isConfigured = true;
|
|
}
|
|
}
|
|
|
|
public bool IsPrime(ulong prime, out bool divisorsExhausted)
|
|
{
|
|
if (!_isConfigured)
|
|
{
|
|
throw new InvalidOperationException("ConfigureFromMaxPrime must be called before using the tester.");
|
|
}
|
|
|
|
ulong allowedMax = ComputeAllowedMaxDivisor(prime);
|
|
if (allowedMax < 3UL)
|
|
{
|
|
divisorsExhausted = true;
|
|
return true;
|
|
}
|
|
|
|
bool composite, coveredRange;
|
|
|
|
// TODO: Let's rework this to check if the number is prime and check divisors outside of the lock. Lock and update the state afterwards.
|
|
lock (_sync)
|
|
{
|
|
composite = CheckDivisors(prime, allowedMax, out ulong lastProcessed, out coveredRange);
|
|
|
|
if (lastProcessed != 0UL)
|
|
{
|
|
ReportStatus(lastProcessed);
|
|
}
|
|
}
|
|
|
|
if (composite)
|
|
{
|
|
divisorsExhausted = true;
|
|
return false;
|
|
}
|
|
|
|
divisorsExhausted = coveredRange;
|
|
return true;
|
|
}
|
|
|
|
private bool CheckDivisors(ulong prime, ulong allowedMax, out ulong lastProcessed, out bool coveredRange)
|
|
{
|
|
// TODO: We should be able to calculate allowedMax outside in the parent method, unless it depends from some changing value.
|
|
allowedMax = Math.Min(allowedMax, _divisorLimit);
|
|
lastProcessed = 0UL;
|
|
|
|
if (allowedMax < 3UL)
|
|
{
|
|
coveredRange = true;
|
|
return false;
|
|
}
|
|
|
|
// TODO: Rent these in the parent method before the loops - batch size doesn't change
|
|
var gpuLease = GpuContextPool.RentPreferred(preferCpu: false);
|
|
var accelerator = gpuLease.Accelerator;
|
|
var kernel = GetKernel(accelerator);
|
|
|
|
int batchCapacity = _gpuBatchSize;
|
|
// TODO: Rent buffers in the parent method before the loops - batch size doesn't change
|
|
var divisorsBuffer = accelerator.Allocate1D<MontgomeryDivisorData>(batchCapacity);
|
|
var hitsBuffer = accelerator.Allocate1D<byte>(batchCapacity);
|
|
ulong[] divisors = ArrayPool<ulong>.Shared.Rent(batchCapacity);
|
|
byte[] hits = ArrayPool<byte>.Shared.Rent(batchCapacity);
|
|
MontgomeryDivisorData[] divisorData = ArrayPool<MontgomeryDivisorData>.Shared.Rent(batchCapacity);
|
|
|
|
bool composite = false;
|
|
bool processedAll = false;
|
|
ulong cycle, divisor = 3UL, next;
|
|
int batchSize, i;
|
|
bool reachedEndInBatch, useCycles = _useDivisorCycles;
|
|
|
|
Span<MontgomeryDivisorData> divisorDataSpan;
|
|
Span<ulong> divisorSpan;
|
|
Span<byte> hitsSpan;
|
|
MersenneDivisorCycles divisorCycles = MersenneDivisorCycles.Shared;
|
|
ArrayView1D<MontgomeryDivisorData, Stride1D.Dense> divisorView;
|
|
ArrayView1D<byte, Stride1D.Dense> hitsView;
|
|
|
|
while (divisor <= allowedMax)
|
|
{
|
|
batchSize = 0;
|
|
reachedEndInBatch = false;
|
|
|
|
while (batchSize < batchCapacity && divisor <= allowedMax)
|
|
{
|
|
if (useCycles)
|
|
{
|
|
cycle = divisorCycles!.GetCycle(divisor);
|
|
if (cycle == 0UL || prime % cycle != 0UL)
|
|
{
|
|
ReportStatus(divisor);
|
|
}
|
|
else
|
|
{
|
|
divisors[batchSize++] = divisor;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
divisors[batchSize++] = divisor;
|
|
}
|
|
|
|
next = divisor + 2UL;
|
|
|
|
// This will be only true when we exceed ulong.MaxValue
|
|
if (next <= divisor)
|
|
{
|
|
reachedEndInBatch = true;
|
|
break;
|
|
}
|
|
|
|
if (next > allowedMax)
|
|
{
|
|
divisor = next;
|
|
reachedEndInBatch = true;
|
|
break;
|
|
}
|
|
|
|
divisor = next;
|
|
}
|
|
|
|
if (batchSize == 0)
|
|
{
|
|
break;
|
|
}
|
|
|
|
divisorDataSpan = divisorData.AsSpan(0, batchSize);
|
|
divisorView = divisorsBuffer.View.SubView(0, batchSize);
|
|
hitsView = hitsBuffer.View.SubView(0, batchSize);
|
|
|
|
divisorSpan = divisors.AsSpan(0, batchSize);
|
|
hitsSpan = hits.AsSpan(0, batchSize);
|
|
|
|
for (i = 0; i < batchSize; i++)
|
|
{
|
|
divisorDataSpan[i] = CreateMontgomeryDivisorData(divisorSpan[i]);
|
|
}
|
|
|
|
divisorView.CopyFromCPU(ref MemoryMarshal.GetReference(divisorDataSpan), batchSize);
|
|
kernel(batchSize, prime, divisorView, hitsView);
|
|
accelerator.Synchronize();
|
|
hitsView.CopyToCPU(ref MemoryMarshal.GetReference(hitsSpan), batchSize);
|
|
|
|
for (i = 0; i < batchSize; i++)
|
|
{
|
|
if (hitsSpan[i] != 0)
|
|
{
|
|
composite = true;
|
|
break;
|
|
}
|
|
}
|
|
|
|
ReportStatus(divisorSpan[i < batchSize ? i : i - 1]);
|
|
if (composite)
|
|
{
|
|
break;
|
|
}
|
|
|
|
if (reachedEndInBatch)
|
|
{
|
|
processedAll = true;
|
|
break;
|
|
}
|
|
}
|
|
|
|
coveredRange = composite || processedAll || divisor > allowedMax;
|
|
|
|
ArrayPool<byte>.Shared.Return(hits, clearArray: true);
|
|
ArrayPool<ulong>.Shared.Return(divisors, clearArray: true);
|
|
ArrayPool<MontgomeryDivisorData>.Shared.Return(divisorData, clearArray: true);
|
|
hitsBuffer.Dispose();
|
|
divisorsBuffer.Dispose();
|
|
gpuLease.Dispose();
|
|
|
|
return composite;
|
|
}
|
|
|
|
private void ReportStatus(ulong divisor)
|
|
{
|
|
if (++_lastStatusDivisor == PerfectNumberConstants.ConsoleInterval)
|
|
{
|
|
Console.WriteLine($"...processed by-divisor candidate = {divisor}");
|
|
_lastStatusDivisor = 0;
|
|
}
|
|
}
|
|
|
|
private static ulong ComputeDivisorLimitFromMaxPrime(ulong maxPrime)
|
|
{
|
|
if (maxPrime <= 1UL)
|
|
{
|
|
return 0UL;
|
|
}
|
|
|
|
if (maxPrime - 1UL >= 64UL)
|
|
{
|
|
return ulong.MaxValue;
|
|
}
|
|
|
|
return (1UL << (int)(maxPrime - 1UL)) - 1UL;
|
|
}
|
|
|
|
private ulong ComputeAllowedMaxDivisor(ulong prime)
|
|
{
|
|
if (prime <= 1UL)
|
|
{
|
|
return 0UL;
|
|
}
|
|
|
|
if (prime - 1UL >= 64UL)
|
|
{
|
|
return _divisorLimit;
|
|
}
|
|
|
|
ulong maxByPrime = (1UL << (int)(prime - 1UL)) - 1UL;
|
|
return Math.Min(maxByPrime, _divisorLimit);
|
|
}
|
|
|
|
private static void CheckKernel(Index1D index, ulong prime, ArrayView<MontgomeryDivisorData> divisors, ArrayView<byte> hits)
|
|
{
|
|
MontgomeryDivisorData divisor = divisors[index];
|
|
if (divisor.Modulus <= 1UL || (divisor.Modulus & 1UL) == 0UL)
|
|
{
|
|
hits[index] = 0;
|
|
return;
|
|
}
|
|
|
|
ulong pow = Pow2Mod(prime, divisor);
|
|
hits[index] = pow == 1UL ? (byte)1 : (byte)0;
|
|
}
|
|
|
|
public sealed class DivisorScanSession : IDisposable
|
|
{
|
|
private readonly MersenneNumberDivisorByDivisorGpuTester _owner;
|
|
private readonly GpuContextPool.GpuContextLease _lease;
|
|
private readonly Accelerator _accelerator;
|
|
private readonly Action<Index1D, MontgomeryDivisorData, ArrayView<ulong>, ArrayView<byte>> _kernel;
|
|
private readonly MemoryBuffer1D<ulong, Stride1D.Dense> _primesBuffer;
|
|
private readonly MemoryBuffer1D<byte, Stride1D.Dense> _hitsBuffer;
|
|
private readonly ulong[] _primesHost;
|
|
private readonly byte[] _hitsHost;
|
|
private readonly int[] _indexHost;
|
|
private bool _disposed;
|
|
|
|
internal DivisorScanSession(MersenneNumberDivisorByDivisorGpuTester owner)
|
|
{
|
|
_owner = owner;
|
|
_lease = GpuContextPool.RentPreferred(preferCpu: false);
|
|
_accelerator = _lease.Accelerator;
|
|
_kernel = owner.GetKernelByPrime(_accelerator);
|
|
_primesBuffer = _accelerator.Allocate1D<ulong>(owner._gpuBatchSize);
|
|
_hitsBuffer = _accelerator.Allocate1D<byte>(owner._gpuBatchSize);
|
|
_primesHost = ArrayPool<ulong>.Shared.Rent(owner._gpuBatchSize);
|
|
_hitsHost = ArrayPool<byte>.Shared.Rent(owner._gpuBatchSize);
|
|
_indexHost = ArrayPool<int>.Shared.Rent(owner._gpuBatchSize);
|
|
}
|
|
|
|
public void CheckDivisor(ulong divisor, ReadOnlySpan<ulong> primes, Span<byte> hits)
|
|
{
|
|
if (_disposed)
|
|
{
|
|
throw new ObjectDisposedException(nameof(DivisorScanSession));
|
|
}
|
|
|
|
int offset = 0;
|
|
MersenneNumberDivisorByDivisorGpuTester owner = _owner;
|
|
int gpuBatchSize = owner._gpuBatchSize;
|
|
bool useCycles = owner._useDivisorCycles;
|
|
byte[] hitsHost = _hitsHost;
|
|
int[] indexHost = _indexHost;
|
|
ulong[] primesHost = _primesHost;
|
|
Accelerator accelerator = _accelerator;
|
|
MemoryBuffer1D<byte, Stride1D.Dense> hitsBuffer = _hitsBuffer;
|
|
MemoryBuffer1D<ulong, Stride1D.Dense> primesBuffer = _primesBuffer;
|
|
ArrayView1D<ulong, Stride1D.Dense> primesBufferView = primesBuffer.View;
|
|
ArrayView1D<byte, Stride1D.Dense> hitsBufferView = hitsBuffer.View;
|
|
Action<Index1D, MontgomeryDivisorData, ArrayView<ulong>, ArrayView<byte>> kernel = _kernel;
|
|
ArrayView1D<ulong, Stride1D.Dense> primesView;
|
|
ArrayView1D<byte, Stride1D.Dense> hitsView;
|
|
MersenneDivisorCycles? divisorCycles = useCycles ? MersenneDivisorCycles.Shared : null;
|
|
ulong cycle = useCycles ? divisorCycles!.GetCycle(divisor) : 0UL, primeValue;
|
|
MontgomeryDivisorData divisorData = CreateMontgomeryDivisorData(divisor);
|
|
Span<ulong> primeSpan = [];
|
|
ReadOnlySpan<ulong> primesSlice;
|
|
Span<int> indexSpan = [];
|
|
Span<byte> hitSpan = [];
|
|
Span<byte> hitsSlice;
|
|
int batchSize, currentSpanSize = -1, gpuCount, i, primesLength = primes.Length;
|
|
|
|
while (offset < primesLength)
|
|
{
|
|
batchSize = Math.Min(gpuBatchSize, primesLength - offset);
|
|
primesSlice = primes.Slice(offset, batchSize);
|
|
hitsSlice = hits.Slice(offset, batchSize);
|
|
|
|
if (useCycles)
|
|
{
|
|
if (batchSize != currentSpanSize)
|
|
{
|
|
primeSpan = primesHost.AsSpan(0, batchSize);
|
|
indexSpan = indexHost.AsSpan(0, batchSize);
|
|
hitSpan = hitsHost.AsSpan(0, batchSize);
|
|
currentSpanSize = batchSize;
|
|
}
|
|
|
|
gpuCount = 0;
|
|
|
|
for (i = 0; i < batchSize; i++)
|
|
{
|
|
primeValue = primesSlice[i];
|
|
if (cycle == 0UL || primeValue % cycle != 0UL)
|
|
{
|
|
hitsSlice[i] = 0;
|
|
continue;
|
|
}
|
|
|
|
indexSpan[gpuCount] = i;
|
|
primeSpan[gpuCount] = primeValue;
|
|
gpuCount++;
|
|
}
|
|
|
|
if (gpuCount > 0)
|
|
{
|
|
primesView = primesBufferView.SubView(0, gpuCount);
|
|
hitsView = hitsBufferView.SubView(0, gpuCount);
|
|
|
|
primesView.CopyFromCPU(ref MemoryMarshal.GetReference(primeSpan), gpuCount);
|
|
kernel(gpuCount, divisorData, primesView, hitsView);
|
|
accelerator.Synchronize();
|
|
|
|
hitsView.CopyToCPU(ref MemoryMarshal.GetReference(hitSpan), gpuCount);
|
|
for (i = 0; i < gpuCount; i++)
|
|
{
|
|
hitsSlice[indexSpan[i]] = hitSpan[i];
|
|
}
|
|
}
|
|
}
|
|
else
|
|
{
|
|
primesView = primesBufferView.SubView(0, batchSize);
|
|
hitsView = hitsBufferView.SubView(0, batchSize);
|
|
|
|
primesView.CopyFromCPU(ref MemoryMarshal.GetReference(primesSlice), batchSize);
|
|
kernel(batchSize, divisorData, primesView, hitsView);
|
|
accelerator.Synchronize();
|
|
|
|
hitsView.CopyToCPU(ref MemoryMarshal.GetReference(hitsSlice), batchSize);
|
|
}
|
|
|
|
offset += batchSize;
|
|
}
|
|
}
|
|
|
|
public void Dispose()
|
|
{
|
|
if (_disposed)
|
|
{
|
|
return;
|
|
}
|
|
|
|
_disposed = true;
|
|
ArrayPool<ulong>.Shared.Return(_primesHost, clearArray: true);
|
|
ArrayPool<byte>.Shared.Return(_hitsHost, clearArray: true);
|
|
ArrayPool<int>.Shared.Return(_indexHost, clearArray: true);
|
|
_primesBuffer.Dispose();
|
|
_hitsBuffer.Dispose();
|
|
_lease.Dispose();
|
|
}
|
|
}
|
|
|
|
private static ulong Pow2Mod(ulong exponent, MontgomeryDivisorData divisor)
|
|
{
|
|
ulong modulus = divisor.Modulus;
|
|
if (modulus <= 1UL || (modulus & 1UL) == 0UL)
|
|
{
|
|
return 0UL;
|
|
}
|
|
|
|
ulong result = divisor.MontgomeryOne;
|
|
ulong baseVal = divisor.MontgomeryTwo;
|
|
ulong exp = exponent;
|
|
while (exp > 0UL)
|
|
{
|
|
if ((exp & 1UL) != 0UL)
|
|
{
|
|
result = MontgomeryMultiply(result, baseVal, modulus, divisor.NPrime);
|
|
}
|
|
|
|
exp >>= 1;
|
|
if (exp == 0UL)
|
|
{
|
|
break;
|
|
}
|
|
|
|
baseVal = MontgomeryMultiply(baseVal, baseVal, modulus, divisor.NPrime);
|
|
}
|
|
|
|
return MontgomeryMultiply(result, 1UL, modulus, divisor.NPrime);
|
|
}
|
|
|
|
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
|
private static ulong MontgomeryMultiply(ulong a, ulong b, ulong modulus, ulong nPrime)
|
|
{
|
|
ulong tLow = unchecked(a * b);
|
|
ulong m = unchecked(tLow * nPrime);
|
|
ulong sumLow = unchecked(tLow + m * modulus);
|
|
ulong carry = sumLow < tLow ? 1UL : 0UL;
|
|
ulong sumHigh = unchecked(MultiplyHigh(a, b) + MultiplyHigh(m, modulus) + carry);
|
|
|
|
ulong result = sumHigh;
|
|
if (result >= modulus)
|
|
{
|
|
result -= modulus;
|
|
}
|
|
|
|
return result;
|
|
}
|
|
|
|
private static void CheckKernelByPrime(Index1D index, MontgomeryDivisorData divisor, ArrayView<ulong> primes, ArrayView<byte> hits)
|
|
{
|
|
ulong prime = primes[index];
|
|
if (divisor.Modulus <= 1UL || (divisor.Modulus & 1UL) == 0UL)
|
|
{
|
|
hits[index] = 0;
|
|
return;
|
|
}
|
|
|
|
ulong pow = Pow2Mod(prime, divisor);
|
|
hits[index] = pow == 1UL ? (byte)1 : (byte)0;
|
|
}
|
|
|
|
private static MontgomeryDivisorData CreateMontgomeryDivisorData(ulong modulus)
|
|
{
|
|
if (modulus <= 1UL || (modulus & 1UL) == 0UL)
|
|
{
|
|
return new MontgomeryDivisorData(modulus, 0UL, 0UL, 0UL);
|
|
}
|
|
|
|
ulong nPrime = ComputeMontgomeryNPrime(modulus);
|
|
ulong montgomeryOne = ComputeMontgomeryResidue(1UL, modulus);
|
|
ulong montgomeryTwo = ComputeMontgomeryResidue(2UL, modulus);
|
|
return new MontgomeryDivisorData(modulus, nPrime, montgomeryOne, montgomeryTwo);
|
|
}
|
|
|
|
private static ulong ComputeMontgomeryResidue(ulong value, ulong modulus)
|
|
{
|
|
UInt128 r = UInt128.One << 64;
|
|
UInt128 result = ((UInt128)value * r) % modulus;
|
|
return (ulong)result;
|
|
}
|
|
|
|
private static ulong ComputeMontgomeryNPrime(ulong modulus)
|
|
{
|
|
ulong inv = modulus;
|
|
inv *= unchecked(2UL - modulus * inv);
|
|
inv *= unchecked(2UL - modulus * inv);
|
|
inv *= unchecked(2UL - modulus * inv);
|
|
inv *= unchecked(2UL - modulus * inv);
|
|
inv *= unchecked(2UL - modulus * inv);
|
|
inv *= unchecked(2UL - modulus * inv);
|
|
return unchecked(0UL - inv);
|
|
}
|
|
|
|
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
|
private static ulong MultiplyHigh(ulong x, ulong y)
|
|
{
|
|
ulong xLow = (uint)x;
|
|
ulong xHigh = x >> 32;
|
|
ulong yLow = (uint)y;
|
|
ulong yHigh = y >> 32;
|
|
|
|
ulong lowProduct = xLow * yLow;
|
|
ulong mid = xHigh * yLow + (lowProduct >> 32);
|
|
ulong midLow = mid & 0xFFFFFFFFUL;
|
|
ulong midHigh = mid >> 32;
|
|
midLow += xLow * yHigh;
|
|
|
|
ulong resultHigh = xHigh * yHigh + midHigh + (midLow >> 32);
|
|
return resultHigh;
|
|
}
|
|
|
|
public ulong DivisorLimit
|
|
{
|
|
get
|
|
{
|
|
lock (_sync)
|
|
{
|
|
if (!_isConfigured)
|
|
{
|
|
throw new InvalidOperationException("ConfigureFromMaxPrime must be called before using the tester.");
|
|
}
|
|
|
|
return _divisorLimit;
|
|
}
|
|
}
|
|
}
|
|
|
|
public ulong GetAllowedMaxDivisor(ulong prime)
|
|
{
|
|
lock (_sync)
|
|
{
|
|
if (!_isConfigured)
|
|
{
|
|
throw new InvalidOperationException("ConfigureFromMaxPrime must be called before using the tester.");
|
|
}
|
|
|
|
return ComputeAllowedMaxDivisor(prime);
|
|
}
|
|
}
|
|
|
|
public DivisorScanSession CreateDivisorSession()
|
|
{
|
|
lock (_sync)
|
|
{
|
|
if (!_isConfigured)
|
|
{
|
|
throw new InvalidOperationException("ConfigureFromMaxPrime must be called before using the tester.");
|
|
}
|
|
|
|
return new DivisorScanSession(this);
|
|
}
|
|
}
|
|
}
|
|
|