ProcessMesh
Durable execution for side effects that must happen exactly once.
A distributed backend where every side effect is idempotent, every retry is safe, and a crashed worker never leaves a half-finished job behind.
Live model of a request path: clients, a load balancer, 5 requests per second across workers, and a store that applies each idempotency key once.
Durable execution for side effects that must happen exactly once.
A distributed backend where every side effect is idempotent, every retry is safe, and a crashed worker never leaves a half-finished job behind.
A C++ order book tuned for latency, memory layout, and cache behavior.
Low-level performance work: contiguous memory, cache-line-aware structures, and measured tail latency under sustained load.
A fault-tolerant distributed task runtime built from scratch in Python.
Schedules dependency-aware workloads across local and remote workers. Survives worker failure through heartbeats, retries, resource reservations, backpressure, and stale-result protection.
Arizona State University
TODO: one measurable outcome.
Arizona State University
TODO: one measurable outcome.
Arizona State University
TODO: one measurable outcome.
Undergraduate Student Government, ASU
TODO: one outcome.
TODO: one line — the Rust/Go/C FFI problem and what merged.