forked from fast-pack/FastPFOR-rs
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathfastpfor_benchmark.rs
More file actions
343 lines (294 loc) · 10.8 KB
/
Copy pathfastpfor_benchmark.rs
File metadata and controls
343 lines (294 loc) · 10.8 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
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
use core::ops::Range;
use std::hint::black_box;
use std::io::Cursor;
use criterion::{criterion_group, criterion_main, BenchmarkId, Criterion, Throughput};
use fastpfor::rust::{FastPFOR, Integer, BLOCK_SIZE_128, BLOCK_SIZE_256, DEFAULT_PAGE_SIZE};
use rand::rngs::StdRng;
use rand::{RngExt as _, SeedableRng};
const SIZES: &[usize; 2] = &[1024, 4096];
const SEED: u64 = 456;
type DataGeneratorFn = fn(usize) -> Vec<u32>;
/// Generate uniformly distributed random data
fn generate_uniform_data_from_range(size: usize, value_range: Range<u32>) -> Vec<u32> {
let mut rng = StdRng::seed_from_u64(SEED);
(0..size)
.map(|_| rng.random_range(value_range.clone()))
.collect()
}
fn generate_uniform_data_small_value_distribution(size: usize) -> Vec<u32> {
generate_uniform_data_from_range(size, 0..1000)
}
fn generate_uniform_data_large_value_distribution(size: usize) -> Vec<u32> {
generate_uniform_data_from_range(size, 0..u32::MAX)
}
/// Generate clustered data - values tend to cluster around changing base values
fn generate_clustered_data(size: usize) -> Vec<u32> {
let mut rng = StdRng::seed_from_u64(SEED);
let mut data = Vec::with_capacity(size);
let mut base = 0u32;
for _ in 0..size {
// 10% chance to jump to a new cluster
if rng.random_bool(0.1) {
base = rng.random_range(0..1000);
}
data.push(base + rng.random_range(0..10));
}
data
}
/// Generate sequential/sorted data - ideal for compression
fn generate_sequential_data(size: usize) -> Vec<u32> {
(0..size as u32).collect()
}
/// Generate sparse data - mostly zeros with occasional random values
fn generate_sparse_data(size: usize) -> Vec<u32> {
let mut rng = StdRng::seed_from_u64(SEED);
(0..size)
.map(|_| {
if rng.random_bool(0.9) {
0
} else {
rng.random()
}
})
.collect()
}
/// Generate constant data - best case for compression
fn generate_constant_data(size: usize) -> Vec<u32> {
vec![SEED as u32; size]
}
/// Generate data with powers of two
fn generate_geometric_data(size: usize) -> Vec<u32> {
(0..size).map(|i| 1u32 << (i % 30)).collect()
}
/// Helper function to compress data and return the compressed size
fn compress_data(codec: &mut FastPFOR, data: &[u32]) -> usize {
let mut compressed = vec![0u32; data.len() * 2];
let mut input_offset = Cursor::new(0);
let mut output_offset = Cursor::new(0);
codec
.compress(
data,
data.len() as u32,
&mut input_offset,
&mut compressed,
&mut output_offset,
)
.unwrap();
output_offset.position() as usize
}
/// Helper function to compress data and return compressed buffer
fn prepare_compressed_data(data: &[u32], block_size: u32) -> Vec<u32> {
let mut codec = FastPFOR::new(DEFAULT_PAGE_SIZE, block_size);
let mut compressed = vec![0u32; data.len() * 2];
let mut input_offset = Cursor::new(0);
let mut output_offset = Cursor::new(0);
codec
.compress(
data,
data.len() as u32,
&mut input_offset,
&mut compressed,
&mut output_offset,
)
.unwrap();
let compressed_size = output_offset.position() as usize;
compressed.truncate(compressed_size);
compressed
}
/// Helper function to decompress data
fn decompress_data(codec: &mut FastPFOR, compressed: &[u32], original_size: usize) -> usize {
let mut decompressed = vec![0u32; original_size];
let mut input_offset = Cursor::new(0);
let mut output_offset = Cursor::new(0);
codec
.uncompress(
compressed,
compressed.len() as u32,
&mut input_offset,
&mut decompressed,
&mut output_offset,
)
.unwrap();
output_offset.position() as usize
}
fn benchmark_compression(c: &mut Criterion) {
let mut group = c.benchmark_group("compression");
let patterns: &[(&str, DataGeneratorFn)] = &[
(
"uniform_small_value_distribution",
generate_uniform_data_small_value_distribution,
),
(
"uniform_large_value_distribution",
generate_uniform_data_large_value_distribution,
),
("clustered", generate_clustered_data),
("sequential", generate_sequential_data),
("sparse", generate_sparse_data),
];
for &size in SIZES {
for (name, generator) in patterns {
let data = generator(size);
group.throughput(Throughput::Elements(size as u64));
group.bench_with_input(BenchmarkId::new(*name, size), &data, |b, data| {
b.iter(|| {
let mut codec = FastPFOR::default();
black_box(compress_data(&mut codec, black_box(data)))
});
});
}
}
group.finish();
}
fn benchmark_decompression(c: &mut Criterion) {
let mut group = c.benchmark_group("decompression");
let patterns: &[(&str, DataGeneratorFn)] = &[
(
"uniform_small_value_distribution",
generate_uniform_data_small_value_distribution,
),
(
"uniform_large_value_distribution",
generate_uniform_data_large_value_distribution,
),
("clustered", generate_clustered_data),
("sequential", generate_sequential_data),
("sparse", generate_sparse_data),
];
for &size in SIZES {
for (name, generator) in patterns {
let data = generator(size);
let compressed = prepare_compressed_data(&data, BLOCK_SIZE_128);
group.throughput(Throughput::Elements(size as u64));
group.bench_with_input(
BenchmarkId::new(*name, size),
&(compressed, size),
|b, (compressed, size)| {
b.iter(|| {
let mut codec = FastPFOR::default();
black_box(decompress_data(&mut codec, black_box(compressed), *size))
});
},
);
}
}
group.finish();
}
fn benchmark_roundtrip(c: &mut Criterion) {
let mut group = c.benchmark_group("roundtrip");
for &size in SIZES {
let data = generate_uniform_data_small_value_distribution(size);
group.throughput(Throughput::Elements(size as u64));
group.bench_with_input(
BenchmarkId::new("compress_decompress", size),
&data,
|b, data| {
b.iter(|| {
let mut codec1 = FastPFOR::default();
let mut codec2 = FastPFOR::default();
let mut compressed = vec![0u32; data.len() * 2];
let mut decompressed = vec![0u32; data.len()];
let mut input_offset = Cursor::new(0);
let mut output_offset = Cursor::new(0);
codec1
.compress(
black_box(data),
data.len() as u32,
&mut input_offset,
&mut compressed,
&mut output_offset,
)
.unwrap();
input_offset.set_position(0);
let compressed_len = output_offset.position();
output_offset.set_position(0);
codec2
.uncompress(
&compressed,
data.len() as u32,
&mut input_offset,
&mut decompressed,
&mut output_offset,
)
.unwrap();
black_box((compressed_len, output_offset.position()))
});
},
);
}
group.finish();
}
fn benchmark_block_sizes(c: &mut Criterion) {
let mut group = c.benchmark_group("block_sizes");
let size = *SIZES.last().unwrap();
let data = generate_uniform_data_small_value_distribution(size);
let block_sizes = [BLOCK_SIZE_128, BLOCK_SIZE_256];
for block_size in block_sizes {
group.throughput(Throughput::Elements(size as u64));
group.bench_function(format!("compress_{block_size}"), |b| {
b.iter(|| {
let mut codec = FastPFOR::new(DEFAULT_PAGE_SIZE, block_size);
black_box(compress_data(&mut codec, black_box(&data)))
});
});
}
// Also benchmark decompression performance for each block size
for block_size in block_sizes {
// Pre-compress the data once for this block size so the decompression
// benchmark measures only decompression work inside `b.iter`.
let compressed = prepare_compressed_data(&data, block_size);
group.throughput(Throughput::Elements(size as u64));
group.bench_function(format!("decompress_{block_size}"), |b| {
b.iter(|| {
let mut codec = FastPFOR::new(DEFAULT_PAGE_SIZE, block_size);
black_box(decompress_data(&mut codec, black_box(&compressed), size));
});
});
}
group.finish();
}
fn benchmark_compression_ratio(c: &mut Criterion) {
let mut group = c.benchmark_group("compression_ratio");
group.sample_size(20); // Fewer samples since we're measuring ratio, not just speed
let size = *SIZES.last().unwrap();
let patterns: &[(&str, DataGeneratorFn)] = &[
(
"uniform_small_distribution",
generate_uniform_data_small_value_distribution,
),
(
"uniform_large_distribution",
generate_uniform_data_large_value_distribution,
),
("clustered", generate_clustered_data),
("sequential", generate_sequential_data),
("sparse", generate_sparse_data),
("constant", generate_constant_data),
("geometric", generate_geometric_data),
];
for (name, data_fn) in patterns {
let data = data_fn(size);
group.bench_function(*name, |b| {
b.iter(|| {
let mut codec = FastPFOR::default();
let compressed_size = compress_data(&mut codec, black_box(&data));
#[expect(
clippy::cast_precision_loss,
reason = "Loss of precision is acceptable for compression ratio calculation"
)]
let ratio = data.len() as f64 / compressed_size as f64;
black_box(ratio)
});
});
}
group.finish();
}
criterion_group!(
benches,
benchmark_compression,
benchmark_decompression,
benchmark_roundtrip,
benchmark_block_sizes,
benchmark_compression_ratio
);
criterion_main!(benches);