const unsigned s_nInsertPercentage = 10;
const char* kTestName = "InsDelFind";
+// Run GC after "kGCFrequency" operations.
+const size_t kGCFrequency = 3000;
+const size_t kLeapfrogGCFrequency = 1500;
+
+const size_t kCrudeMapSize = 10000;
+const size_t kCrudePassCount = 400000;
+const char* kCrudeBenchmarkName = "JunctionMapCrude";
+
const size_t kGrampaMapSize = 20000;
const size_t kGrampaPassCount = 30000;
const char* kGrampaBenchmarkName = "JunctionMapGrampa";
-const size_t kLinearMapSize = 25000;
-const size_t kLinearPassCount = 30000;
+const size_t kLinearMapSize = 20000;
+const size_t kLinearPassCount = 70000;
const char* kLinearBenchmarkName = "JunctionMapLinear";
-const size_t kLeapfrogMapSize = 25000;
-const size_t kLeapfrogPassCount = 30000;
+const size_t kLeapfrogMapSize = 20000;
+const size_t kLeapfrogPassCount = 75000;
const char* kLeapfrogBenchmarkName = "JunctionMapLeapfrog";
-const size_t kCrudeMapSize = 10000;
-const size_t kCrudePassCount = 120000;
-const char* kCrudeBenchmarkName = "JunctionMapCrude";
-
} // namespace
typedef junction::ConcurrentMap_Grampa<size_t, size_t> GrampaMap;
typedef junction::ConcurrentMap_Crude<size_t, size_t> CrudeMap;
template <typename Map>
-void run_crude_map(size_t map_size, size_t pass_count, const char* bench_name) {
+void run_crude_map(size_t map_size, size_t pass_count, const char* bench_name,
+ size_t gc_frequency) {
std::cout << "[ RUN ] " << kTestName << "." << bench_name << "\n";
auto start_time = std::chrono::system_clock::now();
size_t nInsertedNum = 0;
size_t nFindSuccess = 0;
+ size_t nOperations = 0;
// Seems like the crude map won't resize, so better have a large enough
// capacity.
std::unique_ptr<Map> map(new Map(map_size * 32));
// std::cout << "Erased" << i << "\n";
}
}
- junction::DefaultQSBR.update(qsbrContext);
+ if (++nOperations > gc_frequency) {
+ junction::DefaultQSBR.update(qsbrContext);
+ nOperations = 0;
+ }
}
}
+ junction::DefaultQSBR.update(qsbrContext);
+ junction::DefaultQSBR.destroyContext(qsbrContext );
auto finish_time = std::chrono::system_clock::now();
auto dur = finish_time - start_time;
auto milisecs = std::chrono::duration_cast<std::chrono::milliseconds>(dur);
}
template <typename Map>
-void run_test(size_t map_size, size_t pass_count, const char* bench_name) {
+void run_test(size_t map_size, size_t pass_count, const char* bench_name,
+ size_t gc_frequency) {
std::cout << "[ RUN ] " << kTestName << "." << bench_name << "\n";
auto start_time = std::chrono::system_clock::now();
size_t nInsertedNum = 0;
size_t nFindSuccess = 0;
+ size_t nOperations = 0;
std::unique_ptr<Map> map(new Map());
auto qsbrContext = junction::DefaultQSBR.createContext();
for (size_t count = 0; count < pass_count; count++) {
// std::cout << "Erased" << i << "\n";
}
}
- junction::DefaultQSBR.update(qsbrContext);
+ if (++nOperations > gc_frequency) {
+ junction::DefaultQSBR.update(qsbrContext);
+ nOperations = 0;
+ }
}
}
+ junction::DefaultQSBR.update(qsbrContext);
+ junction::DefaultQSBR.destroyContext(qsbrContext );
auto finish_time = std::chrono::system_clock::now();
auto dur = finish_time - start_time;
auto milisecs = std::chrono::duration_cast<std::chrono::milliseconds>(dur);
}
int main() {
- run_crude_map<CrudeMap>(kCrudeMapSize, kCrudePassCount, kCrudeBenchmarkName);
- run_test<LeapfrogMap>(kLeapfrogMapSize, kLeapfrogPassCount, kLeapfrogBenchmarkName);
- run_test<LinearMap>(kLinearMapSize, kLinearPassCount, kLinearBenchmarkName);
- run_test<GrampaMap>(kGrampaMapSize, kGrampaPassCount, kGrampaBenchmarkName);
+ run_crude_map<CrudeMap>(kCrudeMapSize, kCrudePassCount, kCrudeBenchmarkName,
+ kGCFrequency);
+ run_test<LeapfrogMap>(kLeapfrogMapSize, kLeapfrogPassCount,
+ kLeapfrogBenchmarkName, kLeapfrogGCFrequency );
+ run_test<LinearMap>(kLinearMapSize, kLinearPassCount, kLinearBenchmarkName,
+ kGCFrequency);
+ run_test<GrampaMap>(kGrampaMapSize, kGrampaPassCount, kGrampaBenchmarkName,
+ kGCFrequency);
return 0;
}