File: Atomic_Operations.htm

package info (click to toggle)
tbb 4.2~20140122-5
  • links: PTS
  • area: main
  • in suites: jessie, jessie-kfreebsd
  • size: 21,492 kB
  • ctags: 21,278
  • sloc: cpp: 92,813; ansic: 9,775; asm: 1,070; makefile: 1,057; sh: 351; java: 226; objc: 98; pascal: 71; xml: 41
file content (388 lines) | stat: -rwxr-xr-x 12,726 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
<!DOCTYPE html
  PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<!-- saved from url=(0014)about:internet -->
<html xmlns:MSHelp="http://www.microsoft.com/MSHelp/" lang="en-us" xml:lang="en-us"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8">

<meta name="DC.Type" content="topic">
<meta name="DC.Title" content="Atomic Operations">
<meta name="DC.subject" content="Atomic Operations">
<meta name="keywords" content="Atomic Operations">
<meta name="DC.Relation" scheme="URI" content="../tbb_userguide/title.htm">
<meta name="DC.Relation" scheme="URI" content="../tbb_userguide/Why_atomic_T_Has_No_Constructors.htm">
<meta name="DC.Relation" scheme="URI" content="../tbb_userguide/Memory_Consistency.htm">
<meta name="DC.Format" content="XHTML">
<meta name="DC.Identifier" content="tutorial_Atomic_Operations">
<link rel="stylesheet" type="text/css" href="../intel_css_styles.css">
<title>Atomic Operations</title>
<xml>
<MSHelp:Attr Name="DocSet" Value="Intel"></MSHelp:Attr>
<MSHelp:Attr Name="Locale" Value="kbEnglish"></MSHelp:Attr>
<MSHelp:Attr Name="TopicType" Value="kbReference"></MSHelp:Attr>
</xml>
</head>
<body id="tutorial_Atomic_Operations">
 <!-- ==============(Start:NavScript)================= -->
 <script src="..\NavScript.js" language="JavaScript1.2" type="text/javascript"></script>
 <script language="JavaScript1.2" type="text/javascript">WriteNavLink(1);</script>
 <!-- ==============(End:NavScript)================= -->
<a name="tutorial_Atomic_Operations"><!-- --></a>

 
  <h1 class="topictitle1">Atomic Operations</h1>
 
  
  <div>
	 <p>You can avoid mutual exclusion using atomic operations. When a thread
		performs an atomic operation, the other threads see it as happening
		instantaneously. The advantage of atomic operations is that they are relatively
		quick compared to locks, and do not suffer from deadlock and convoying. The
		disadvantage is that they only do a limited set of operations, and often these
		are not enough to synthesize more complicated operations efficiently. But
		nonetheless you should not pass up an opportunity to use an atomic operation in
		place of mutual exclusion. Class 
		<samp class="codeph">atomic&lt;<var>T</var>&gt;</samp> implements atomic
		operations with C++ style.
	 </p>

	 <p>A classic use of atomic operations is for thread-safe reference
		counting. Suppose x is a reference count of type 
		<samp class="codeph">int</samp>, and the program needs to take some action when the
		reference count becomes zero. In single-threaded code, you could use a plain 
		<samp class="codeph">int</samp> for x, and write 
		<samp class="codeph">--x; if(x==0) action().</samp> But this method might fail for
		multithreaded code, because two threads might interleave their operations as
		shown in the following table, where t<sub>a</sub> and t<sub>b</sub> represent
		machine registers, and time progresses downwards:
	 </p>
 
	 
<div class="tablenoborder"><a name="tbl12"><!-- --></a><table cellpadding="4" summary="" id="tbl12" width="100%" frame="border" border="1" cellspacing="0" rules="all"><caption><span class="tablecap">Interleaving of Machine Instructions</span></caption> 
	 <thead align="left"> 
		<tr> 
		  <th class="cellrowborder" valign="top" width="53.92156862745098%" id="d126840e63">
			 <p>Thread A
			 </p>

		  </th>
 
		  <th class="cellrowborder" valign="top" width="46.07843137254902%" id="d126840e69">
			 <p>Thread B
			 </p>

		  </th>

		</tr>
</thead>
 
	 <tbody> 
		<tr> 
		  <td class="cellrowborder" valign="top" width="53.92156862745098%" headers="d126840e63 ">
			 <pre>t<sub>a</sub>  = x</pre>
		  </td>
 
		  <td class="cellrowborder" valign="top" width="46.07843137254902%" headers="d126840e69 ">
			 <pre>&nbsp;</pre>
		  </td>

		</tr>
 
		<tr> 
		  <td class="cellrowborder" valign="top" width="53.92156862745098%" headers="d126840e63 ">
			 <pre>&nbsp;</pre>
		  </td>
 
		  <td class="cellrowborder" valign="top" width="46.07843137254902%" headers="d126840e69 ">
			 <pre>t<sub>b</sub> = x</pre>
		  </td>

		</tr>
 
		<tr> 
		  <td class="cellrowborder" valign="top" width="53.92156862745098%" headers="d126840e63 ">
			 <pre>x = t<sub>a</sub> -<sub> </sub>1</pre>
		  </td>
 
		  <td class="cellrowborder" valign="top" width="46.07843137254902%" headers="d126840e69 ">
			 <pre>&nbsp;</pre>
		  </td>

		</tr>
 
		<tr> 
		  <td class="cellrowborder" valign="top" width="53.92156862745098%" headers="d126840e63 ">
			 <pre>&nbsp;</pre>
		  </td>
 
		  <td class="cellrowborder" valign="top" width="46.07843137254902%" headers="d126840e69 ">
			 <pre>x = t<sub>b</sub> –<sub> </sub>1</pre>
		  </td>

		</tr>
 
		<tr> 
		  <td class="cellrowborder" valign="top" width="53.92156862745098%" headers="d126840e63 ">
			 <pre>if( x==0 )</pre>
		  </td>
 
		  <td class="cellrowborder" valign="top" width="46.07843137254902%" headers="d126840e69 ">
			 <pre>&nbsp;</pre>
		  </td>

		</tr>
 
		<tr> 
		  <td class="cellrowborder" valign="top" width="53.92156862745098%" headers="d126840e63 ">
			 <pre>&nbsp;</pre>
		  </td>
 
		  <td class="cellrowborder" valign="top" width="46.07843137254902%" headers="d126840e69 ">
			 <pre>if( x==0 )</pre>
		  </td>

		</tr>

	 </tbody>

  </table>
</div>

  <p>Though the code intended for 
	 <samp class="codeph">x</samp> to be decremented twice, it ends up with only one less
	 than its original value. Also, another problem results because the test of 
	 <var>x</var> is separate from the decrement: If 
	 <var>x</var> starts out as two, and both threads decrement 
	 <var>x</var> before either thread evaluates the 
	 <samp class="codeph">if</samp> condition, 
	 <em>both</em> threads would call 
	 <samp class="codeph">action()</samp>. To correct this problem, you need to ensure that
	 only one thread at a time does the decrement 
	 <em>and</em> ensure that the value checked by the "if" is the result of the
	 decrement. You can do this by introducing a mutex, but it is much faster and
	 simpler to declare 
	 <var>x</var> as 
	 <samp class="codeph">atomic&lt;int&gt;</samp> and write
	 "<samp class="codeph">if(--<var>x</var>==0) action()</samp>". The method 
	 <samp class="codeph">atomic&lt;int&gt;::operator--</samp> acts atomically; no other
	 thread can interfere.
  </p>

  <p><samp class="codeph">atomic&lt;<var>T</var>&gt;</samp> supports atomic
	 operations on type 
	 <var>T</var>, which must be an integral, enumeration, or pointer
	 type. There are five fundamental operations supported, with additional
	 interfaces in the form of overloaded operators for syntactic convenience. For
	 example, 
	 <samp class="codeph">++</samp>, 
	 <samp class="codeph">--</samp>, 
	 <samp class="codeph">-=</samp>, and 
	 <samp class="codeph">+=</samp> operations on 
	 <samp class="codeph">atomic&lt;<var>T</var>&gt;</samp> are all forms of the
	 fundamental operation 
	 <em>fetch-and-add</em>. The following are the five fundamental operations on
	 a variable 
	 <var>x</var> of type 
	 <samp class="codeph">atomic&lt;<var>T</var>&gt;</samp>.
  </p>
 
  
<div class="tablenoborder"><a name="tbl13"><!-- --></a><table cellpadding="4" summary="" id="tbl13" width="100%" frame="border" border="1" cellspacing="0" rules="all"><caption><span class="tablecap">Fundamental Operations on a Variable x of Type atomic&lt;T&gt;</span></caption> 
	 <tbody> 
		<tr> 
		  <td class="cellrowborder" valign="top" width="30%">
			 <p><samp class="codeph">= 
				  <var>x</var></samp>
			 </p>

		  </td>
 
		  <td class="cellrowborder" valign="top" width="70%">
			 <p>read the value of 
				<var>x</var>
			 </p>

		  </td>

		</tr>
 
		<tr> 
		  <td class="cellrowborder" valign="top" width="30%">
			 <p><samp class="codeph"><var>x</var>=</samp>
			 </p>

		  </td>
 
		  <td class="cellrowborder" valign="top" width="70%">
			 <p>write the value of 
				<var>x</var>, and return it
			 </p>

		  </td>

		</tr>
 
		<tr> 
		  <td class="cellrowborder" valign="top" width="30%">
			 <p><samp class="codeph"><var>x</var>.fetch_and_store(y)</samp>
			 </p>

		  </td>
 
		  <td class="cellrowborder" valign="top" width="70%">
			 <p>do 
				<samp class="codeph"><var>x</var>=<var>y</var></samp> and
				return the old value of 
				<var>x</var>
			 </p>

		  </td>

		</tr>
 
		<tr> 
		  <td class="cellrowborder" valign="top" width="30%">
			 <p><samp class="codeph"><var>x</var>.fetch_and_add(<var>y</var>)</samp>
			 </p>

		  </td>
 
		  <td class="cellrowborder" valign="top" width="70%">
			 <p>do 
				<samp class="codeph"><var>x</var>+=<var>y</var></samp> and
				return the old value of 
				<var>x</var>
			 </p>

		  </td>

		</tr>
 
		<tr> 
		  <td class="cellrowborder" valign="top" width="30%">
			 <p><samp class="codeph"><var>x</var>.compare_and_swap(<var>y</var>,<var>z</var>)</samp>
			 </p>

		  </td>
 
		  <td class="cellrowborder" valign="top" width="70%">
			 <p>if 
				<var>x</var> equals 
				<var>z</var>, then do 
				<samp class="codeph"><var>x</var>=<var>y</var></samp>. In
				either case, return old value of 
				<var>x</var>.
			 </p>

		  </td>

		</tr>

	 </tbody>

  </table>
</div>

  <p>Because these operations happen atomically, they can be used safely
	 without mutual exclusion. Consider the following example:
  </p>

  <pre>atomic&lt;unsigned&gt; counter;
&nbsp;
unsigned GetUniqueInteger() {
    return counter.fetch_and_add(1);
}</pre>
  <p>The routine 
	 <samp class="codeph">GetUniqueInteger</samp> returns a different integer each time it
	 is called, until the counter wraps around. This is true no matter how many
	 threads call 
	 <samp class="codeph">GetUniqueInteger</samp> simultaneously. 
  </p>

  <p>The operation 
	 <samp class="codeph">compare_and_swap</samp> is a fundamental operation to many
	 non-blocking algorithms. A problem with mutual exclusion is that if a thread
	 holding a lock is suspended, all other threads are blocked until the holding
	 thread resumes. Non-blocking algorithms avoid this problem by using atomic
	 operations instead of locking. They are generally complicated and require
	 sophisticated analysis to verify. However, the following idiom is
	 straightforward and worth knowing. It updates a shared variable 
	 <samp class="codeph">globalx</samp> in a way that is somehow based on its old value:
  </p>

  <pre>atomic&lt;int&gt; globalx;
&nbsp;
int UpdateX() {      // Update x and return old value of x.
    do {
        // Read globalX
        oldx = globalx;
        // Compute new value 
        newx = ...expression involving oldx....
        // Store new value if another thread has not changed globalX.
    } while( globalx.compare_and_swap(newx,oldx)!=oldx );
    return oldx;
}</pre>
  <p>Worse, some threads iterate the loop until no other thread interferes.
	 Typically, if the update takes only a few instructions, the idiom is faster
	 than the corresponding mutual-exclusion solution. 
  </p>

  <div class="Note"><h3 class="NoteTipHead">
					Caution</h3>
	 <p>If the following sequence thwarts your intent, then the update idiom is
		inappropriate:
	 </p>
 
	 <ol>
		<li>
		  <p>A thread reads a value 
			 <var>A</var> from 
			 <samp class="codeph">globalx</samp>
		  </p>

		</li>

		<li>
		  <p>Other threads change 
			 <samp class="codeph">globalx</samp> from 
			 <var>A</var> to 
			 <var>B</var> to 
			 <var>A</var>
		  </p>

		</li>

		<li>
		  <p>The thread in step 1 does its 
			 <samp class="codeph">compare_and_swap</samp>, reading 
			 <var>A</var> and thus not detecting the intervening change to
			 
			 <var>B</var>. 
		  </p>

		</li>

	 </ol>

  </div>
  <p>The problem is called the 
	 <em>ABA</em> 
	 <em>problem</em>. It is frequently a problem in designing non-blocking
	 algorithms for linked data structures. See the Internet for more information.
  </p>

  </div>


<div class="familylinks">
<div class="parentlink"><strong>Parent topic:</strong>&nbsp;<a href="../tbb_userguide/title.htm">Intel&reg; Threading Building Blocks (Intel&reg; TBB) User Guide</a></div>
</div>
<div>
<ul class="ullinks">
<li class="ulchildlink"><a href="../tbb_userguide/Why_atomic_T_Has_No_Constructors.htm">Why atomic&lt;T&gt; Has No Constructors in C++03 mode</a><br>
</li>
<li class="ulchildlink"><a href="../tbb_userguide/Memory_Consistency.htm">Memory Consistency</a><br>
</li>
</ul>
</div>

</body>
</html>