From 5a3d36fecabc8f220b19dcaea28a78f99b5244af Mon Sep 17 00:00:00 2001
From: Douglas Rumbaugh <dbr4@psu.edu>
Date: Thu, 17 Apr 2025 12:28:51 -0400
Subject: switched k to a double

---
 benchmarks/include/standard_benchmarks.h     |  2 +-
 benchmarks/tail-latency/query_parm_sweep.cpp | 11 +++++------
 2 files changed, 6 insertions(+), 7 deletions(-)

(limited to 'benchmarks')

diff --git a/benchmarks/include/standard_benchmarks.h b/benchmarks/include/standard_benchmarks.h
index 96541fe..2e990a7 100644
--- a/benchmarks/include/standard_benchmarks.h
+++ b/benchmarks/include/standard_benchmarks.h
@@ -32,7 +32,7 @@ static size_t g_deleted_records = 0;
 static size_t total = 0;
 
 template<de::ShardInterface S, de::QueryInterface<S> Q>
-std::unique_ptr<de::ReconstructionPolicy<S, Q>> get_policy(size_t scale_factor, size_t buffer_size, int policy=0, size_t reccnt=0, size_t modifier=0) {
+std::unique_ptr<de::ReconstructionPolicy<S, Q>> get_policy(size_t scale_factor, size_t buffer_size, int policy=0, size_t reccnt=0, double modifier=0) {
 
     de::ReconstructionPolicy<S, Q> *recon = nullptr;
     
diff --git a/benchmarks/tail-latency/query_parm_sweep.cpp b/benchmarks/tail-latency/query_parm_sweep.cpp
index a93be3e..4f11ce0 100644
--- a/benchmarks/tail-latency/query_parm_sweep.cpp
+++ b/benchmarks/tail-latency/query_parm_sweep.cpp
@@ -29,11 +29,11 @@ typedef de::Record<uint64_t, uint64_t> Rec;
 typedef de::ISAMTree<Rec> Shard;
 typedef de::pl::Query<Shard> Q;
 typedef de::DynamicExtension<Shard, Q, de::DeletePolicy::TOMBSTONE,
-                             de::FIFOScheduler>
+                             de::SerialScheduler>
     Ext;
 typedef Q::Parameters QP;
 typedef de::DEConfiguration<Shard, Q, de::DeletePolicy::TOMBSTONE,
-                            de::FIFOScheduler>
+                            de::SerialScheduler>
     Conf;
 
 std::atomic<size_t> idx;
@@ -102,13 +102,12 @@ int main(int argc, char **argv) {
   //auto queries = read_range_queries<QP>(q_fname, .0001);
   auto queries =read_sosd_point_lookups<QP>(q_fname, 100);
 
-  std::vector<size_t> sfs = {8}; //, 4, 8, 16, 32, 64, 128, 256, 512, 1024};
   size_t buffer_size = 8000;
   std::vector<size_t> policies = {0, 1, 2};
 
   std::vector<size_t> thread_counts = {8};
-  std::vector<size_t> modifiers = {0};
-  std::vector<size_t> scale_factors = {2, 4, 8, 16, 32, 64, 128, 256};
+  std::vector<double> modifiers = {0, .3, .5, .8};
+  std::vector<size_t> scale_factors = {2, 4, 8};
 
   size_t insert_threads = 1;
   size_t query_threads = 1;
@@ -185,7 +184,7 @@ int main(int argc, char **argv) {
           size_t query_lat = (double)total_query_time.load() /
                              (double)total_query_count.load();
 
-          fprintf(stdout, "%ld\t%ld\t%ld\t%ld\t%ld\t%ld\t%ld\t%ld\n", internal_thread_cnt, pol, sf,
+          fprintf(stdout, "%ld\t%ld\t%ld\t%lf\t%ld\t%ld\t%ld\t%ld\n", internal_thread_cnt, pol, sf,
                   mod, extension->get_height(), extension->get_shard_count(),
                   insert_tput, query_lat);
           fflush(stdout);
-- 
cgit v1.2.3