mirror of
https://github.com/qdrant/qdrant.git
synced 2026-07-31 15:11:35 -05:00
* Benches: use SmallRng instead of ChaCha12-based generators All benchmarks used StdRng or rand::rng() (ThreadRng), both backed by the ChaCha12 block cipher in rand 0.10. Benchmarks do not need crypto-strength randomness, and several draw random values inside the timed closure, so cipher work was included in the measurement itself. Switch every bench target to SmallRng (Xoshiro256++), and key the HNSW graph cache and sparse index cache by RNG algorithm so stale caches built from the old generator are not reused against newly generated vectors. Co-Authored-By: Claude Fable 5 <noreply@anthropic.com> * Benches: replace free-function rand::random with local SmallRng Addresses review: rand::random draws from the thread RNG (ChaCha12), including inside the timed loop of the pq score benchmark. Co-Authored-By: Claude Fable 5 <noreply@anthropic.com> --------- Co-authored-by: Claude Fable 5 <noreply@anthropic.com>
92 lines
2.5 KiB
Rust
92 lines
2.5 KiB
Rust
use std::hint::black_box;
|
|
|
|
use criterion::{Criterion, criterion_group, criterion_main};
|
|
use quantization::p_square::P2Quantile;
|
|
use quantization::quantile::find_quantile_interval_per_coordinate_with_preprocess;
|
|
use rand::RngExt;
|
|
use rand::rngs::SmallRng;
|
|
|
|
fn p_square(c: &mut Criterion) {
|
|
let mut group = c.benchmark_group("p_square");
|
|
|
|
let count = 10_000;
|
|
let mut rng = rand::make_rng::<SmallRng>();
|
|
let data = (0..count)
|
|
.map(|_| rng.random::<f64>())
|
|
.collect::<Vec<f64>>();
|
|
let quantile = 0.99;
|
|
|
|
group.bench_function("p_square_5", |b| {
|
|
b.iter(|| {
|
|
let mut p2 = P2Quantile::<5>::new(quantile).unwrap();
|
|
for &x in &data {
|
|
p2.push(x);
|
|
}
|
|
black_box(p2.estimate());
|
|
});
|
|
});
|
|
|
|
group.bench_function("p_square_7", |b| {
|
|
b.iter(|| {
|
|
let mut p2 = P2Quantile::<7>::new(quantile).unwrap();
|
|
for &x in &data {
|
|
p2.push(x);
|
|
}
|
|
black_box(p2.estimate());
|
|
});
|
|
});
|
|
|
|
group.bench_function("p_square_9", |b| {
|
|
b.iter(|| {
|
|
let mut p2 = P2Quantile::<9>::new(quantile).unwrap();
|
|
for &x in &data {
|
|
p2.push(x);
|
|
}
|
|
black_box(p2.estimate());
|
|
});
|
|
});
|
|
}
|
|
|
|
fn p_square_vectors(c: &mut Criterion) {
|
|
let mut group = c.benchmark_group("p_square_vectors");
|
|
|
|
let count = 10_000;
|
|
let dim = 1536;
|
|
let mut rng = rand::make_rng::<SmallRng>();
|
|
let data = (0..count)
|
|
.map(|_| (0..dim).map(|_| rng.random::<f32>()).collect::<Vec<f32>>())
|
|
.collect::<Vec<Vec<f32>>>();
|
|
let quantile = 0.99;
|
|
|
|
group.bench_function("p_square_vectors", |b| {
|
|
b.iter(|| {
|
|
black_box(
|
|
find_quantile_interval_per_coordinate_with_preprocess(
|
|
data.iter(),
|
|
dim,
|
|
dim,
|
|
count,
|
|
quantile,
|
|
4,
|
|
8_192,
|
|
|raw, scratch| {
|
|
for (s, &v) in scratch.iter_mut().zip(raw.iter()) {
|
|
*s = f64::from(v);
|
|
}
|
|
},
|
|
&std::sync::atomic::AtomicBool::new(false),
|
|
)
|
|
.unwrap(),
|
|
);
|
|
});
|
|
});
|
|
}
|
|
|
|
criterion_group! {
|
|
name = benches;
|
|
config = Criterion::default().sample_size(10);
|
|
targets = p_square, p_square_vectors,
|
|
}
|
|
|
|
criterion_main!(benches);
|