Skip to main content
Eshan Roy@eshanized
Active Library·Systems & Infrastructure·Primary: Rust

Veda

High-performance Rust parallel runtime with adaptive work-stealing.

A parallel execution runtime in Rust featuring adaptive work-stealing scheduling, lock-free queues, and NUMA-aware thread affinity for compute-intensive pipelines.

Problem Statement

Standard thread pools bottleneck on task synchronization and cross-core cache invalidation when running millions of micro-tasks across heterogeneous CPU topologies.

Intended Audience

Systems programmers writing high-throughput simulation, rendering, and data transformation engines.

Core Architecture & Mental Model

Custom Chase-Lev work-stealing deques combined with NUMA node affinity pinning to keep thread communication within local memory channels.

Verified System Capabilities

Adaptive Work-Stealing Scheduling: Minimizes thread contention under uneven task durations
Lock-Free Task Deques: Microsecond-level dispatch latency
NUMA-Aware Affinity: Minimizes cross-socket cache line bouncing

Architectural Decisions & Rationales

Lock-free deque implementation with atomic primitives

Rationale: Eliminates mutex lock contention in critical dispatch loops.

64-byte cache line padding on worker counters

Rationale: Prevents false sharing across multi-core CPU architectures.

Technical Trade-offs & Honest Limitations

  • Optimized for compute-bound workloads; heavy I/O tasks should use Tokio or asynchronous runtimes instead.
  • NUMA thread pinning requires appropriate OS permissions and topology discovery support in the host kernel.
Empirical Verification Evidence

Public repository in TIVerse organization (`github.com/TIVerse/veda-rs`) with Criterion benchmarks.

Related Research & Architectural Writing