membase 0.2.1

Ultra-high performance async runtime with fast task cycling, lock-free scheduling, and zero-overhead performance
Documentation 
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

//! Performance benchmark example for the membase library.

use std::fs::File;
use std::io::{Write, Read, Seek, SeekFrom};
use std::path::Path;
use std::time::Instant;

use membase::MmapOptions;
use membase::platform::Advice;

const FILE_SIZE: usize = 100 * 1024 * 1024; // 100MB
const CHUNK_SIZE: usize = 4096;
const ITERATIONS: usize = 100;

fn main() -> Result<(), Box<dyn std::error::Error>> {
    println!("membase Performance Benchmark");
    println!("=============================");

    // Create a large temporary file
    println!("Creating a {}MB test file...", FILE_SIZE / 1024 / 1024);
    let path = Path::new("benchmark_data.bin");
    let mut file = File::create(&path)?;
    
    // Write random data to the file
    let mut buffer = vec![0u8; CHUNK_SIZE];
    for i in 0..(FILE_SIZE / CHUNK_SIZE) {
        // Generate some deterministic pattern
        for j in 0..CHUNK_SIZE {
            buffer[j] = ((i * j) % 256) as u8;
        }
        file.write_all(&buffer)?;
    }
    file.sync_all()?;
    
    // Close the file
    drop(file);
    
    // Benchmark 1: Sequential read with standard I/O
    println!("\nBenchmark 1: Sequential read with standard I/O");
    let mut file = File::open(&path)?;
    let mut buffer = vec![0u8; CHUNK_SIZE];
    
    let start = Instant::now();
    for _ in 0..ITERATIONS {
        file.seek(SeekFrom::Start(0))?;
        let mut _total_bytes = 0;
        loop {
            match file.read(&mut buffer)? {
                0 => break,
                n => {
                    _total_bytes += n;
                    // Do something with the data to prevent optimization
                    buffer[0] = buffer[0].wrapping_add(1);
                }
            }
        }
    }
    let elapsed = start.elapsed();
    println!("  Time: {:?}", elapsed);
    println!("  Throughput: {:.2} MB/s", 
        (FILE_SIZE as f64 * ITERATIONS as f64) / (1024.0 * 1024.0 * elapsed.as_secs_f64()));
    
    // Benchmark 2: Sequential read with memory mapping
    println!("\nBenchmark 2: Sequential read with memory mapping");
    let file = File::open(&path)?;
    let map = unsafe { MmapOptions::new().map(&file)? };
    
    let start = Instant::now();
    for _ in 0..ITERATIONS {
        let mut checksum = 0u64;
        for chunk in map.chunks(CHUNK_SIZE) {
            // Do something with the data to prevent optimization
            checksum = checksum.wrapping_add(chunk[0] as u64);
        }
        // Use checksum to prevent optimization
        if checksum == 0 {
            println!("  Checksum: {}", checksum);
        }
    }
    let elapsed = start.elapsed();
    println!("  Time: {:?}", elapsed);
    println!("  Throughput: {:.2} MB/s", 
        (FILE_SIZE as f64 * ITERATIONS as f64) / (1024.0 * 1024.0 * elapsed.as_secs_f64()));
    
    // Benchmark 3: Random access with standard I/O
    println!("\nBenchmark 3: Random access with standard I/O");
    let mut file = File::open(&path)?;
    let mut buffer = vec![0u8; CHUNK_SIZE];
    
    let start = Instant::now();
    for i in 0..ITERATIONS {
        for j in 0..100 {
            let offset = ((i * j * 997) % (FILE_SIZE / CHUNK_SIZE)) * CHUNK_SIZE;
            file.seek(SeekFrom::Start(offset as u64))?;
            file.read_exact(&mut buffer)?;
            // Do something with the data to prevent optimization
            buffer[0] = buffer[0].wrapping_add(1);
        }
    }
    let elapsed = start.elapsed();
    println!("  Time: {:?}", elapsed);
    println!("  Operations per second: {:.2}", 
        (ITERATIONS * 100) as f64 / elapsed.as_secs_f64());
    
    // Benchmark 4: Random access with memory mapping
    println!("\nBenchmark 4: Random access with memory mapping");
    let file = File::open(&path)?;
    let map = unsafe { MmapOptions::new().map(&file)? };
    
    let start = Instant::now();
    for i in 0..ITERATIONS {
        let mut checksum = 0u64;
        for j in 0..100 {
            let offset = ((i * j * 997) % (FILE_SIZE / CHUNK_SIZE)) * CHUNK_SIZE;
            let chunk = &map[offset..offset + CHUNK_SIZE];
            // Do something with the data to prevent optimization
            checksum = checksum.wrapping_add(chunk[0] as u64);
        }
        // Use checksum to prevent optimization
        if checksum == 0 {
            println!("  Checksum: {}", checksum);
        }
    }
    let elapsed = start.elapsed();
    println!("  Time: {:?}", elapsed);
    println!("  Operations per second: {:.2}", 
        (ITERATIONS * 100) as f64 / elapsed.as_secs_f64());
    
    // Benchmark 5: Write with standard I/O
    println!("\nBenchmark 5: Write with standard I/O");
    let mut file = File::create(&path)?;
    let buffer = vec![42u8; CHUNK_SIZE];
    
    let start = Instant::now();
    for _ in 0..ITERATIONS {
        file.seek(SeekFrom::Start(0))?;
        for _ in 0..(FILE_SIZE / CHUNK_SIZE) {
            file.write_all(&buffer)?;
        }
        file.sync_all()?;
    }
    let elapsed = start.elapsed();
    println!("  Time: {:?}", elapsed);
    println!("  Throughput: {:.2} MB/s", 
        (FILE_SIZE as f64 * ITERATIONS as f64) / (1024.0 * 1024.0 * elapsed.as_secs_f64()));
    
    // Benchmark 6: Write with memory mapping
    println!("\nBenchmark 6: Write with memory mapping");
    let file = File::open(&path)?;
    let mut map = unsafe { MmapOptions::new().write(true).map_mut(&file)? };
    
    let start = Instant::now();
    for _ in 0..ITERATIONS {
        for chunk in map.chunks_mut(CHUNK_SIZE) {
            // Fill with a pattern
            for i in 0..chunk.len() {
                chunk[i] = 42;
            }
        }
        map.flush()?;
    }
    let elapsed = start.elapsed();
    println!("  Time: {:?}", elapsed);
    println!("  Throughput: {:.2} MB/s", 
        (FILE_SIZE as f64 * ITERATIONS as f64) / (1024.0 * 1024.0 * elapsed.as_secs_f64()));
    
    // Benchmark 7: Sequential read with optimized memory mapping
    println!("\nBenchmark 7: Sequential read with optimized memory mapping");
    let file = File::open(&path)?;
    let map = unsafe { 
        MmapOptions::new()
            .prefetch(membase::PrefetchStrategy::Sequential)
            .populate(true)
            .map(&file)? 
    };
    
    // Advise the kernel about our access pattern
    map.advise(Advice::Sequential)?;
    
    let start = Instant::now();
    for _ in 0..ITERATIONS {
        let mut checksum = 0u64;
        for chunk in map.chunks(CHUNK_SIZE) {
            // Do something with the data to prevent optimization
            checksum = checksum.wrapping_add(chunk[0] as u64);
        }
        // Use checksum to prevent optimization
        if checksum == 0 {
            println!("  Checksum: {}", checksum);
        }
    }
    let elapsed = start.elapsed();
    println!("  Time: {:?}", elapsed);
    println!("  Throughput: {:.2} MB/s", 
        (FILE_SIZE as f64 * ITERATIONS as f64) / (1024.0 * 1024.0 * elapsed.as_secs_f64()));
    
    // Benchmark 8: Random access with optimized memory mapping
    println!("\nBenchmark 8: Random access with optimized memory mapping");
    let file = File::open(&path)?;
    let map = unsafe { 
        MmapOptions::new()
            .populate(true)
            .map(&file)? 
    };
    
    // Advise the kernel about our access pattern
    map.advise(Advice::Random)?;
    
    let start = Instant::now();
    for i in 0..ITERATIONS {
        let mut checksum = 0u64;
        for j in 0..100 {
            let offset = ((i * j * 997) % (FILE_SIZE / CHUNK_SIZE)) * CHUNK_SIZE;
            let chunk = &map[offset..offset + CHUNK_SIZE];
            // Do something with the data to prevent optimization
            checksum = checksum.wrapping_add(chunk[0] as u64);
        }
        // Use checksum to prevent optimization
        if checksum == 0 {
            println!("  Checksum: {}", checksum);
        }
    }
    let elapsed = start.elapsed();
    println!("  Time: {:?}", elapsed);
    println!("  Operations per second: {:.2}", 
        (ITERATIONS * 100) as f64 / elapsed.as_secs_f64());
    
    // Clean up
    drop(map);
    std::fs::remove_file(&path)?;
    
    println!("\nBenchmark completed successfully!");
    
    Ok(())
}