susumu.yata
null+****@clear*****
Fri Dec 5 11:13:03 JST 2014
susumu.yata 2014-12-05 11:13:03 +0900 (Fri, 05 Dec 2014) New Revision: 70a4d238689060117ef4134b5780a89819858524 https://github.com/groonga/grnxx/commit/70a4d238689060117ef4134b5780a89819858524 Message: Add a benchmark for filtering with LESS. (#122) Added files: benchmark/benchmark_filter_less.cpp Modified files: .gitignore benchmark/Makefile.am Modified: .gitignore (+1 -0) =================================================================== --- .gitignore 2014-12-04 19:12:08 +0900 (e52759a) +++ .gitignore 2014-12-05 11:13:03 +0900 (76919ef) @@ -16,6 +16,7 @@ Makefile.in aclocal.m4 autom4te.cache/ benchmark/*.trs +benchmark/benchmark_filter_less benchmark/benchmark_filter_and benchmark/benchmark_filter_or benchmark/benchmark_sorter Modified: benchmark/Makefile.am (+4 -0) =================================================================== --- benchmark/Makefile.am 2014-12-04 19:12:08 +0900 (a1a0397) +++ benchmark/Makefile.am 2014-12-05 11:13:03 +0900 (c1ae289) @@ -1,8 +1,12 @@ noinst_PROGRAMS = \ + benchmark_filter_less \ benchmark_filter_and \ benchmark_filter_or \ benchmark_sorter +benchmark_filter_less_SOURCES = benchmark_filter_less.cpp +benchmark_filter_less_LDADD = $(top_srcdir)/lib/grnxx/libgrnxx.la + benchmark_filter_and_SOURCES = benchmark_filter_and.cpp benchmark_filter_and_LDADD = $(top_srcdir)/lib/grnxx/libgrnxx.la Added: benchmark/benchmark_filter_less.cpp (+199 -0) 100644 =================================================================== --- /dev/null +++ benchmark/benchmark_filter_less.cpp 2014-12-05 11:13:03 +0900 (1c3009c) @@ -0,0 +1,199 @@ +/* + Copyright (C) 2012-2014 Brazil, Inc. + + This library is free software; you can redistribute it and/or + modify it under the terms of the GNU Lesser General Public + License as published by the Free Software Foundation; either + version 2.1 of the License, or (at your option) any later version. + + This library is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + Lesser General Public License for more details. + + You should have received a copy of the GNU Lesser General Public + License along with this library; if not, write to the Free Software + Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA +*/ +#include <cassert> +#include <ctime> +#include <iostream> +#include <random> + +#include "grnxx/db.hpp" +#include "grnxx/pipeline.hpp" + +namespace { + +constexpr size_t SIZE = 10000000; +constexpr size_t LOOP = 5; + +class Timer { + public: + Timer() : base_(now()) {} + + double elapsed() const { + return now() - base_; + } + + static double now() { + struct timespec ts; + ::clock_gettime(CLOCK_MONOTONIC, &ts); + return ts.tv_sec + (ts.tv_nsec / 1000000000.0); + } + + private: + double base_; +}; + +grnxx::Array<grnxx::Int> a; + +void generate_data() { + std::mt19937_64 rng; + a.resize(SIZE); + for (size_t i = 0; i < SIZE; ++i) { + a[i] = grnxx::Int(rng() % 256); + } +} + +void benchmark_grnxx(const grnxx::Table *table, + grnxx::Int upper_limit) { + std::cout << "LESS: ratio = " << (100 * upper_limit.raw() / 256) << '%'; + double min_elapsed = std::numeric_limits<double>::max(); + for (size_t i = 0; i < LOOP; ++i) { + Timer timer; + + auto pipeline_builder = grnxx::PipelineBuilder::create(table); + auto cursor = table->create_cursor(); + pipeline_builder->push_cursor(std::move(cursor)); + auto expression_builder = grnxx::ExpressionBuilder::create(table); + expression_builder->push_column("A"); + expression_builder->push_constant(upper_limit); + expression_builder->push_operator(grnxx::LESS_OPERATOR); + auto expression = expression_builder->release(); + pipeline_builder->push_filter(std::move(expression)); + auto pipeline = pipeline_builder->release(); + grnxx::Array<grnxx::Record> records; + pipeline->flush(&records); + + double elapsed = timer.elapsed(); + if (elapsed < min_elapsed) { + min_elapsed = elapsed; + } + } + std::cout << ", min. elapsed [s] = " << min_elapsed << std::endl; +} + +void benchmark_grnxx(const grnxx::Table *table) { + benchmark_grnxx(table, grnxx::Int(16)); + benchmark_grnxx(table, grnxx::Int(32)); + benchmark_grnxx(table, grnxx::Int(64)); + benchmark_grnxx(table, grnxx::Int(128)); + benchmark_grnxx(table, grnxx::Int(192)); + benchmark_grnxx(table, grnxx::Int(224)); + benchmark_grnxx(table, grnxx::Int(240)); +} + +void benchmark_grnxx() { + std::cout << __PRETTY_FUNCTION__ << std::endl; + + auto db = grnxx::open_db(""); + auto table = db->create_table("Table"); + auto col_a = table->create_column("A", grnxx::INT_DATA); + for (size_t i = 0; i < SIZE; ++i) { + grnxx::Int row_id = table->insert_row(); + col_a->set(row_id, a[i]); + } + + benchmark_grnxx(table); +} + +void benchmark_native_batch(grnxx::Int upper_limit) { + std::cout << "LESS: ratio = " << (100 * upper_limit.raw() / 256) << '%'; + double min_elapsed = std::numeric_limits<double>::max(); + for (size_t i = 0; i < LOOP; ++i) { + Timer timer; + + grnxx::Array<grnxx::Record> records; + records.resize(SIZE); + for (size_t j = 0; j < SIZE; ++j) { + records[j].row_id = grnxx::Int(j); + records[j].score = grnxx::Float(0.0); + } + size_t count = 0; + for (size_t j = 0; j < SIZE; ++j) { + if ((a[records[j].row_id.raw()] < upper_limit).is_true()) { + records[count] = grnxx::Record(grnxx::Int(j), grnxx::Float(0.0)); + ++count; + } + } + records.resize(count); + + double elapsed = timer.elapsed(); + if (elapsed < min_elapsed) { + min_elapsed = elapsed; + } + } + std::cout << ", min. elapsed [s] = " << min_elapsed << std::endl; +} + +void benchmark_native_batch() { + std::cout << __PRETTY_FUNCTION__ << std::endl; + + benchmark_native_batch(grnxx::Int(16)); + benchmark_native_batch(grnxx::Int(32)); + benchmark_native_batch(grnxx::Int(64)); + benchmark_native_batch(grnxx::Int(128)); + benchmark_native_batch(grnxx::Int(192)); + benchmark_native_batch(grnxx::Int(224)); + benchmark_native_batch(grnxx::Int(240)); +} + +void benchmark_native_sequential(grnxx::Int upper_limit) { + std::cout << "LESS: ratio = " << (100 * upper_limit.raw() / 256) << '%'; + double min_elapsed = std::numeric_limits<double>::max(); + for (size_t i = 0; i < LOOP; ++i) { + Timer timer; + + grnxx::Array<grnxx::Record> records; + for (size_t j = 0; j < SIZE; ++j) { + if ((a[j] < upper_limit).is_true()) { + records.push_back(grnxx::Record(grnxx::Int(j), grnxx::Float(0.0))); + } + } + + double elapsed = timer.elapsed(); + if (elapsed < min_elapsed) { + min_elapsed = elapsed; + } + } + std::cout << ", min. elapsed [s] = " << min_elapsed << std::endl; +} + +void benchmark_native_sequential() { + std::cout << __PRETTY_FUNCTION__ << std::endl; + + benchmark_native_sequential(grnxx::Int(16)); + benchmark_native_sequential(grnxx::Int(32)); + benchmark_native_sequential(grnxx::Int(64)); + benchmark_native_sequential(grnxx::Int(128)); + benchmark_native_sequential(grnxx::Int(192)); + benchmark_native_sequential(grnxx::Int(224)); + benchmark_native_sequential(grnxx::Int(240)); +} + +void benchmark_native() { + benchmark_native_batch(); + benchmark_native_sequential(); +} + +} // namespace + +int main() { + generate_data(); + + benchmark_grnxx(); + benchmark_native(); + + return 0; +} -------------- next part -------------- HTML����������������������������...다운로드
