Systems Software & Backend Engineer

Jyotish Kumar

C++ systems, networking, concurrency & performance

I build low-latency backend systems from first principles — including a non-blocking epoll TCP matching engine and a persistent in-memory key-value store. I benchmark them under load, test failure modes, and document the limits instead of hiding them.

218K+ requests handled per second Key-value store peak
64.5K TCP connections at once Matching engine load test
105 automated tests passed Checked with ASan & TSan
Explore the work

Projects

C++ Matching Engine

A single-instrument limit order book and TCP matching engine designed around deterministic matching and a hand-rolled, non-blocking epoll event loop.

C++17 epoll TCP GTest ASan UBSan TSan
  • Implemented price-time priority matching with partial fills, cancellation, ownership checks, self-trade handling, and multiple-price-level sweeps.
  • Served clients through a custom non-blocking epoll-based event loop rather than a thread-per-connection or networking framework.
  • Sustained 64,500 concurrent TCP connections for a 2-minute load test with zero failures, at roughly 164K requests/sec aggregate throughput.
  • Kept steady-state median latency around 42–45 µs while scaling the order book from 100 to 10,000,000 orders.
  • Passed 105 tests under ASan/UBSan and TSan, plus dedicated TCP chaos tests covering drip feeds, fragmentation, and malformed oversized payloads.

Benchmarks were measured locally on an i5-11300H running Fedora Linux; detailed conditions and raw results are documented in the repository.

C++ Key-Value Store

A single-node concurrent key-value store with a custom TCP protocol, command parser, Append-Only File persistence, and a full build, test, sanitizer, soak, and benchmark pipeline.

C++ TCP AOF GTest GBench
  • Built a thread-safe in-memory store with Append-Only File persistence so writes can be reconstructed across restarts.
  • Reached 218,251 requests/sec in high-stress benchmarking with 100 persistent concurrent threads.
  • Completed a 10-minute endurance run processing 108.5 million requests with zero failures.
  • Exercised the server at up to 64.5 concurrent client connections while keeping the implementation sanitizer-clean.
  • Tested protocol resilience against fragmented and sticky TCP packets and validated 10,000-key data integrity with zero read/write errors.

Benchmarks were measured locally on an i5-11300H running Fedora Linux; exact test conditions and raw logs are available in the repository.

Algorithmic Problem Solving

LeetCode

Profile

751 problems solved; peak contest rating 1711 (Top 13.51%) with a 177-day active streak.

GeeksforGeeks

Profile

603 problems solved, coding score 2001, 198-day POTD streak, and Institute Rank 65.

Technical Skills

Languages

C++17 C Python SQL JavaScript HTML/CSS

Systems & Networking

epoll TCP/IP Socket Programming Multithreading Concurrency Lock Design AOF Persistence Low-Latency Optimization

Testing & Engineering

GTest GBench ASan UBSan TSan Load Testing Chaos Testing CMake GitHub Actions

Core CS

Data Structures Algorithms Operating Systems Computer Networks Database Systems Scientific Computing

Education

B.Tech in Mathematics and Computing

2021 – 2025

Indian Institute of Technology (IIT) Guwahati

Guwahati, Assam

  • Relevant coursework: Data Structures and Algorithms, Design and Analysis of Algorithms, Operating Systems, Database Management Systems, Computer Networks, Discrete Mathematics, Probability Theory, Monte-Carlo Simulation, Optimization, Linear Algebra, Financial Engineering.
  • Prior schooling: Jawahar Navodaya Vidyalaya, Etawah (CBSE) — Class 12 Science (PCM + Computer Science), 2020.

Experience

OCFP Faculty

May 2025 – August 2026

K12 Techno Services

Bangalore, KA & Indore, MP

  • Taught foundational Mathematics (JEE/competitive-exam prep) and Physics for Grades 6–12.

About

Systems software and backend engineer with a B.Tech in Mathematics and Computing from IIT Guwahati. My work is centered on understanding what happens below the abstraction: sockets, event loops, concurrency, data structures, locking, persistence, and latency.

The two featured projects are intentionally built end-to-end. They include custom networking, concurrency control, benchmarks, protocol-failure tests, endurance runs, and sanitizer-based verification. The goal is not to claim production scale; it is to show the engineering process used to measure a system and understand where it breaks.

Before moving into software engineering, I taught Mathematics and Physics — including foundational mathematics for JEE and competitive-exam preparation — for grades 6–12. That work sharpened the same habits I now apply to systems engineering: breaking a problem down clearly, checking my own reasoning, and explaining technical ideas precisely.

Backend Architecture

Event-driven TCP servers, protocol handling, persistence, and high-throughput request processing.

Systems Engineering

C/C++, concurrency, synchronization, data structures, and performance reasoning from first principles.

Measured Engineering

Benchmarks, endurance tests, chaos tests, and ASan/UBSan/TSan validation with documented limitations.