Candidate Pool
Tasks proposed by the community at various stages of development. From raw ideas seeking code to fully built benchmarks ready to go live.
Parallel BFS on Large Graphs
Breadth-first search on million-node graphs. Optimize thread scheduling and memory locality for 4x speedup on a single 8-core machine.
JPEG Encoder Optimization
Baseline JPEG encoder using naive DCT. Seeking SIMD-accelerated transforms and optimized Huffman coding for throughput gains.
Redis-like KV Store Throughput
In-memory key-value store hitting throughput ceiling at 500k ops/sec. Explore lock-free data structures and io_uring integration.
Fast Inverse Square Root
Classic Quake III-style bit-manipulation optimization. Full benchmark with precision verification and throughput scoring.
Constraint Solver for SAT
DPLL-based SAT solver with naive backtracking. Goal: implement CDCL with watched literals for 10x speedup on industrial instances.
WebSocket Server Throughput
High-concurrency WebSocket server bottlenecked at 10k connections. Explore epoll optimizations and zero-copy frame parsing.
B-tree Concurrent Access
Single-threaded B-tree implementation. Need concurrent read/write access with optimistic locking and latch-free traversal.
Video Codec Frame Prediction
Motion estimation in video encoding is too slow for real-time. Explore hierarchical search and SIMD-accelerated SAD computation.