Skip to content

Fix fast tq advance and add bigger benchmark. #13

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
GhostofCookie merged 1 commit into from
Oct 13, 2026
Merged

Fix fast tq advance and add bigger benchmark. #13

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions benchmark/CMakeLists.txt
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -9,6 +9,7 @@ CPMAddPackage("gh:google/benchmark@1.9.5")

add_executable(timeq_benchmark
time_queue.cpp
realistic_time_queue.cpp
)

set_target_properties(timeq_benchmark PROPERTIES
Expand Down
51 changes: 51 additions & 0 deletions benchmark/realistic_time_queue.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,51 @@
#include "time_queue_bench.hpp"

#include <benchmark/benchmark.h>

#include <timeq/fast_time_queue.h>
#include <timeq/time_queue.h>

struct MockPayloadData
{
std::uint64_t id;
std::uint8_t priority;
std::uint8_t action;
std::uint64_t tick_microseconds;

std::shared_ptr<const std::vector<uint8_t>> data = std::make_shared<const std::vector<std::uint8_t>>(1000);
};

using namespace timeq;

BENCHMARK(Construct<time_queue<MockPayloadData>>)->Arg(300)->Arg(1'000'000);
BENCHMARK(Construct<fast_time_queue<MockPayloadData>>)->Arg(300)->Arg(1'000'000);

BENCHMARK(Push<time_queue<MockPayloadData>>)->Iterations(kIterations)->Arg(300)->Arg(1'000'000);
BENCHMARK(Push<fast_time_queue<MockPayloadData>>)->Iterations(kIterations)->Arg(300)->Arg(1'000'000);

BENCHMARK(FirstPushAfterIdle<time_queue<MockPayloadData>>)->Arg(300)->Arg(1'000'000);
BENCHMARK(FirstPushAfterIdle<fast_time_queue<MockPayloadData>>)->Arg(300)->Arg(1'000'000);

BENCHMARK(Pop<time_queue<MockPayloadData>>)->Iterations(kIterations)->Arg(300)->Arg(1'000'000);
BENCHMARK(Pop<fast_time_queue<MockPayloadData>>)->Iterations(kIterations)->Arg(300)->Arg(1'000'000);

BENCHMARK(Front<time_queue<MockPayloadData>>)->Iterations(kIterations)->Arg(300)->Arg(1'000'000);
BENCHMARK(Front<fast_time_queue<MockPayloadData>>)->Iterations(kIterations)->Arg(300)->Arg(1'000'000);

BENCHMARK(PopFront<time_queue<MockPayloadData>>)->Iterations(kIterations)->Arg(300)->Arg(1'000'000);
BENCHMARK(PopFront<fast_time_queue<MockPayloadData>>)->Iterations(kIterations)->Arg(300)->Arg(1'000'000);

BENCHMARK(Size<time_queue<MockPayloadData>>)->Iterations(kIterations);
BENCHMARK(Size<fast_time_queue<MockPayloadData>>)->Iterations(kIterations);

BENCHMARK(Empty<time_queue<MockPayloadData>>)->Iterations(kIterations);
BENCHMARK(Empty<fast_time_queue<MockPayloadData>>)->Iterations(kIterations);

BENCHMARK(PushAndPopLoaded<time_queue<MockPayloadData>>)->Arg(5000)->Arg(1'000'000);
BENCHMARK(PushAndPopLoaded<fast_time_queue<MockPayloadData>>)->Arg(5000)->Arg(1'000'000);

BENCHMARK(PushAndPop_Interval_1ms<time_queue<MockPayloadData>>)->Arg(5000)->Arg(1'000'000);
BENCHMARK(PushAndPop_Interval_1ms<fast_time_queue<MockPayloadData>>)->Arg(5000)->Arg(1'000'000);

BENCHMARK(PushAndPop_Interval_125ms<time_queue<MockPayloadData>>)->Arg(5000)->Arg(1'000'000);
BENCHMARK(PushAndPop_Interval_125ms<fast_time_queue<MockPayloadData>>)->Arg(5000)->Arg(1'000'000);
221 changes: 2 additions & 219 deletions benchmark/time_queue.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,227 +1,10 @@
#include "time_queue_bench.hpp"

#include <benchmark/benchmark.h>

#include <timeq/fast_time_queue.h>
#include <timeq/time_queue.h>

#include <type_traits>

struct mock_tick_service : timeq::tick_service
{
explicit mock_tick_service(std::chrono::milliseconds ticks)
: ticks(ticks)
{
}

std::chrono::microseconds get() const override { return ticks; }

std::chrono::microseconds ticks;
};

static auto service = std::make_shared<timeq::threaded_tick_service>();

constexpr size_t kIterations = 100'000'000;

template<class TimeQueue>
static void
Construct(benchmark::State& state)
{
const std::size_t duration = state.range(0);
for (auto _ : state) {
auto tq = TimeQueue(duration, 1, service);

std::size_t size = tq.size();
benchmark::DoNotOptimize(size);
benchmark::ClobberMemory();
}
}

template<class TimeQueue>
static void
Push(benchmark::State& state)
{
TimeQueue tq(state.range(0), 1, service, kIterations);
int64_t items_count = 0;

for (auto _ : state) {
++items_count;
tq.push({}, 20);
}

state.SetItemsProcessed(items_count);
}

template<class TimeQueue>
static void
FirstPushAfterIdle(benchmark::State& state)
{
const std::size_t duration = state.range(0);
auto aged_service = std::make_shared<mock_tick_service>(std::chrono::milliseconds(duration - 1));
TimeQueue tq(duration, 1, aged_service, 1);

for (auto _ : state) {
tq.push({}, duration);

std::size_t size = tq.size();
benchmark::DoNotOptimize(size);
benchmark::ClobberMemory();
}
}

template<class TimeQueue>
static void
Pop(benchmark::State& state)
{
TimeQueue tq(state.range(0), 1, service, kIterations);
for (size_t i = 0; i < kIterations; ++i) {
tq.push({}, 10);
}

int64_t items_count = 0;
for (auto _ : state) {
++items_count;
tq.pop();
}

state.SetItemsProcessed(items_count);
}

template<class TimeQueue>
static void
Front(benchmark::State& state)
{
TimeQueue tq(state.range(0), 1, service, kIterations);
for (size_t i = 0; i < kIterations; ++i) {
tq.push({}, 15);
}

int64_t items_count = 0;
for (auto _ : state) {
++items_count;
auto value = tq.front();
benchmark::DoNotOptimize(value);
benchmark::ClobberMemory();
}

state.SetItemsProcessed(items_count);
}

template<class TimeQueue>
static void
PopFront(benchmark::State& state)
{
TimeQueue tq(state.range(0), 1, service, kIterations);
for (size_t i = 0; i < kIterations; ++i) {
tq.push({}, 15);
}

int64_t items_count = 0;
for (auto _ : state) {
++items_count;
auto value = tq.pop_front();
benchmark::DoNotOptimize(value);
benchmark::ClobberMemory();
}

state.SetItemsProcessed(items_count);
}

template<class TimeQueue>
static void
Size(benchmark::State& state)
{
TimeQueue tq(300, 1, service, kIterations);
for (size_t i = 0; i < kIterations; ++i) {
tq.push({}, 10);
}

for (auto _ : state) {
std::size_t size = tq.size();
benchmark::DoNotOptimize(size);
benchmark::ClobberMemory();
}
}

template<class TimeQueue>
static void
Empty(benchmark::State& state)
{
TimeQueue tq(300, 1, service, kIterations);
for (size_t i = 0; i < kIterations; ++i) {
tq.push({}, 10);
}

for (auto _ : state) {
std::size_t size = tq.empty();
benchmark::DoNotOptimize(size);
benchmark::ClobberMemory();
}
}

template<class TimeQueue>
static void
PushAndPopLoaded(benchmark::State& state)
{
TimeQueue tq(state.range(0), 1, service, kIterations);
int64_t items_count = 0;

for (auto _ : state) {
++items_count;
tq.push({}, 1000);

// Simulate load by not popping all items
if (items_count % 100 == 0) {
auto elem = tq.front();
tq.pop();
benchmark::DoNotOptimize(elem);
benchmark::ClobberMemory();
}
}

state.SetItemsProcessed(items_count);
}

template<class TimeQueue>
static void
PushAndPop_Interval_1ms(benchmark::State& state)
{
TimeQueue tq(state.range(0), 1, service, kIterations);
int64_t items_count = 0;

for (auto _ : state) {
++items_count;
tq.push({}, 1000);

auto elem = tq.front();
tq.pop();

benchmark::DoNotOptimize(elem);
benchmark::ClobberMemory();
}

state.SetItemsProcessed(items_count);
}

template<class TimeQueue>
static void
PushAndPop_Interval_125ms(benchmark::State& state)
{
TimeQueue tq(state.range(0), 125, service, kIterations);
int64_t items_count = 0;

for (auto _ : state) {
++items_count;
tq.push({}, 1000);

auto elem = tq.front();
tq.pop();

benchmark::DoNotOptimize(elem);
benchmark::ClobberMemory();
}

state.SetItemsProcessed(items_count);
}

struct TrivialType
{};

Expand Down
Loading
Loading