computer science
12 articles tagged computer science.
-
Static Single Assignment Form and Phi Functions
How SSA gives each value one definition, while φ-functions merge control-flow paths so compiler optimizations remain correct.
-
Python Descriptors: Properties, Methods, and Slots
How Python’s __get__, __set__, and __delete__ hooks control attribute access and power properties, bound methods, and slot-based storage.
-
Go Interface Values: Dynamic Types, Values, and Typed Nil
Understand the type-and-value pair inside every Go interface and why an interface holding a typed nil is not itself nil.
-
CPython’s Cyclic Garbage Collector
How CPython finds reference cycles that reference counting cannot reclaim, and how generations and thresholds decide when to collect them.
-
Acquire and Release Memory Ordering
How release operations publish prior writes to acquire operations without forcing every atomic access into one global order.
-
Bloom Filters and Probabilistic Set Membership
Learn how Bloom filters use a bit array and multiple hashes to save memory while allowing false positives but not false negatives.
-
Memory Barriers and Concurrent Memory Ordering
Memory barriers constrain compiler and CPU reordering so one thread can observe another’s updates in order, without making a whole operation atomic.
-
Go Interface Values: Dynamic Types, Values, and Nil Pointers
Go interfaces pair a dynamic type with a value, enabling method dispatch while making typed nil pointers different from nil interfaces.
-
How Linkers Resolve Symbols and Relocations
How linkers turn object files into runnable code by matching symbols, fixing addresses, and coordinating position-independent code with shared libraries.
-
CPU Cache-Line False Sharing
Learn why independent writes can invalidate each other’s cache lines, and how padding and data layout prevent coherence-driven slowdowns.
-
Python Descriptors and Attribute Access
Understand how Python descriptors power properties, bound methods, and ORM fields by intercepting reads, writes, and deletion.
-
Static Single Assignment Form and Phi Nodes
How SSA gives every assignment a distinct version and uses phi nodes to merge values when control-flow paths meet.