diff options
| author | Douglas Rumbaugh <dbr4@psu.edu> | 2025-06-02 19:54:15 -0400 |
|---|---|---|
| committer | Douglas Rumbaugh <dbr4@psu.edu> | 2025-06-02 19:54:15 -0400 |
| commit | 6088ede2b5a8f580f78d4422162d423a7a11f520 (patch) | |
| tree | 9124cab872af7a02209c3af758d4a4bf95b1aa26 /benchmarks/tail-latency/isam_insert_dist.cpp | |
| parent | 7f0acb5dc66cc93045ab0e40ebd5570388f9102b (diff) | |
| download | dynamic-extension-6088ede2b5a8f580f78d4422162d423a7a11f520.tar.gz | |
updates
Diffstat (limited to 'benchmarks/tail-latency/isam_insert_dist.cpp')
| -rw-r--r-- | benchmarks/tail-latency/isam_insert_dist.cpp | 107 |
1 files changed, 0 insertions, 107 deletions
diff --git a/benchmarks/tail-latency/isam_insert_dist.cpp b/benchmarks/tail-latency/isam_insert_dist.cpp deleted file mode 100644 index 88d37c5..0000000 --- a/benchmarks/tail-latency/isam_insert_dist.cpp +++ /dev/null @@ -1,107 +0,0 @@ -/* - * - */ - -#include "framework/scheduling/FIFOScheduler.h" -#define ENABLE_TIMER -#define TS_TEST - -#include <thread> - -#include "framework/DynamicExtension.h" -#include "shard/ISAMTree.h" -#include "query/rangecount.h" -#include "framework/interface/Record.h" -#include "file_util.h" -#include "standard_benchmarks.h" - -#include <gsl/gsl_rng.h> - -#include "psu-util/timer.h" - - -typedef de::Record<uint64_t, uint64_t> Rec; -typedef de::ISAMTree<Rec>Shard; -typedef de::rc::Query<Shard> Q; -typedef de::DynamicExtension<Shard, Q, de::DeletePolicy::TOMBSTONE, de::FIFOScheduler> Ext; -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 data = read_sosd_file<Rec>(d_fname, n); - auto queries = read_range_queries<QP>(q_fname, .0001); - - std::vector<int> policies = {3}; - std::vector<size_t> buffers = {8000, 16000, 32000}; - std::vector<size_t> sfs = {8}; - - for (size_t l=0; l<policies.size(); l++) { - for (size_t j=0; j<buffers.size(); j++) { - for (size_t k=0; k<sfs.size(); k++) { - auto policy = get_policy<Shard, Q>(sfs[k], buffers[j], policies[l]); - auto extension = new Ext(policy, buffers[j]/4, buffers[j]); - - /* warmup structure w/ 10% of records */ - size_t warmup = .1 * n; - for (size_t i=0; i<warmup; i++) { - while (!extension->insert(data[i])) { - usleep(1); - } - } - - extension->await_next_epoch(); - - TIMER_INIT(); - - for (size_t i=warmup; i<data.size(); i++) { - TIMER_START(); - while (!extension->insert(data[i])) { - usleep(1); - } - TIMER_STOP(); - - //fprintf(stdout, "%ld\t%ld\t%d\t%ld\n", sfs[k], buffers[j], policies[l], TIMER_RESULT()); - } - - extension->await_next_epoch(); - - /* repeat the queries a bunch of times */ - for (size_t l=0; l<10; l++) { - for (size_t i=0; i<queries.size(); i++) { - TIMER_START(); - auto q = queries[i]; - auto res = extension->query(std::move(q)); - res.get(); - TIMER_STOP(); - - fprintf(stdout, "%ld\t%ld\t%d\t%ld\n", sfs[k], buffers[j], policies[l], TIMER_RESULT()); - } - } - - - QP p = {0, 10000}; - auto res =extension->query(std::move(p)); - - fprintf(stderr, "%ld\n", res.get()); - extension->await_next_epoch(); - delete extension; - }}} - - - fflush(stderr); -} - |