TempleOS - Algorithms in the Kernel (4s-H33P49WY)

Discusses a guided tour of kernel algorithms in TempleOS, covering disk-cache hashing with least-recently-used behavior, FAT gap selection for allocation, and LZW compression mechanics. Explains core runtime structures including symbol-table hashing, heap allocation via size-bucketed free lists, optimized qsort variants, and a round-robin scheduler before deferring compiler algorithms to a follow-up.

Copyright © 2023 - 2026 Serhii Zasenko. All rights reserved