From fee53096fb95c01649d8f06f4528bd7f65529450 Mon Sep 17 00:00:00 2001
From: Douglas Rumbaugh <dbr4@psu.edu>
Date: Tue, 21 Jan 2025 13:11:12 -0500
Subject: BTree insertion latency benchmarks

---
 benchmarks/tail-latency/btree_insert_dist.cpp | 77 +++++++++++++++++++++++++++
 1 file changed, 77 insertions(+)
 create mode 100644 benchmarks/tail-latency/btree_insert_dist.cpp

(limited to 'benchmarks/tail-latency/btree_insert_dist.cpp')

diff --git a/benchmarks/tail-latency/btree_insert_dist.cpp b/benchmarks/tail-latency/btree_insert_dist.cpp
new file mode 100644
index 0000000..af60819
--- /dev/null
+++ b/benchmarks/tail-latency/btree_insert_dist.cpp
@@ -0,0 +1,77 @@
+/*
+ *
+ */
+
+#define ENABLE_TIMER
+
+#include "shard/ISAMTree.h"
+#include "query/rangequery.h"
+#include "framework/interface/Record.h"
+#include "file_util.h"
+#include "benchmark_types.h"
+
+#include <gsl/gsl_rng.h>
+
+#include "psu-util/timer.h"
+#include "standard_benchmarks.h"
+#include "psu-ds/BTree.h"
+
+typedef btree_record<int64_t, int64_t> Rec;
+
+typedef de::ISAMTree<Rec> Shard;
+typedef de::irs::Query<Shard> Q;
+typedef Q::Parameters QP;
+
+void usage(char *progname) {
+    fprintf(stderr, "%s reccnt datafile queryfile\n", progname);
+}
+
+int main(int argc, char **argv) {
+
+    if (argc < 4) {
+        usage(argv[0]);
+        exit(EXIT_FAILURE);
+    }
+
+    size_t n = atol(argv[1]);
+    std::string d_fname = std::string(argv[2]);
+    std::string q_fname = std::string(argv[3]);
+
+    auto btree = BenchBTree();
+    
+    auto data = read_sosd_file<Rec>(d_fname, n);
+
+    /* read in the range queries and add sample size and rng for sampling */
+    auto queries = read_range_queries<QP>(q_fname, .0001);
+
+    /* warmup structure w/ 10% of records */
+    size_t warmup = .1 * n;
+    for (size_t i=0; i<warmup; i++) {
+        btree.insert(data[i]);
+    }
+
+    TIMER_INIT();
+    /* insertion benchmark */
+    for (size_t i=warmup; i<data.size(); i++) {
+        TIMER_START();
+        btree.insert(data[i]);
+        TIMER_STOP();
+
+        fprintf(stdout, "I\t%ld\n", TIMER_RESULT());
+    }
+
+    /* run queries */
+    size_t total = 0;
+    for (size_t j=0; j<10; j++) {
+        for (size_t i=0; i<queries.size(); i++) {
+            TIMER_START();
+            total += btree.range_count(queries[i].lower_bound, queries[i].upper_bound);
+            TIMER_STOP();
+
+            fprintf(stdout, "Q\t%ld\n", TIMER_RESULT());
+        }
+    }
+
+    fprintf(stderr, "%ld\n", total);
+}
+
-- 
cgit v1.2.3