Loading...

Tag trends are in beta. Feedback? Thoughts? Email me at [email protected]

Consistent overhead byte stuffing for binary logs

SBCL: The Assembly Code Breadboard

Linear-log bucketing: fast, versatile, simple (2015)

Plan B for UUIDs: double AES-128

Bounded dynamicism with cross-modifying code

Restartable sequences with the polysemic null segment selector

Slitter: A slab allocator that trusts, but verifies

SBCL: The Assembly Code Breadboard

All you need is call/cc (2013)

0x7FDE623822FC16E6: A magic constant for double float reciprocal

Entomological solutions

Baseline implementations should be predictable

Stuff Your Logs

Flatter wait-free hazard pointers

Check for borrows in bitwise operations

Too much locality for stores to forward

A Couple of (Probabilistic) Worst-case Bounds for Robin Hood Linear Probing

Preemption Is GC for Memory Reordering

So you want to write an lp solver (2013)

The unscalable deadlock-prone thread pool

Preemption Is GC for Memory Reordering

Restartable Sequences with the Polysemic Null Segment Selector

Testing SLO-Type Properties with the Confidence Sequence Method

An Old Conjecture on Stream Transducers

How to Print Integers Really Fast

How to Define New Intrinsics in SBCL (2014)

Binary Search Is a Pathological Case for Caches (2012)

Retrospective on Binary Search and Comp{ress,ilat}ion

SBCL: The Ultimate Assembly Code Breadboard (2014)

Retrospective on Binary Search and Comp{ress,ilat}ion

More →