Every cuFFT plan has the driver compile cuFFT's PTX kernels: cufftMakePlanMany -> cuModuleLoadData -> the PTX JIT, under cuFFT's process-wide lock. A second plan of the same shape pays again, even while the first is alive. The CUDA JIT cache makes that ~1 ms. Without one (CUDA_CACHE_DISABLE, no writable $HOME) a plan costs 20-250 ms. That holds for every size (64^3 and 1D 256 included), every transform type and batch, on sm_75 and sm_120, with cuFFT 11.2, 12.0 and 12.4. No CUFFT_* setting changes it, so a choice of grid sizes cannot avoid it; only the number of plans made can be cut. Before this change, a plan was lent to one user at a time, so each concurrent user of a shape on a card made its own: 9-24 rigid-body engines, the translation slices and the score engines. Now a plan is made once per card and shape and shared. Each user keeps its own stream and work area, and CudaFFTPlan::R2C/C2R set both and launch under the plan's mutex. Shared plans give the same bits as private ones: 8 threads on one plan with their own work areas, 9 shapes x 160 transforms, 0 mismatches on RTX 5080 and T4. A shared work area, the negative control, gives 2-13 mismatches per shape where the plan has a work area. The rigid-body engine also dropped its batch-3 plan: the Jacobian transforms its three grids one at a time on the batch-1 plan. That gives the same bits (10 zone-grid shapes, sm_75 and sm_120) and one plan less per zone and card. The cytochrome C and thaumatin MR test sets, AF models (MR step, s): 4x T4 cytc cache on 2.22 -> 2.22 cache off 8.41 -> 4.00 plans 86 -> 24 4x T4 thau cache on 1.58 -> 1.61 cache off 11.13 -> 3.08 plans 131 -> 23 1x T4 cytc cache on 2.87 -> 2.81 cache off 8.82 -> 3.84 plans 80 -> 12 1x T4 thau cache on 2.41 -> 2.39 cache off 10.42 -> 3.17 plans 104 -> 11 RTX5080 cytc cache on 1.41 -> 1.12 cache off 6.5-10.7 -> 2.02 RTX5080 thau cache on 0.90 -> 0.85 cache off 8.03 -> 1.60 Outputs are bit-identical before and after, cache on or off: model, merged hkl, maps, and every MR and validation log line. The mtz/cif differ only in the command line they record. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01PXc1zD1yxHqaR1DGdCTHL4
138 lines
7.1 KiB
C++
138 lines
7.1 KiB
C++
// SPDX-FileCopyrightText: 2026 Filip Leonarski, Paul Scherrer Institute <filip.leonarski@psi.ch>
|
|
// SPDX-License-Identifier: GPL-3.0-only
|
|
|
|
#pragma once
|
|
|
|
// The device half of RigidBodyTargetGPU (RigidBodyGPU.h): one engine is one CUDA stream and the buffers
|
|
// for one resolution zone of one fit. The host half works out everything that depends only on the
|
|
// model, the cell and the zone - with gemmi, which stays out of nvcc - and hands it over in the plain
|
|
// structures below; the engine then does, per evaluation, what depends on the placement. CUDA builds
|
|
// only.
|
|
|
|
#include <array>
|
|
#include <cstddef>
|
|
#include <memory>
|
|
#include <stdexcept>
|
|
#include <vector>
|
|
|
|
#include "ModelDensityGPU.h" // ModelDensityAtom
|
|
|
|
// One term of SymmetryComposition: F1 at k = hR, times the phase of the operator's translation.
|
|
struct RigidBodyGPUTerm {
|
|
int index; // of F1(k) in the half-u transform, or of F1(-k) where k is outside the stored half
|
|
int conj; // read as the Friedel mate, conj F1(-k)
|
|
double phase[2]; // exp(+2 pi i h.t), real and imaginary
|
|
double s[3]; // k as a Cartesian reciprocal vector
|
|
};
|
|
|
|
// Everything a zone needs that does not depend on the placement.
|
|
struct RigidBodyGPUZone {
|
|
int nu = 0, nv = 0, nw = 0; // the zone's grid, u fastest
|
|
double orth[9] = {}, frac[9] = {}; // row-major
|
|
double volume = 0;
|
|
double blur = 0; // DensityCalculator's, which the rows' unblur undoes
|
|
std::vector<ModelDensityAtom> atoms; // model order
|
|
|
|
// The bulk-solvent mask's atoms: the model's index of each, and its radius (probe included).
|
|
std::vector<int> mask_atom;
|
|
std::vector<float> mask_radius;
|
|
// Every image: the group's operators, each with each centring vector, fractional.
|
|
std::vector<std::array<double, 12>> images; // rot[9] row-major, tran[3]
|
|
|
|
// The composition: rows (composed indices) and Ops() terms per row, row-major.
|
|
std::vector<std::array<int, 3>> row_hkl;
|
|
std::vector<double> row_scale; // n_cen * unblur
|
|
std::vector<double> row_stol2;
|
|
size_t ops = 1;
|
|
std::vector<RigidBodyGPUTerm> terms;
|
|
|
|
// The observations the residuals are over: each one's row (-1 without one) and amplitude.
|
|
std::vector<int> obs_row;
|
|
std::vector<float> obs_fobs, obs_sigma;
|
|
double f_mean = 1;
|
|
// The scale's points: the observations gemmi's prepare_points() would take, in order.
|
|
std::vector<int> point_obs;
|
|
std::vector<std::array<int, 3>> point_hkl;
|
|
std::vector<double> point_stol2;
|
|
std::vector<float> point_fobs, point_sigma;
|
|
std::vector<std::array<double, 6>> constraints; // adp_symmetry_constraints()
|
|
};
|
|
|
|
// Upper bounds an engine is sized for.
|
|
struct RigidBodyGPUCapacity {
|
|
size_t atoms = 0;
|
|
size_t grid_points = 0; // nu * nv * nw
|
|
size_t complex_points = 0; // (nu / 2 + 1) * nv * nw
|
|
size_t bricks = 0;
|
|
size_t pairs = 0; // (brick, atom) pairs of the gather
|
|
size_t rows = 0, terms = 0;
|
|
size_t observations = 0;
|
|
size_t fft_work_bytes = 0;
|
|
};
|
|
|
|
// FitModelScale()'s solvent grid on five or fewer strong reflections, where its fits chain from one grid
|
|
// point to the next and the device does not reproduce it (ModelScaleGPU::FitSolvent).
|
|
class ModelScaleGPUTooFewReflections : public std::runtime_error {
|
|
public:
|
|
ModelScaleGPUTooFewReflections() : std::runtime_error("ModelScaleGPU::FitSolvent: too few reflections for independent grid points") {}
|
|
};
|
|
|
|
struct RigidBodyGPUEngineImpl;
|
|
|
|
class RigidBodyGPUEngine {
|
|
public:
|
|
// The bytes an engine of this capacity reserves on the device.
|
|
static size_t DeviceBytes(const RigidBodyGPUCapacity &capacity);
|
|
// The cuFFT work area a (nu, nv, nw) grid needs.
|
|
static size_t FFTWorkBytes(int nu, int nv, int nw);
|
|
// (brick, atom) pairs of the gather over at most, for a zone's atoms on its grid.
|
|
static size_t PairBound(const RigidBodyGPUZone &zone);
|
|
static size_t Bricks(int nu, int nv, int nw);
|
|
// The most gather bricks the 2 d + 1 points of an atom's box can fall in along an axis of n points.
|
|
static size_t AxisBrickBound(int d, int n);
|
|
// Whether the gather reproduces gemmi's box walk on this zone: every atom's box narrower than the cell,
|
|
// so that no point is reached by two images of one atom.
|
|
static bool Supports(const RigidBodyGPUZone &zone);
|
|
static int CurrentDevice();
|
|
|
|
RigidBodyGPUEngine(const RigidBodyGPUCapacity &capacity, int device);
|
|
~RigidBodyGPUEngine();
|
|
int Device() const;
|
|
|
|
// Per fit: each atom's position relative to the model centroid, which the placements rotate.
|
|
void SetBody(const std::vector<std::array<double, 3>> &relative);
|
|
// Per zone. Throws if the zone does not fit the capacity.
|
|
void SetZone(const RigidBodyGPUZone &zone);
|
|
|
|
// Per evaluation, at the placement x -> R x_rel + t: Fcalc and dF/dt at the rows, then the bulk-
|
|
// solvent mask of the same placement (ModelMaskGPU) and Fmask.
|
|
void Fcalc(const double rotation[9], const double translation[3]);
|
|
void Fmask();
|
|
// Per zone, after SetZone(): fixed atoms beside the body that are copies of it, each placed at (R, t) -
|
|
// rotation row-major, then translation, as Fcalc() takes them. Their Fcalc, composed one copy at a time,
|
|
// is added to the body's in every composition from now on, and the bulk-solvent mask of them and of the
|
|
// body at `moving` is held at the rows in place of Fmask()'s.
|
|
void SetFixedCopies(const std::vector<std::array<double, 12>> &fixed, const std::array<double, 12> &moving);
|
|
// The scale at this evaluation's Fcalc and Fmask (ModelScaleGPU): FitModelScale()'s solvent grid, and
|
|
// the overall scale and anisotropic B at a fixed solvent. FitSolvent() throws ModelScaleGPUTooFewReflections where
|
|
// the grid's fits would chain (too few reflections for the isotropic start), which the host then does.
|
|
void FitSolvent(double b_hi, double &k_sol, double &b_sol);
|
|
void FitScale(double k_sol, double b_sol, double &k_overall, double b_star[6]);
|
|
// The scale's points: fcmol (Fcalc as complex<float>) and fmask, downloaded for the host's fit.
|
|
void DownloadPoints(std::vector<std::array<float, 2>> &fcmol, std::vector<std::array<float, 2>> &fmask);
|
|
// The residuals at the scale given, NumObservations() of them, into `residuals` (host).
|
|
void Residuals(double k_overall, const double b_star[6], double k_sol, double b_sol, double *residuals);
|
|
|
|
// The Jacobian at the last evaluation: `rotation[j]` and `translation[j]` place the body one step
|
|
// along rotation axis j. Writes J (fixed scale) and J_k (the scale parameters' columns) on the
|
|
// device and returns J_k^T J_k (p x p) and J_k^T J (p x 6), p = 1 + constraints, row-major.
|
|
void Jacobian(const double rotation[3][9], const double translation[3][3], double step, double k_overall,
|
|
const double b_star[6], double k_sol, double b_sol, std::vector<double> &jtj,
|
|
std::vector<double> &jtq);
|
|
// J - J_k x, x p x 6 row-major, into `jacobian` (host, NumObservations() x 6).
|
|
void ProjectJacobian(const std::vector<double> &x, double *jacobian);
|
|
|
|
private:
|
|
std::unique_ptr<RigidBodyGPUEngineImpl> impl_;
|
|
};
|