summaryrefslogtreecommitdiffstats
path: root/benchmarks/tail-latency/vptree_buffer.cpp
blob: 8528e94135d1b67b3e33add13081b1a15bf80deb (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
/*
 *
 */

#define ENABLE_TIMER
#define TS_TEST

#include <thread>

#include "file_util.h"
#include "framework/interface/Record.h"
#include "framework/structure/MutableBuffer.h"
#include "shard/VPTree.h"
#include "standard_benchmarks.h"

#include "psu-util/timer.h"
#include <gsl/gsl_rng.h>

typedef Word2VecRec Rec;
typedef de::VPTree<Rec, 100, true> Shard;
typedef de::MutableBuffer<Rec> Buffer;

void usage(char *progname) {
  fprintf(stderr, "%s reccnt datafile\n", progname);
}

int main(int argc, char **argv) {

  if (argc < 3) {
    usage(argv[0]);
    exit(EXIT_FAILURE);
  }

  size_t n = atol(argv[1]);
  std::string d_fname = std::string(argv[2]);

  auto data = read_vector_file<Rec, 300>(d_fname, n);

  std::vector<size_t> buffer_sizes = {4000,  8000,  12000, 16000,
                                      20000, 40000, 80000, 160000, 320000};

  TIMER_INIT();

  size_t rec_idx = 0;

  for (size_t bs : buffer_sizes) {
    for (size_t j = 0; j < 20; j++) {
      auto buffer = Buffer(bs, bs);

      TIMER_START();
      for (size_t i = 0; i < bs; i++) {
        buffer.append(data[rec_idx++]);

        if (rec_idx >= n) rec_idx = 0;
      }
      TIMER_STOP();

      auto buffer_fill = TIMER_RESULT();

      TIMER_START();
      auto shard = Shard(buffer.get_buffer_view());
      TIMER_STOP();

      auto shard_const = TIMER_RESULT();

      fprintf(stdout, "%ld\t%ld\t%ld\n", bs, buffer_fill, shard_const);
    }
  }
}