Add reservation benchmark

default.nix

@@ -63,6 +63,8 @@ let
         # For the shell, libpython needs to be in the search path.
         pythonEnv
       ];
+      # Fixes: libstdc++.so.6: cannot open shared object file: No such file or directory
+      LD_LIBRARY_PATH = pkgs.lib.makeLibraryPath [ pkgs.stdenv.cc.cc.lib ];
     };
   };
 in

justfile

@@ -70,6 +70,18 @@ nix-test-integration *TEST_ARGS: nix-build
 
   timeout {{pytest_timeout_seconds}} pytest --color=yes {{TEST_ARGS}}
 
+# Benchmark query cost and render a graph.
+[group('bench')]
+bench-chunks-select:
+  #!/usr/bin/env bash
+  set -euo pipefail
+  cargo bench --bench chunks_select
+
+  cd libs/opsqueue_python
+  source "./.setup_local_venv.sh"
+  cd -
+  python opsqueue/benches/plot_chunks_select.py
+
 # Run all linters, fast and slow
 [group('lint')]
 lint: lint-light lint-heavy

opsqueue/Cargo.toml

@@ -87,9 +87,10 @@ criterion = {version = "0.8", features = ["async_tokio"]}
 insta = { version = "1.47.2" }
 assert_matches = { version = "1.5.0" }
 
-# [[bench]]
-# name = "chunks_select"
-# harness = false
+[[bench]]
+name = "chunks_select"
+harness = false
+required-features = ["server-logic"]
 
 # [[bench]]
 # name = "submissions_insert"

opsqueue/benches/chunks_select.rs

@@ -0,0 +1,320 @@
+/// For each shape:
+///   For each amount of chunks:
+///     Seed (all chunks) or extend (additional chunks) the database
+///     FOR EACH strategy:
+///         Create new dispatcher.
+///         Run benchmark
+///         Calculate stats
+///         Write result
+use opsqueue::common::StrategicMetadataMap;
+use opsqueue::common::chunk::{ChunkId, ChunkSize};
+use opsqueue::common::submission::db::insert_submission_from_chunks;
+use opsqueue::consumer::dispatcher::Dispatcher;
+use opsqueue::consumer::strategy::Strategy;
+use opsqueue::db::{self};
+use std::io::Write;
+use std::num::NonZero;
+use std::path::PathBuf;
+use std::time::{Duration, Instant};
+
+// Human-readable name for an OpsQueue strategy.
+type StrategyName = &'static str;
+
+// Shape of the data we are inserting.
+#[derive(Debug, Eq, Ord, PartialEq, PartialOrd)]
+enum Shape {
+    FewSubmissionsManyChunks,
+    ManySubmissionsFewChunks,
+    Realistic,
+}
+
+const CHUNKS_PER_METADATA_VALUE: u64 = CHUNKS_PER_SUBMISSION * SUBMISSIONS_PER_METADATA_VALUE;
+const CHUNKS_PER_SUBMISSION: u64 = 1024;
+// Increase in the total amount of chunks for the `Shape::Realistic` strategy.
+const CHUNKS_STEP: usize = 500_000;
+const MAX_CHUNKS: u64 = 4_500_001;
+const METADATA_VALUES: u64 = 100_000;
+const SUBMISSIONS: u64 = 300_000;
+// The amount of samples to collect per iteration of the
+// shape/amount_of_chunks/strategy main loop. Note that each "sample" itself
+// requires a number of reservations to be performed (see `bench_strategy`).
+const SAMPLES_PER_STAT: usize = 20;
+const SUBMISSIONS_PER_METADATA_VALUE: u64 = SUBMISSIONS / METADATA_VALUES;
+// The amount of reservations to collect a single sample.
+// Note that the time between these is NOT INDEPENDENT:
+// the earlier reservations affect the later ones.
+const RESERVATIONS_IN_SAMPLE: usize = 30;
+// The amount of reservations to perform before we begin collecting a sample.
+const RESERVATIONS_IN_WARMUP: usize = 5;
+
+#[derive(Debug)]
+pub struct BenchStats {
+    pub median: f64, // sorted_samples[len(samples) / 2]
+    pub p10: f64,    // sorted_samples[len(samples) * 0.1]
+    pub p90: f64,    // sorted_samples[len(samples) * 0.9]
+}
+
+#[allow(clippy::missing_panics_doc)]
+impl BenchStats {
+    #[must_use]
+    /// Benchmark stats from reservation durations. For code simplicity, and
+    /// given it's only a benchmark, not library code, we intentionally avoid
+    /// the unnecessary error handling.
+    pub fn new(runs: Vec<Vec<f64>>) -> Self {
+        // Calculate the median for each individual run.
+        let mut run_medians: Vec<f64> = runs
+            .into_iter()
+            .map(|mut run_samples| {
+                run_samples.sort_by(|a, b| a.partial_cmp(b).unwrap());
+                run_samples[run_samples.len() / 2]
+            })
+            .collect();
+        // Sort the N medians to find p10 etc. of the medians.
+        run_medians.sort_by(|a, b| a.partial_cmp(b).unwrap());
+        let len = run_medians.len();
+        BenchStats {
+            p10: run_medians[len * 10 / 100],
+            median: run_medians[len / 2],
+            p90: run_medians[len * 90 / 100],
+        }
+    }
+}
+
+/// Maximum amount of chunks for the bench run.
+///
+/// This is based on the shape of the data, as that can dramatically affect
+/// run-time, and for some shapes we can push the total chunks higher without
+/// waiting too long.
+fn max_chunks_by_shape(shape: &Shape) -> Vec<u64> {
+    let mut vector: Vec<u64> = vec![
+        100, 500, 1_000, 2_000, 4_000, 6_000, 8_000, 10_000, 15_000, 20_000, 30_000, 50_000,
+        75_000, 100_000, 200_000, 500_000, 1_000_000,
+    ];
+    if shape == &Shape::Realistic {
+        let max = MAX_CHUNKS.min(METADATA_VALUES * CHUNKS_PER_METADATA_VALUE);
+        vector.extend((*vector.iter().max().unwrap()..max).step_by(CHUNKS_STEP));
+    }
+    vector
+}
+
+/// All the strategies we are benchmarking.
+fn strategies() -> [(StrategyName, Strategy); 2] {
+    [
+        ("Random", Strategy::Random),
+        (
+            "PreferDistinct(metadata_value, Oldest)",
+            Strategy::PreferDistinct {
+                meta_key: "metadata_value".to_string(),
+                underlying: Box::new(Strategy::Oldest),
+            },
+        ),
+    ]
+}
+
+/// (total metadata values, `submissions_per_metadata_value`, chunks per
+/// submission) for a shape and total chunks. Note we don't always quite reach
+/// `total_chunks` due to integer division, we return the closest layout of
+/// chunks respecting the given shape <= `total_chunks`.
+fn layout(shape: &Shape, total_chunks: u64) -> (u64, u64, u64) {
+    match shape {
+        Shape::ManySubmissionsFewChunks => (total_chunks, 1, 1),
+        Shape::FewSubmissionsManyChunks => {
+            let submissions = 10.min(total_chunks.max(1));
+            (submissions, 1, total_chunks.div_ceil(submissions))
+        }
+        Shape::Realistic => {
+            let metadata_values = total_chunks.div_ceil(CHUNKS_PER_METADATA_VALUE);
+            (
+                metadata_values,
+                SUBMISSIONS_PER_METADATA_VALUE,
+                CHUNKS_PER_SUBMISSION,
+            )
+        }
+    }
+}
+
+/// Either seeds a fresh DB with all chunks or extend the existing DB with additional chunks.
+async fn seed_or_extend(
+    shape: &Shape,
+    total_chunks: u64,
+    current_db_pools: Option<db::DBPools>, // What was returned by `layout` on the previous call to `seed_or_extend`.
+    current_layout: Option<(u64, u64, u64)>,
+    db_path: &PathBuf,
+) -> (db::DBPools, Option<(u64, u64, u64)>) {
+    // Determine the layout of the data we want to insert.
+    let next_layout
+    @ (total_metadata_values, submissions_per_metadata_value, chunks_per_submission) =
+        layout(shape, total_chunks);
+    // Check if we are seeding the database from scratch, or extending.
+    let mut we_are_extending = false;
+    let mut current_metadata_values = 0;
+    if let Some((
+        current_metadata_values_,
+        current_submissions_per_metadata_value,
+        current_chunks_per_submission,
+    )) = current_layout
+    {
+        // We can only extend if the shape of the data is compatible with the current inserted data.
+        if current_submissions_per_metadata_value == submissions_per_metadata_value
+            && current_chunks_per_submission == chunks_per_submission
+        {
+            we_are_extending = true;
+            current_metadata_values = current_metadata_values_;
+        }
+    }
+    // Time to acquire the DB connection. Either an existing connection, or set up from scratch.
+    println!(); // Visually separate each run.
+    let db_pools = if we_are_extending {
+        println!("Extending database with shape={shape:?} to total_chunks={total_chunks}:");
+        current_db_pools.unwrap()
+    } else {
+        println!("Seeding database with shape={shape:?} and total_chunks={total_chunks}:");
+        drop(current_db_pools);
+        std::fs::remove_file(db_path).ok();
+        std::fs::remove_file(db_path.with_extension("sqlite-wal")).ok();
+        std::fs::remove_file(db_path.with_extension("sqlite-shm")).ok();
+        db::open_and_setup(db_path.to_str().unwrap(), NonZero::new(16).unwrap()).await
+    };
+    println!(
+        "    Metadata values: {total_metadata_values:<30}\n    Submissions per metadata value: {submissions_per_metadata_value}\n    Chunks per submission: {chunks_per_submission}"
+    );
+    let mut conn = db_pools.writer_conn().await.unwrap();
+    for metadata_value in current_metadata_values..total_metadata_values {
+        for _ in 0..submissions_per_metadata_value {
+            let mut metadata = StrategicMetadataMap::default();
+            metadata.insert(
+                "metadata_value".to_string(),
+                i64::try_from(metadata_value).unwrap(),
+            );
+            let chunks = vec![Some(b"x".to_vec()); usize::try_from(chunks_per_submission).unwrap()];
+            insert_submission_from_chunks(
+                None,
+                chunks,
+                None,
+                metadata,
+                ChunkSize::default(),
+                &mut conn,
+            )
+            .await
+            .unwrap();
+        }
+    }
+    (db_pools, Some(next_layout))
+}
+
+/// Runs the selection query and fetches just the first chunk.
+async fn fetch_and_reserve_chunk(
+    db_pools: &db::DBPools,
+    strategy: Strategy,
+    dispatcher: &Dispatcher,
+) -> ChunkId {
+    use tokio::sync::mpsc::unbounded_channel;
+    let (notifier, _) = unbounded_channel();
+    let reserved = dispatcher
+        .fetch_and_reserve_chunks(db_pools.reader_pool(), strategy, 1, &notifier)
+        .await
+        .unwrap();
+    if let [(chunk, _)] = reserved.as_slice() {
+        ChunkId::from((chunk.submission_id, chunk.chunk_index))
+    } else {
+        panic!(
+            "Yowza! Expected exactly 1 chunk, but got {}",
+            reserved.len()
+        );
+    }
+}
+
+/// Executes reservations for a given DB state and returns `BenchStats`.
+async fn bench_strategy(
+    db_pools: &db::DBPools,
+    strategy: &Strategy,
+    dispatcher: &Dispatcher,
+) -> BenchStats {
+    let mut all_reservation_durations: Vec<Vec<f64>> = Vec::with_capacity(SAMPLES_PER_STAT);
+    // For each of the samples we want to collect.
+    for _ in 0..SAMPLES_PER_STAT {
+        let mut sample_reservation_durations = Vec::with_capacity(RESERVATIONS_IN_SAMPLE);
+        let mut chunks_reserved = Vec::new();
+        // For each sample, reserve N chunks (some are warmups).
+        for i in 0..(RESERVATIONS_IN_WARMUP + RESERVATIONS_IN_SAMPLE) {
+            let start = Instant::now();
+            let chunk_id = fetch_and_reserve_chunk(db_pools, strategy.clone(), dispatcher).await;
+            if i >= RESERVATIONS_IN_WARMUP {
+                sample_reservation_durations.push(start.elapsed().as_secs_f64() * 1e6);
+            }
+            chunks_reserved.push(chunk_id);
+        }
+        all_reservation_durations.push(sample_reservation_durations);
+        // Reset the queue state for the next run
+        let mut conn = db_pools.writer_conn().await.unwrap();
+        for chunk_id in chunks_reserved {
+            dispatcher
+                .finish_reservation(&mut conn, chunk_id, false)
+                .await;
+        }
+    }
+    BenchStats::new(all_reservation_durations)
+}
+
+fn main() {
+    let runtime = tokio::runtime::Runtime::new().unwrap();
+    let csv_path = PathBuf::from("benches/chunks_select_bench.csv");
+    if let Some(parent) = csv_path.parent() {
+        let _ = std::fs::create_dir_all(parent);
+    }
+    let mut csv = std::fs::File::create(&csv_path)
+        .unwrap_or_else(|e| panic!("Failed to create CSV at {}: {}", csv_path.display(), e));
+    writeln!(csv, "shape,strategy,backlog_size,p10_us,median_us,p90_us").unwrap();
+    // Pretty header.
+    println!(
+        "{:<30} {:<35} {:<12} {:<10} {:<15}",
+        "SHAPE", "STRATEGY", "SIZE", "MEDIAN", "P10 / P90"
+    );
+    println!("{}", "-".repeat(105));
+    let db_path = std::env::temp_dir().join("opsqueue_bench.sqlite");
+    for shape in &[
+        Shape::FewSubmissionsManyChunks,
+        Shape::ManySubmissionsFewChunks,
+        Shape::Realistic,
+    ] {
+        // Track the current database state.
+        let mut db_pools: Option<db::DBPools> = None;
+        let mut current_layout: Option<(u64, u64, u64)> = None;
+        for size in max_chunks_by_shape(shape) {
+            // Either seed a new database or extend an existing one.
+            let returned_pools;
+            (returned_pools, current_layout) = runtime.block_on(seed_or_extend(
+                shape,
+                size,
+                db_pools,
+                current_layout,
+                &db_path,
+            ));
+            db_pools = Some(returned_pools);
+            // Then for each strategy: hit the bench!
+            for (strategy_label, strategy) in strategies() {
+                let dispatcher = Dispatcher::new(Duration::from_mins(1_000_000));
+                let stats = runtime.block_on(bench_strategy(
+                    db_pools.as_ref().unwrap(),
+                    &strategy,
+                    &dispatcher,
+                ));
+                let bounds = format!("{:.1} / {:.1}", stats.p10, stats.p90);
+                println!(
+                    "{:<30} {:<38} {:<12} {:<10.1} {:<15}",
+                    format!("{shape:?}"),
+                    strategy_label,
+                    size,
+                    stats.median,
+                    bounds
+                );
+                writeln!(
+                    csv,
+                    "{shape:?},\"{strategy_label}\",{size},{:.1},{:.1},{:.1}",
+                    stats.p10, stats.median, stats.p90
+                )
+                .unwrap();
+            }
+        }
+    }
+}