this post was submitted on 11 Jan 2025
22 points (100.0% liked)
Programming
17788 readers
98 users here now
Welcome to the main community in programming.dev! Feel free to post anything relating to programming here!
Cross posting is strongly encouraged in the instance. If you feel your post or another person's post makes sense in another community cross post into it.
Hope you enjoy the instance!
Rules
Rules
- Follow the programming.dev instance rules
- Keep content related to programming in some way
- If you're posting long videos try to add in some form of tldr for those who don't want to watch videos
Wormhole
Follow the wormhole through a path of communities !webdev@programming.dev
founded 2 years ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
The nice thing about circular buffers is that they can be made lock-free by making each pointer only ever modified by one function, ie.
getmodifies theheadandputmodifies thetail.The solution in the article modifies both
headandtailin thegetfunction (when subtracting the page size to put the buffer back into the first page) which makes synchronization necessary to avoid races.The author could actually make this implementation lock-free too, by making only the
getfunction perform the subtraction on theheadwhilst theputfunction performs the subtraction on thetail.You would then just need a little bit of extra logic when calculating the current size, but then you'd have a lock-free data structure.