MrComputerScience.com
Blog For Marketing And Tech Nerds
Every process on a modern operating system runs in its own virtual address space. The OS and CPU hardware cooperate to translate virtual addresses to physical RAM transparently, isolating processes …
Continue Reading about How Does the OS Manage Virtual Memory and Page Tables? →
False sharing occurs when two threads on different CPU cores modify different variables that happen to sit on the same cache line. The hardware sees writes to the same cache line from two cores and …
Continue Reading about Why Does False Sharing Destroy Multithreaded Performance? →
Out-of-order execution lets a CPU execute instructions in a different sequence than the program specifies, filling pipeline stalls with independent work. When one instruction waits for data from …
Continue Reading about What Happens Inside the CPU When Out-of-Order Execution Runs? →
A cache-oblivious algorithm achieves optimal cache performance without knowing the cache size, line size, or memory hierarchy at design time. By recursively dividing problems until sub-problems fit in …
Continue Reading about What Is a Cache-Oblivious Algorithm and Why Does It Matter? →
Both Quicksort and Mergesort have O(n log n) average time complexity, but Quicksort is faster in practice on most hardware. The reason is cache behavior. Quicksort operates in-place and accesses …
Continue Reading about Why Does Quicksort Beat Mergesort in Real-World Software? →
Vector embeddings represent text as points in high-dimensional space where semantic similarity maps to geometric proximity. Retrieval augmented generation uses this property to find relevant documents …
Continue Reading about Why Do AI Systems Use Vector Embeddings and How Does RAG Work? →
