Locked Data Structures

$\newcommand{\N}{\mathbb N} \newcommand{\Z}{\mathbb Z} \newcommand{\Q}{\mathbb Q} \newcommand{\R}{\mathbb R} \newcommand{\lt}{<} \newcommand{\gt}{>} \newcommand{\amp}{&} \definecolor{fillinmathshade}{gray}{0.9} \newcommand{\fillinmath}[1]{\mathchoice{\colorbox{fillinmathshade}{$\displaystyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\textstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptscriptstyle\phantom{\,#1\,}$}}} $

Section 4.7 Locked Data Structures

This section covers book chapter 29, on the topic of how to build thread-safe structures and some of the tradeoffs.

🔗

Read section 29.1, focusing in particular on the "Scalable counting" subsection and the description of an approximate counter.

🔗

Read section 29.2, about implementing concurrent linked lists. Pay attention to the two approaches: Lock the whole list at once vs locking individual nodes.

🔗

Read section 29.3, about building a concurrent queue.

🔗

Read the rest.

🔗

You have attempted of activities on this page.

🔗

Prev Top Next