
ALT Those scary mnemonics vpmovzxbd, vmovmskpd, vpermps… have you seen these sometimes and felt your brain immediately shut down? I sure have. The mnemonics of the original x86 instruction set are simple, like mov and add, because their descriptions are also simple. With these vector instructions, whole complex sentences get compressed into less than a dozen letters. To make them less scary, you have to learn how to quickly parse them. They unpack like a matryoshka doll. For example, in vpmovzxbd: the core is mov: "move" (actually copy) values zx means "with zero extension" (as opposed to sign extension) movzx is a pre-existing x86 mnemonic p stands for "packed", and means the values are placed right next to each other, without any padding v means "vector" and signals an AVX instruction b is for "byte", an 8-bit integer d is for "double word", a 32-bit integer

ALT title: Concurrent Datastructure Design Walk-Through Concurrent data structure design is hard. This blog is a guided tour through building a concurrent map, heavily biased towards readers. The article will not just present yet another ready-to-use data structure. Instead, I will walk you through the design process while solving a real-world problem. I will even present dead ends that I bumped into along the way. It's a detective story for programmers interested in concurrent programming. By the end of the article, we will have a concurrent map for storing blobs of data in native memory. The map is lock-free on a reading path and is also very conservative with memory allocations. Let's get started!





























