HyperThread OS
CPU scheduling and process management simulator with O(log n) min-heaps, privilege separation, and Gantt visuals.
Signature: Multi-algorithm scheduling · starvation controls · execution timelines
Key Verified Performance Metrics
01 System Context & Problem
CPU scheduling simulators are often visual-only tools that fail to model actual microkernel safety parameters, starvation traps, or realistic performance metrics.
02 Architecture & Implementation
Decoupled single-page app containing process execution state machines, feeding Gantt playback streams on the client, with FastAPI serving AI context vectors.
Engineering Approach: Developed a micro-simulation engine from scratch using TypeScript for client scheduling queues and FastAPI for Groq API orchestration.
03 Technical Decisions & Trade-offs
Core Architectural Decision
Constructed scheduling priority queues using custom Min-Heap arrays in TypeScript rather than standard arrays, optimizing sorting on large numbers of process injections.
Constraints & Incurred Trade-off
Using AI narration introduces API latency. Handled this by pre-generating descriptions of the scheduling outcomes asynchronously so Gantt playback remains completely stutter-free.
04 Scalability, Throughput & Security
Designed process queues to scale up to 10,000 simulated threads without UI freeze by leveraging Web Workers for off-thread queue computations.
Achieved 60fps Gantt rendering on canvas while executing CPU simulation loops at 120Hz.
05 Verified Outcomes
- Reduced CPU process selection complexity from O(n) to O(log n) using custom Min-Heap structures.
- Modeled Ring 0/Ring 3 OS-level privileges and aging safety systems to prevent process starvation.
- Integrated tick-by-tick Gantt visualization with Groq AI-narrated voiceovers.