Languages
What I reach for, and why.
- GoMeshery server, CLI tooling
- C / C++17Storage engines, concurrency
- PythonPipelines, CV, tooling
- TypeScript / JavaScriptReact UI work
- JavaOOP, DSA
- SQLSchema design, query tuning
Shivam Mishra — Systems & Distributed Backend Engineer
CS undergraduate at DSCE Bangalore working on systems design, distributed systems and microservices. I write C++17 storage engines, Kafka-backed inference pipelines, and I ship upstream fixes to Meshery — a CNCF cloud-native project — by tracing bugs to their actual root cause instead of patching the symptom.
Most of my time goes into the layer where correctness is non-negotiable: write-ahead logs that survive a crash mid-flush, consumers that keep up when the producer refuses to slow down, locks that let a hundred readers through without letting one writer corrupt the page. I started there because it was the part I could not fake my way through.
That instinct is also how I contribute to open source. On Meshery — a CNCF cloud-native management plane — I have walked a broken UI regression backwards through several merge commits to a single dropped import, verified a missing CLI filter against a backend that already supported it, and pinned a docs rendering bug to the exact Hugo template line responsible. The fix is usually small. Finding out which line actually deserves the fix is the work.
Right now I am looking for internships where the hard problems are infrastructural — storage, streaming, scheduling, developer tooling — and where I get to read a lot of code written by people better than me.
Education
B.E. in Computer Science and Engineering
Expected July 2028
CGPA 8.2 / 10.0
Coursework focus in AI/ML and DevOps. Primary interest: systems design, distributed systems and microservices.
Spec sheet
“The fix is usually small. Finding out which line actually deserves the fix is the work.”
Grouped by the problem they solve rather than by logo. Everything listed here has shipped in a project, a contribution or a contest.
33
tracked competencies
What I reach for, and why.
Services, contracts and the stores behind them.
Where the guarantees actually live.
Getting it to run the same way twice.
Applied, not academic — inference under a latency budget.
The theory I keep coming back to.
Open source is my main proving ground: real reviewers, real regressions, real merge conflicts.
Jun 2026 — Present
CNCF Cloud Native Project
Open Source Contributor
Remote
meshery/mesheryContributing across the full surface of a CNCF project: the Go server, the mesheryctl CLI, the React UI and the Hugo documentation site. My pattern is consistent — reproduce, bisect, root-cause, then fix the cause.
Traced a UI regression — broken Settings tabs and two failing E2E tests — backwards through several merge commits to a single dropped import, then fixed and verified it end to end rather than patching the visible symptom.
Verified through the mesheryctl CLI that component search was missing a --model filter even though the backend already exposed model filtering via ComponentFilter.ModelName; implemented, tested and validated the fix end to end.
Diagnosed a documentation rendering bug — missing page headings on Hugo/Docsy section-index pages — down to the exact template line responsible, and filed a root-caused issue with reproduction steps.
Restructured and shipped documentation changes to match existing project conventions after maintainer review, including an intra-page table of contents for dynamically generated model pages and a shortcode reference guide for docs contributors.
Contribution ledger
6 entries
Jun 2026
Forage Virtual Job Simulation
Technology Job Simulation
Remote
Worked through development and coding tasks inside a simulated technology-consulting engagement.
Designed a technical proposal for a client-facing data analytics dashboard, covering data modelling, visualisation strategy and log analysis.
Applied Python for data processing and forensic log analysis against a realistic client brief.
Each of these started as a guarantee I wanted to be able to make — no dropped frames, no data loss on crash, no hand-waving about bit-flips — and the architecture followed from it.
Event-driven inference that does not drop frames when it gets busy.
Kafka is the load-bearing decision: ingestion never blocks on inference, so a burst becomes queue depth instead of lost frames. Throughput scales by adding consumers to the group.
A naïve video analytics service couples capture to inference: the camera loop calls the model directly. The moment the GPU falls behind the camera, frames are silently dropped and the detection record becomes a lie. The system needs to absorb bursts without losing evidence.
Architected an event-driven microservice pipeline that decouples edge ingestion from neural-network compute through Kafka, so backpressure lands in a durable log instead of in the capture loop.
Implemented smart frame sampling — every 5th frame — cutting CPU load by 80% while keeping detection continuity for the tracked subject.
Deployed headless YOLOv8 inference nodes as Kafka consumers, letting throughput scale by adding consumers to the group rather than rewriting the pipeline.
Containerised the whole stack with Docker Compose and dependency healthchecks across Zookeeper, Kafka and PostgreSQL so the system comes up in the right order, every time.
Persisted detection events to PostgreSQL as the durable sink for downstream querying and replay.
A key-value engine built from scratch in C++17 — the architecture behind LevelDB and RocksDB.
Acknowledgement happens after the WAL append, not after the flush — durability without paying disk-flush latency on every put. std::shared_mutex lets concurrent readers through while a writer holds exclusive access.
Reading about LSM-trees teaches you the diagram. It does not teach you what happens when a flush races a read, or what the log has to contain for a crash mid-write to be recoverable. So I built the engine instead of reading about it.
Built a high-performance embedded key-value storage engine from scratch in C++17, implementing the Log-Structured Merge-Tree architecture that underpins LevelDB and RocksDB.
Engineered a thread-safe MemTable using std::shared_mutex read-write locks, so concurrent readers proceed in parallel while writers take exclusive access.
Implemented Write-Ahead Logging so that a crash between an acknowledged write and the SSTable flush is recoverable — zero data loss on crash.
Wrote a background compaction engine performing leveled SSTable merging, keeping read amplification bounded as the dataset grows.
Designed the write path so acknowledgement happens after the WAL append, not after the flush — durability without paying disk latency on every put.
Making cosmic-ray bit-flips visible, one memory cell at a time.
Two fault classes with deliberately different signatures: a transient upset scatters, a stuck-at fault repeats at the same address forever. Seeing them side by side is the whole pedagogical point.
Fault tolerance is taught as an abstraction: 'bits flip, so we add ECC'. Nobody sees the flip. We built a tool that injects the fault, shows the corruption spread through memory, and makes the hardware–software boundary concrete.
Co-developed a visual simulation tool modelling memory-level hardware faults — cosmic-ray induced bit-flips and stuck-at gate faults — to bridge hardware–software interaction and fault-tolerance concepts.
Modelled the memory array with NumPy so fault injection and corruption propagation are computed over the whole address space at once.
Built an interactive Streamlit interface for real-time fault injection and live visualisation of memory corruption patterns.
Supported multiple fault classes — transient single-bit upsets versus permanent stuck-at-0 / stuck-at-1 gate faults — so their different failure signatures can be compared side by side.
National-level engineering challenges, capture-the-flag competitions and rated contests — the places where the constraint is time and the scoring is public.
3rd
AWS Student Builder Club, DSCE — Team BlackStar
Scored 4,950 points individually — the highest on the team. We entered outside the top 10 and finished 3rd overall.
Semifinal
National Engineering Challenge
Cleared Rounds 1 and 2 against a national field and advanced to the Round 3 semifinal.
National-Level 24-Hour Hackathon, E-Cell BMSIT&M
Advanced to and competed in Round 1 at national level under a 24-hour build constraint.
Competitive Programming
Current rating 1240 — regular contest participation. @smisra30
(opens in a new tab)Competitive Programming
Current rating 1569 — regular contest participation. @smisra30
(opens in a new tab)Salesforce · Trailhead
Agentforce certification covering agent design, grounding and action orchestration on the Salesforce platform. Verified on Trailblazer.
(opens in a new tab)Deloitte Australia · Forage
Development and coding tasks in a simulated consulting engagement — technical proposal for a client data analytics dashboard.
Meshery · CNCF
Ongoing merged and in-review contributions across a Cloud Native Computing Foundation project.
(opens in a new tab)Microsoft
Cloud and DevOps skill-building through Microsoft Learn certification pathways — Azure fundamentals, GitHub workflows and CI/CD automation with GitHub Actions — alongside a global community of student developers.
AWS Student Builder Club, DSCE
Cloud and security community at DSCE; competed for the club at XYTHERA CTF.
Delhi Public School, Azad Nagar
Led inter-house coordination across events, logistics and team selection.
Model United Nations
Represented delegations in committee — research, position papers and live debate.
I'm looking for software engineering and research internships in distributed systems, storage, developer tooling and infrastructure. If that's the kind of work on your team's roadmap, I'd like to hear about it.