|
| 1 | +use codspeed_criterion_compat::{ |
| 2 | + black_box, criterion_group, criterion_main, BenchmarkId, Criterion, Throughput, |
| 3 | +}; |
| 4 | +use kiddo::dist::SquaredEuclidean; |
| 5 | +use kiddo::kd_tree::leaf_strategies::VecOfArenas; |
| 6 | +use kiddo::kd_tree::KdTree; |
| 7 | +use kiddo::stem_strategies::donnelly_2_pf::DonnellyPf; |
| 8 | +use kiddo::stem_strategies::eytzinger_pf_far::EytzingerPfFar; |
| 9 | +#[cfg(all( |
| 10 | + feature = "simd", |
| 11 | + target_arch = "x86_64", |
| 12 | + any(target_feature = "avx2", target_feature = "avx512f") |
| 13 | +))] |
| 14 | +use kiddo::stem_strategies::{Block3, DonnellyMarkerSimd}; |
| 15 | +use kiddo::stem_strategies::{Donnelly, Eytzinger}; |
| 16 | +use rand::Rng; |
| 17 | +use rand::SeedableRng; |
| 18 | +use rand_chacha::ChaCha8Rng; |
| 19 | + |
| 20 | +const K: usize = 3; |
| 21 | +const B: usize = 32; |
| 22 | +const DEFAULT_QUERY_COUNT: usize = 10_000; |
| 23 | +const DEFAULT_POINT_COUNT: usize = 1usize << 22; |
| 24 | +const POINT_SEED: u64 = 0x5eed_0000_0000_0201; |
| 25 | +const QUERY_SEED: u64 = 0x5eed_0000_0000_0202; |
| 26 | + |
| 27 | +type ArenaLeaves = VecOfArenas<f64, u32, K, B>; |
| 28 | +type EytzingerTree = KdTree<f64, u32, Eytzinger<K>, ArenaLeaves, K, B>; |
| 29 | +type EytzingerPfFarTree = KdTree<f64, u32, EytzingerPfFar<K, 8>, ArenaLeaves, K, B>; |
| 30 | +type DonnellyPfTree = KdTree<f64, u32, DonnellyPf<3, 64, 8, K>, ArenaLeaves, K, B>; |
| 31 | +#[cfg(all( |
| 32 | + feature = "simd", |
| 33 | + target_arch = "x86_64", |
| 34 | + any(target_feature = "avx2", target_feature = "avx512f") |
| 35 | +))] |
| 36 | +type DonnellySimdTree = KdTree<f64, u32, DonnellyMarkerSimd<Block3, 64, 8, K>, ArenaLeaves, K, B>; |
| 37 | + |
| 38 | +fn read_usize_env(var: &str, default: usize) -> usize { |
| 39 | + std::env::var(var) |
| 40 | + .ok() |
| 41 | + .and_then(|value| value.parse::<usize>().ok()) |
| 42 | + .unwrap_or(default) |
| 43 | +} |
| 44 | + |
| 45 | +fn build_points(point_count: usize) -> Vec<[f64; K]> { |
| 46 | + let mut rng = ChaCha8Rng::seed_from_u64(POINT_SEED); |
| 47 | + (0..point_count).map(|_| rng.random::<[f64; K]>()).collect() |
| 48 | +} |
| 49 | + |
| 50 | +fn build_queries(query_count: usize) -> Vec<[f64; K]> { |
| 51 | + let mut rng = ChaCha8Rng::seed_from_u64(QUERY_SEED); |
| 52 | + (0..query_count).map(|_| rng.random::<[f64; K]>()).collect() |
| 53 | +} |
| 54 | + |
| 55 | +fn run_nearest_queries_eytzinger(tree: &EytzingerTree, queries: &[[f64; K]]) -> (f64, u64) { |
| 56 | + let mut checksum_dist = 0.0f64; |
| 57 | + let mut checksum_item = 0u64; |
| 58 | + |
| 59 | + for query in queries { |
| 60 | + let (dist, item) = tree.nearest_one::<SquaredEuclidean<f64>>(black_box(query)); |
| 61 | + checksum_dist += dist; |
| 62 | + checksum_item = checksum_item.wrapping_add(item as u64); |
| 63 | + } |
| 64 | + |
| 65 | + (checksum_dist, checksum_item) |
| 66 | +} |
| 67 | + |
| 68 | +fn run_nearest_queries_eytzinger_pf_far( |
| 69 | + tree: &EytzingerPfFarTree, |
| 70 | + queries: &[[f64; K]], |
| 71 | +) -> (f64, u64) { |
| 72 | + let mut checksum_dist = 0.0f64; |
| 73 | + let mut checksum_item = 0u64; |
| 74 | + |
| 75 | + for query in queries { |
| 76 | + let (dist, item) = tree.nearest_one::<SquaredEuclidean<f64>>(black_box(query)); |
| 77 | + checksum_dist += dist; |
| 78 | + checksum_item = checksum_item.wrapping_add(item as u64); |
| 79 | + } |
| 80 | + |
| 81 | + (checksum_dist, checksum_item) |
| 82 | +} |
| 83 | + |
| 84 | +fn run_nearest_queries_donnelly(tree: &DonnellyPfTree, queries: &[[f64; K]]) -> (f64, u64) { |
| 85 | + let mut checksum_dist = 0.0f64; |
| 86 | + let mut checksum_item = 0u64; |
| 87 | + |
| 88 | + for query in queries { |
| 89 | + let (dist, item) = tree.nearest_one::<SquaredEuclidean<f64>>(black_box(query)); |
| 90 | + checksum_dist += dist; |
| 91 | + checksum_item = checksum_item.wrapping_add(item as u64); |
| 92 | + } |
| 93 | + |
| 94 | + (checksum_dist, checksum_item) |
| 95 | +} |
| 96 | + |
| 97 | +#[cfg(all( |
| 98 | + feature = "simd", |
| 99 | + target_arch = "x86_64", |
| 100 | + any(target_feature = "avx2", target_feature = "avx512f") |
| 101 | +))] |
| 102 | +fn run_nearest_queries_donnelly_simd(tree: &DonnellySimdTree, queries: &[[f64; K]]) -> (f64, u64) { |
| 103 | + let mut checksum_dist = 0.0f64; |
| 104 | + let mut checksum_item = 0u64; |
| 105 | + |
| 106 | + for query in queries { |
| 107 | + let (dist, item) = tree.nearest_one::<SquaredEuclidean<f64>>(black_box(query)); |
| 108 | + checksum_dist += dist; |
| 109 | + checksum_item = checksum_item.wrapping_add(item as u64); |
| 110 | + } |
| 111 | + |
| 112 | + (checksum_dist, checksum_item) |
| 113 | +} |
| 114 | + |
| 115 | +fn v6_stem_strategies_focus(c: &mut Criterion) { |
| 116 | + let query_count = read_usize_env("KIDDO_BENCH_QUERIES", DEFAULT_QUERY_COUNT); |
| 117 | + let point_count = read_usize_env("KIDDO_BENCH_POINTS", DEFAULT_POINT_COUNT); |
| 118 | + let points = build_points(point_count); |
| 119 | + let queries = build_queries(query_count); |
| 120 | + |
| 121 | + let eytzinger_tree: EytzingerTree = KdTree::new_from_slice(&points); |
| 122 | + let eytzinger_pf_far_tree: EytzingerPfFarTree = KdTree::new_from_slice(&points); |
| 123 | + let donnelly_tree: DonnellyPfTree = KdTree::new_from_slice(&points); |
| 124 | + #[cfg(all( |
| 125 | + feature = "simd", |
| 126 | + target_arch = "x86_64", |
| 127 | + any(target_feature = "avx2", target_feature = "avx512f") |
| 128 | + ))] |
| 129 | + let donnelly_simd_tree: DonnellySimdTree = KdTree::new_from_slice(&points); |
| 130 | + |
| 131 | + let mut group = c.benchmark_group("v6 nearest_one stem strategies focus"); |
| 132 | + group.throughput(Throughput::Elements(query_count as u64)); |
| 133 | + |
| 134 | + group.bench_function(BenchmarkId::new("Eytzinger", point_count), |b| { |
| 135 | + b.iter(|| black_box(run_nearest_queries_eytzinger(&eytzinger_tree, &queries))); |
| 136 | + }); |
| 137 | + |
| 138 | + group.bench_function(BenchmarkId::new("Eytzinger PF Far", point_count), |b| { |
| 139 | + b.iter(|| { |
| 140 | + black_box(run_nearest_queries_eytzinger_pf_far( |
| 141 | + &eytzinger_pf_far_tree, |
| 142 | + &queries, |
| 143 | + )) |
| 144 | + }); |
| 145 | + }); |
| 146 | + |
| 147 | + group.bench_function(BenchmarkId::new("Donnelly PF", point_count), |b| { |
| 148 | + b.iter(|| black_box(run_nearest_queries_donnelly(&donnelly_tree, &queries))); |
| 149 | + }); |
| 150 | + |
| 151 | + #[cfg(all( |
| 152 | + feature = "simd", |
| 153 | + target_arch = "x86_64", |
| 154 | + any(target_feature = "avx2", target_feature = "avx512f") |
| 155 | + ))] |
| 156 | + group.bench_function(BenchmarkId::new("Donnelly Block SIMD", point_count), |b| { |
| 157 | + b.iter(|| { |
| 158 | + black_box(run_nearest_queries_donnelly_simd( |
| 159 | + &donnelly_simd_tree, |
| 160 | + &queries, |
| 161 | + )) |
| 162 | + }); |
| 163 | + }); |
| 164 | + |
| 165 | + group.finish(); |
| 166 | +} |
| 167 | + |
| 168 | +criterion_group!(benches, v6_stem_strategies_focus); |
| 169 | +criterion_main!(benches); |
0 commit comments