About
Before I wrote any code I spent years on UKMT math competitions, and in 2022 I qualified for the British Mathematical Olympiad. Those problems trained me to look for the structure under a messy surface. When I took my first systems course at Berkeley, it was a surprise to find the same things there: invariants, state machines, and careful thinking about what can go wrong.
I like working at the layer where mistakes are expensive. A dropped packet, a corrupted log record, or a race on a hot path can't be fixed by rerunning a test. You have to understand what the cache, the memory model, the protocol, and the scheduler are actually doing. That's why I took Operating Systems (CS 162), Compilers (CS 164), and Databases (CS 186), and why I wrote my matching engine from scratch with my own allocators instead of reaching for a library.
I'm a senior mentor and content lead for CS 61C, which means I write the weekly worksheets for a course of 300+ students. Writing a worksheet on caches or pipelining shows you very quickly which parts you only thought you understood. The notes on this site come from the same habit.
This past summer I was on the Traffic Platform team at Databricks, working in Go and Rust. The summer before, I was at Amazon building a real-time IoT platform. I'm looking for a new grad job in 2027 working on distributed systems or infrastructure.
Outside of work I play cricket and tennis. I also have strong opinions about RISC-V.
If you're working on something in this space and want to talk, email me at mansoormmamnoon@berkeley.edu.