In this section I am going to share my experience regarding design and implementation of scalable synchronization algorithms. Note that scalability does not necessary imply lock-freedom or wait-freedom, they are actually orthogonal. However, sometimes scalable algorithms are also lockfree or waitfree at least partially. Here you will find some articles about general underlying aspects, and some with descriptions and code for specific synchronization algorithms. Move on to Introduction |
Home >
Lockfree Algorithms
Subpages (15):
Asymmetric Synchronization
Eventcounts
False-sharing
First Things First
Introduction
Lazy Concurrent Initialization
Links
Object Life-time Management
Producer-Consumer Queues
Reader-Writer Problem
Scalability Prerequisites
So what is a memory model? And how to cook it?
Stacks
Tips & Tricks
Your Arsenal
Comments