@NSDuc
Nothing here yet.
Nothing here yet.
Jan 3 · 12 min read · I. Introduction and Prerequisite 1. Introduction a. Circular queue A circular queue is a fundamental data structure that follows the FIFO (First-In, First-Out) principle, but with a fixed, bounded capacity arranged in a circular manner, hence both en...
Join discussionDec 24, 2025 · 11 min read · I. Introduction & Prerequisite 1. Introduction This blog introduces huge page support in the Linux kernel, a feature added in the kernel version 2.6, to improve virtual memory performance. By increasing the page size from the default 4KB to 2MB or 1 ...
Join discussion