AI, big data, cloud computing, and networking.
This article explains NUMA architecture, its multithreaded performance overheads such as remote memory access, cache synchronization, context and mode switches, interrupt handling, TLB misses, and memory copies, and then presents optimization techniques like NUMA and CPU affinity, IRQ tuning, and large‑page usage.
Linux’s memory allocation mechanisms—Buddy for main memory and Slab/Slub for CPU cache—aim to maximize memory utilization, minimize fragmentation, and boost allocation efficiency, with detailed explanations of their structures, operation steps, and how to inspect them via /proc interfaces.
This article explains how the Linux kernel scheduler allocates CPU time among user processes in multi‑core environments, covering the main scheduler types—CFS, RT, and Deadline—their algorithms, priority schemes, and practical configuration using ps, nice, and chrt commands.
This article explains how C programs allocate, resize, initialize, and transfer memory using functions like malloc, free, realloc, memset, memcpy, memmove, and alloca, and provides coding standards to avoid out‑of‑bounds errors, leaks, and use‑after‑free bugs.
This article explains Linux huge pages, their performance benefits, implementation details, configuration steps, and the impact on memory reporting, including guidance on using and disabling Transparent Huge Pages for optimal system tuning.
This tutorial walks through extending a C‑based Lisp interpreter with string support, comment parsing, built‑in print and error commands, file loading capabilities, providing complete code examples and explanations for each feature in the interpreter.
This tutorial walks through extending a C‑based Lisp interpreter by adding conditional branching, comparison built‑ins, an if keyword, and registering all built‑in functions, while providing the complete source code and explanations for each component.
This tutorial walks through adding Q‑Expression support to a Lisp‑style interpreter written in C, covering syntax definition, parser updates, implementation of head, tail, join, list, and eval functions, macro‑based assertions, and a complete source listing with compilation instructions.
This article explains the concept of S‑Expressions, defines their simple syntax, and provides a complete C implementation that parses, stores, evaluates, and prints S‑Expression based Lisp code, including detailed explanations of data structures, constructors, destructors, and evaluation logic.
This article explains how to create a Lispy Value storage system in C, defining numeric and error types, enumerations, constructors, printing functions, and semantic error detection to support a simple Lisp REPL that evaluates Polish notation expressions.
