Implement an OS Component to Prove Systems Understanding

10 weeks · 0 milestones

Implement a working process scheduler, memory allocator, or file system component from scratch, accompanied by a written trade-off analysis comparing your design choice against at least two alternatives (e.g. preemptive vs. cooperative scheduling; paging vs. segmentation; linked-list vs. buddy allocator). The analysis must explain the specific workloads under which your choice outperforms alternatives and the specific conditions under which it does not. Proof: the implementation and analysis reviewed by a CS lecturer or systems engineer who asks 'what would happen to your scheduler if you had 1000 threads all waiting on the same lock?' — you must answer using your implementation, not a generic description.

Sign in to start this outcome and track your progress publicly.