TransactionalDataStructure

From APIDesign

(Difference between revisions)
Jump to: navigation, search
Line 1: Line 1:
-
[[TransactionalDataStructure]] is a realization of [[wikipedia::Lock free algorithm]]. The primary goal is '''not to avoid locks'', but to build reliable data structure that ''keeps consistency'' even under multi threaded access and can be easily reason about. To do so the data structure uses two important concepts:
+
[[TransactionalDataStructure]] is a realization of [[wikipedia::Lock free algorithm]]. The primary goal is ''not to avoid locks'', but to build reliable data structure that ''keeps consistency'' even under multi threaded access and can be easily reason about. To do so the data structure uses two important concepts:
* immutability
* immutability
* compare and swap (aka [[wikipedia::Compare-and-swap|CAS]]) operation
* compare and swap (aka [[wikipedia::Compare-and-swap|CAS]]) operation

Revision as of 15:52, 6 June 2025

TransactionalDataStructure is a realization of wikipedia::Lock free algorithm. The primary goal is not to avoid locks, but to build reliable data structure that keeps consistency even under multi threaded access and can be easily reason about. To do so the data structure uses two important concepts:

  • immutability
  • compare and swap (aka CAS) operation


Lock Free Algorithm

CAS - compare and swap

Retrieved from "http://wiki.apidesign.org/wiki/TransactionalDataStructure"
Personal tools
buy