summaryrefslogtreecommitdiff
path: root/doc/html/lockfree.html
diff options
context:
space:
mode:
Diffstat (limited to 'doc/html/lockfree.html')
-rw-r--r--doc/html/lockfree.html18
1 files changed, 8 insertions, 10 deletions
diff --git a/doc/html/lockfree.html b/doc/html/lockfree.html
index 1fb5a47ed1..a0aa8ef980 100644
--- a/doc/html/lockfree.html
+++ b/doc/html/lockfree.html
@@ -2,13 +2,14 @@
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
-<title>Chapter 22. Boost.Lockfree</title>
+<title>Chapter 20. Boost.Lockfree</title>
<link rel="stylesheet" href="../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
<link rel="home" href="index.html" title="The Boost C++ Libraries BoostBook Documentation Subset">
<link rel="up" href="libraries.html" title="Part I. The Boost C++ Libraries (BoostBook Subset)">
<link rel="prev" href="boost_lexical_cast/performance.html" title="Performance">
<link rel="next" href="lockfree/examples.html" title="Examples">
+<meta name="viewport" content="width=device-width, initial-scale=1">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -26,7 +27,7 @@
<div class="chapter">
<div class="titlepage"><div>
<div><h2 class="title">
-<a name="lockfree"></a>Chapter 22. Boost.Lockfree</h2></div>
+<a name="lockfree"></a>Chapter 20. Boost.Lockfree</h2></div>
<div><div class="author"><h3 class="author">
<span class="firstname">Tim</span> <span class="surname">Blechmann</span>
</h3></div></div>
@@ -125,7 +126,7 @@
<p>
Non-blocking data structures do not rely on locks and mutexes to ensure thread-safety.
The synchronization is done completely in user-space without any direct interaction
- with the operating system <a href="#ftn.lockfree.introduction___motivation.f0" class="footnote" name="lockfree.introduction___motivation.f0"><sup class="footnote">[8]</sup></a>. This implies that they are not prone to issues like priority inversion
+ with the operating system <a href="#ftn.lockfree.introduction___motivation.f0" class="footnote" name="lockfree.introduction___motivation.f0"><sup class="footnote">[7]</sup></a>. This implies that they are not prone to issues like priority inversion
(a low-priority thread needs to wait for a high-priority thread).
</p>
<p>
@@ -147,7 +148,7 @@
'wait-free' only mention the upper bound of an operation. Therefore lock-free
data structures are not necessarily the best choice for every use case. In
order to maximise the throughput of an application one should consider high-performance
- concurrent data structures <a href="#ftn.lockfree.introduction___motivation.f1" class="footnote" name="lockfree.introduction___motivation.f1"><sup class="footnote">[9]</sup></a>.
+ concurrent data structures <a href="#ftn.lockfree.introduction___motivation.f1" class="footnote" name="lockfree.introduction___motivation.f1"><sup class="footnote">[8]</sup></a>.
</p>
<p>
Lock-free data structures will be a better choice in order to optimize the
@@ -258,22 +259,19 @@
</div>
<div class="footnotes">
<br><hr style="width:100; text-align:left;margin-left: 0">
-<div id="ftn.lockfree.introduction___motivation.f0" class="footnote"><p><a href="#lockfree.introduction___motivation.f0" class="para"><sup class="para">[8] </sup></a>
+<div id="ftn.lockfree.introduction___motivation.f0" class="footnote"><p><a href="#lockfree.introduction___motivation.f0" class="para"><sup class="para">[7] </sup></a>
Spinlocks do not directly interact with the operating system either. However
it is possible that the owning thread is preempted by the operating system,
which violates the lock-free property.
</p></div>
-<div id="ftn.lockfree.introduction___motivation.f1" class="footnote"><p><a href="#lockfree.introduction___motivation.f1" class="para"><sup class="para">[9] </sup></a>
+<div id="ftn.lockfree.introduction___motivation.f1" class="footnote"><p><a href="#lockfree.introduction___motivation.f1" class="para"><sup class="para">[8] </sup></a>
<a href="http://threadingbuildingblocks.org/" target="_top">Intel's Thread Building
Blocks library</a> provides many efficient concurrent data structures,
which are not necessarily lock-free.
</p></div>
</div>
</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"><p><small>Last revised: August 05, 2021 at 09:53:10 GMT</small></p></td>
-<td align="right"><div class="copyright-footer"></div></td>
-</tr></table>
+<div class="copyright-footer"></div>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="boost_lexical_cast/performance.html"><img src="../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="libraries.html"><img src="../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="index.html"><img src="../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="lockfree/examples.html"><img src="../../doc/src/images/next.png" alt="Next"></a>