-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathbenchmark_quick_partition.c
More file actions
185 lines (153 loc) · 7.97 KB
/
benchmark_quick_partition.c
File metadata and controls
185 lines (153 loc) · 7.97 KB
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
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
#include <assert.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <limits.h>
#include "benchmark.h"
#include "debug.h"
#include "option.h"
#include "bubble_sort.h"
#include "insert_sort.h"
#include "heap_sort.h"
#include "merge_sort.h"
#include "merge_hybrid_sort.h"
#include "network_sort.h"
#include "quick_sort.h"
#include "radix_sort.h"
#include "std_sort.h"
typedef void (*wrap_quick_partition_t)(int* const keys_begin, int* const keys_end);
void wrap_quick_partition_default(int* const keys_begin, int* const keys_end)
{
quick_partition_default(keys_begin, keys_end, quick_median3_pivot(keys_begin, keys_end));
}
void wrap_quick_partition_swap_then_fit(int* const keys_begin, int* const keys_end)
{
quick_partition_swap_then_fit(keys_begin, keys_end, quick_median3_pivot(keys_begin, keys_end));
}
void wrap_quick_partition_swap_by_block_then_fit_8(int* const keys_begin, int* const keys_end)
{
quick_partition_swap_by_block_then_fit_8(keys_begin, keys_end, quick_median3_pivot(keys_begin, keys_end));
}
void wrap_quick_partition_swap_by_block_then_fit_16(int* const keys_begin, int* const keys_end)
{
quick_partition_swap_by_block_then_fit_16(keys_begin, keys_end, quick_median3_pivot(keys_begin, keys_end));
}
void wrap_quick_partition_swap_by_block_then_fit_32(int* const keys_begin, int* const keys_end)
{
quick_partition_swap_by_block_then_fit_32(keys_begin, keys_end, quick_median3_pivot(keys_begin, keys_end));
}
void wrap_quick_partition_swap_by_block_then_fit_64(int* const keys_begin, int* const keys_end)
{
quick_partition_swap_by_block_then_fit_64(keys_begin, keys_end, quick_median3_pivot(keys_begin, keys_end));
}
void wrap_quick_partition_swap_by_block_then_fit_128(int* const keys_begin, int* const keys_end)
{
quick_partition_swap_by_block_then_fit_128(keys_begin, keys_end, quick_median3_pivot(keys_begin, keys_end));
}
void wrap_quick_partition_swap_by_block_then_fit_256(int* const keys_begin, int* const keys_end)
{
quick_partition_swap_by_block_then_fit_256(keys_begin, keys_end, quick_median3_pivot(keys_begin, keys_end));
}
void wrap_quick_partition_three_ways(int* const keys_begin, int* const keys_end)
{
quick_partition_three_ways(keys_begin, keys_end, quick_median3_pivot(keys_begin, keys_end));
}
typedef struct
{
wrap_quick_partition_t quick_partition;
const char* partition_name;
long long int is_enabled;
}
benchmark_t;
int main(int argc, char** argv)
{
const int quick_partition_group_is_enabled = option_parse_command_line(argc, argv, "--quick-partition=", "-qp=", 0);
const int quick_partition_swap_by_block_group_is_enabled = option_parse_command_line(argc, argv, "--quick-partition-swap-by-block-then-fit=", "-qpsbf=", 0);
const benchmark_t benchmarks[] =
{
{wrap_quick_partition_default, "quick_partition_default", quick_partition_group_is_enabled || option_parse_command_line(argc, argv, "--quick-partition-default=", "-qpd=", 0)},
{wrap_quick_partition_swap_then_fit, "quick_partition_swap_then_fit", quick_partition_group_is_enabled || option_parse_command_line(argc, argv, "--quick-partition-swap-then-fit=", "-qpsf=", 0)},
{wrap_quick_partition_swap_by_block_then_fit_8, "quick_partition_swap_by_block_then_fit_8", quick_partition_group_is_enabled || quick_partition_swap_by_block_group_is_enabled || option_parse_command_line(argc, argv, "--quick-partition-swap-by-block-then-fit-8=", "-qpsbf8=", 0)},
{wrap_quick_partition_swap_by_block_then_fit_16, "quick_partition_swap_by_block_then_fit_16", quick_partition_group_is_enabled || quick_partition_swap_by_block_group_is_enabled || option_parse_command_line(argc, argv, "--quick-partition-swap-by-block-then-fit-16=", "-qpsbf16=", 0)},
{wrap_quick_partition_swap_by_block_then_fit_32, "quick_partition_swap_by_block_then_fit_32", quick_partition_group_is_enabled || quick_partition_swap_by_block_group_is_enabled || option_parse_command_line(argc, argv, "--quick-partition-swap-by-block-then-fit-32=", "-qpsbf32=", 0)},
{wrap_quick_partition_swap_by_block_then_fit_64, "quick_partition_swap_by_block_then_fit_64", quick_partition_group_is_enabled || quick_partition_swap_by_block_group_is_enabled || option_parse_command_line(argc, argv, "--quick-partition-swap-by-block-then-fit-64=", "-qpsbf64=", 0)},
{wrap_quick_partition_swap_by_block_then_fit_128, "quick_partition_swap_by_block_then_fit_128", quick_partition_group_is_enabled || quick_partition_swap_by_block_group_is_enabled || option_parse_command_line(argc, argv, "--quick-partition-swap-by-block-then-fit-128=", "-qpsbf128=", 0)},
{wrap_quick_partition_swap_by_block_then_fit_256, "quick_partition_swap_by_block_then_fit_256", quick_partition_group_is_enabled || quick_partition_swap_by_block_group_is_enabled || option_parse_command_line(argc, argv, "--quick-partition-swap-by-block-then-fit-256=", "-qpsbf256=", 0)},
{wrap_quick_partition_three_ways, "quick_partition_three_ways", quick_partition_group_is_enabled || option_parse_command_line(argc, argv, "--quick-partition-three-ways=", "-qp3=", 0)},
};
const int max_key_count = option_parse_command_line(argc, argv, "--max-key-count=", "-kc=", 1 << 24);
const int min_key_count = option_parse_command_line(argc, argv, "--min-key-count=", "-mkc=", max_key_count);
const int step_key_count_multiplier = option_parse_command_line(argc, argv, "--step-key-multiplier=", "-skm=", 2);
const int max_key_value = option_parse_command_line(argc, argv, "--max-key-value=", "-kv=", INT_MAX);
const int min_key_value = option_parse_command_line(argc, argv, "--min-key-value=", "-mkv=", INT_MIN);
const int split_count = option_parse_command_line(argc, argv, "--split-count", "-sc=", 1);
const int verbose = option_parse_command_line(argc, argv, "--verbose=", "-v=", 1);
const int repeat_count = 1000;
int* ref_keys = (int*)malloc((unsigned int)max_key_count * sizeof(int));
int* temp_keys = (int*)malloc((unsigned int)max_key_count * sizeof(int));
int* keys = (int*)malloc((unsigned int)max_key_count * sizeof(int));
benchmark_generate_random_keys(ref_keys, max_key_count, 42, min_key_value, max_key_value);
if (!verbose)
{
printf("Partition Name;Key Count;Duration us\n");
}
const int sort_count = sizeof(benchmarks) / sizeof(benchmarks[0]);
for (int sort_index = 0; sort_index < sort_count; ++sort_index)
{
const benchmark_t benchmark = benchmarks[sort_index];
if (benchmark.is_enabled == 0)
{
continue;
}
const wrap_quick_partition_t quick_partition = benchmark.quick_partition;
const char* partition_name = benchmark.partition_name;
for (int key_count = min_key_count; key_count <= max_key_count; key_count *= step_key_count_multiplier)
{
const int split_key_count = key_count / split_count;
if (verbose)
{
printf("Function %s count %d split %d:\n", partition_name, key_count, split_count);
}
int duration = 0;
for (int repeat_index = 0; repeat_index < repeat_count; ++repeat_index)
{
if (verbose)
{
printf(" %.3d", repeat_index);
}
memcpy(keys, ref_keys, (unsigned int)key_count * sizeof(int));
{
int repeat_duration = 0;
benchmark_scope_t* inner_scope1 = benchmark_begin();
for (int split_index = 0; split_index < split_count; ++split_index)
{
quick_partition(&keys[split_index * split_key_count], &keys[split_index * split_key_count + split_key_count]);
}
repeat_duration += benchmark_end_us(inner_scope1);
if (verbose)
{
printf(" %dus\n", repeat_duration);
}
duration += repeat_duration;
}
}
const int average_duration = duration / repeat_count;
if (verbose)
{
printf(" %d took an average %dus\n", key_count, average_duration);
}
else
{
printf("%s;%d;%d\n", partition_name, key_count, average_duration);
}
}
}
free(keys);
free(temp_keys);
free(ref_keys);
if (verbose)
{
printf("Done !\n");
}
return 0;
}