|
|
Log in / Subscribe / Register

Concurrent code and expensive instructions

Concurrent code and expensive instructions

Posted Oct 2, 2014 6:00 UTC (Thu) by PaulMcKenney (✭ supporter ✭, #9624)
In reply to: Concurrent code and expensive instructions by ego360
Parent article: Concurrent code and expensive instructions

You are quite right, incrementing by any constant (and especially the constant zero!) guarantees linearizability.

And I agree that it can make a lot of sense to apply distributed-system algorithms to shared-memory systems, especially to the fastpath portions of shared-memory systems.


to post comments


Copyright © 2026, Eklektix, Inc.
Comments and public postings are copyrighted by their creators.
Linux is a registered trademark of Linus Torvalds