Concurrent programming: algorithms, principles, and foundations:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2013
|
| Schlagworte: | |
| Online-Zugang: | Inhaltstext Inhaltsverzeichnis |
| Beschreibung: | XXXII, 515 S. graph. Darst. |
| ISBN: | 9783642320262 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV040522382 | ||
| 003 | DE-604 | ||
| 005 | 20221026 | ||
| 007 | t | ||
| 008 | 121106s2013 gw d||| |||| 00||| eng d | ||
| 015 | |a 12,N27 |2 dnb | ||
| 016 | 7 | |a 1023814544 |2 DE-101 | |
| 020 | |a 9783642320262 |c Gb. : ca. EUR 48.10 (DE) (freier Pr.), ca. EUR 49.50 (AT) (freier Pr.), ca. sfr 60.00 (freier Pr.) |9 978-3-642-32026-2 | ||
| 024 | 3 | |a 9783642320262 | |
| 028 | 5 | 2 | |a Best.-Nr.: 86096024 |
| 035 | |a (OCoLC)820380494 | ||
| 035 | |a (DE-599)DNB1023814544 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE-BE | ||
| 049 | |a DE-473 |a DE-739 |a DE-91G |a DE-384 |a DE-19 |a DE-634 |a DE-83 |a DE-526 |a DE-11 | ||
| 082 | 0 | |a 005.275 |2 22/ger | |
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a ST 230 |0 (DE-625)143617: |2 rvk | ||
| 084 | |a ST 234 |0 (DE-625)143621: |2 rvk | ||
| 084 | |a DAT 516f |2 stub | ||
| 084 | |a 004 |2 sdnb | ||
| 100 | 1 | |a Raynal, Michel |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Concurrent programming: algorithms, principles, and foundations |c Michel Raynal |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2013 | |
| 300 | |a XXXII, 515 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 0 | 7 | |a Objekt |g Informatik |0 (DE-588)4197181-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Synchronisierung |0 (DE-588)4130847-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Atomarität |g Informatik |0 (DE-588)4704497-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Wechselseitiger Ausschluss |0 (DE-588)4373478-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Programmierung |0 (DE-588)4076370-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Nebenläufigkeit |0 (DE-588)4115352-2 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Nebenläufigkeit |0 (DE-588)4115352-2 |D s |
| 689 | 0 | 1 | |a Programmierung |0 (DE-588)4076370-5 |D s |
| 689 | 0 | 2 | |a Synchronisierung |0 (DE-588)4130847-5 |D s |
| 689 | 0 | 3 | |a Wechselseitiger Ausschluss |0 (DE-588)4373478-9 |D s |
| 689 | 0 | 4 | |a Objekt |g Informatik |0 (DE-588)4197181-4 |D s |
| 689 | 0 | 5 | |a Atomarität |g Informatik |0 (DE-588)4704497-4 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |D s |
| 689 | 1 | |8 1\p |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-3-642-32027-9 |
| 856 | 4 | 2 | |m X:MVB |q text/html |u http://deposit.dnb.de/cgi-bin/dokserv?id=4068260&prov=M&dok_var=1&dok_ext=htm |3 Inhaltstext |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=025368654&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-025368654 | |
Datensatz im Suchindex
| _version_ | 1807954207664242688 |
|---|---|
| adam_text |
IMAGE 1
CONTENTS
PART I LOCK-BASED SYNCHRONIZATION 1 THE MUTUAL EXCLUSION PROBLEM 3
1.1 MULTIPROCESS PROGRAM 3
1.1.1 THE CONCEPT OF A SEQUENTIAL PROCESS 3
1.1.2 THE CONCEPT OF A MULTIPROCESS PROGRAM 4
1.2 PROCESS SYNCHRONIZATION 4
1.2.1 PROCESSORS AND PROCESSES 4
1.2.2 SYNCHRONIZATION 4
1.2.3 SYNCHRONIZATION: COMPETITION 5
1.2.4 SYNCHRONIZATION: COOPERATION 7
1.2.5 THE AIM O F SYNCHRONIZATION IS TO PRESERVE INVARIANTS 7
1.3 THE MUTUAL EXCLUSION PROBLEM 9
1.3.1 THE MUTUAL EXCLUSION PROBLEM (MUTEX) 9
1.3.2 LOCK OBJECT 11
1.3.3 THREE FAMILIES O F SOLUTIONS 12
1.4 SUMMARY 13
1.5 BIBLIOGRAPHIC NOTES 13
2 SOLVING MUTUAL EXCLUSION 15
2.1 MUTEX BASED ON ATOMIC READ/WRITE REGISTERS 15
2.1.1 -ATOMIC REGISTER 15
2.1.2 MUTEX FOR TWO PROCESSES: AN INCREMENTAL CONSTRUCTION 17
2.1.3 A TWO-PROCESS ALGORITHM 19
2.1.4 MUTEX FOR N PROCESSES: GENERALIZING THE PREVIOUS TWO-PROCESS
ALGORITHM. . . 22 2.1.5 MUTEX FOR N PROCESSES: A TOURNAMENT-BASED
ALGORITHM 2 6
2.1.6 A CONCURRENCY-ABORTABLE ALGORITHM 29
X I
HTTP://D-NB.INFO/1023814544
IMAGE 2
XII C O N T E N T S
2.1.7 A FAST MUTEX ALGORITHM 33
2.1.8 MUTUAL EXCLUSION IN A SYNCHRONOUS SYSTEM 37
2.2 MUTEX BASED ON SPECIALIZED HARDWARE PRIMITIVES 38
2.2.1 TEST&SET, SWAP AND COMPARE&SWAP 39
2.2.2 FROM DEADLOCK-FREEDOM TO STARVATION-FREEDOM. . . . 40 2.2.3
FETCH&ADD 44
2.3 MUTEX WITHOUT ATOMICITY 45
2.3.1 SAFE, REGULAR AND ATOMIC REGISTERS 45
2.3.2 THE BAKERY MUTEX ALGORITHM 48
2.3.3 A BOUNDED MUTEX ALGORITHM 53
2.4 SUMMARY 58
2.5 BIBLIOGRAPHIC NOTES 58
2.6 EXERCISES AND PROBLEMS 59
3 LOCK-BASED CONCURRENT OBJECTS 61
3.1 CONCURRENT OBJECTS 61
3.1.1 CONCURRENT OBJECT 61
3.1.2 LOCK-BASED IMPLEMENTATION 62
3.2 A BASE SYNCHRONIZATION OBJECT: THE SEMAPHORE 63
3.2.1 THE CONCEPT O F A SEMAPHORE 63
3.2.2 USING SEMAPHORES TO SOLVE THE PRODUCER-CONSUMER PROBLEM 65
3.2.3 USING SEMAPHORES TO SOLVE A PRIORITY SCHEDULING PROBLEM 71
3.2.4 USING SEMAPHORES TO SOLVE THE READERS-WRITERS PROBLEM 74
3.2.5 USING A BUFFER TO REDUCE DELAYS FOR READERS AND WRITERS 78
3.3 A CONSTRUCT FOR IMPERATIVE LANGUAGES: THE MONITOR 81
3.3.1 THE CONCEPT O F A MONITOR 82
3.3.2 A RENDEZVOUS MONITOR OBJECT 83
3.3.3 MONITORS AND PREDICATES 85
3.3.4 IMPLEMENTING A MONITOR FROM SEMAPHORES 87
3.3.5 MONITORS FOR THE READERS-WRITERS PROBLEM 89
3.3.6 SCHEDULED WAIT OPERATION . 94
3.4 DECLARATIVE SYNCHRONIZATION: PATH EXPRESSIONS 95
3.4.1 DEFINITION 96
3.4.2 USING PATH EXPRESSIONS TO SOLVE SYNCHRONIZATION PROBLEMS 97
3.4.3 A SEMAPHORE-BASED IMPLEMENTATION O F PATH EXPRESSIONS '. 98
3.5 SUMMARY 101
3.6 BIBLIOGRAPHIC NOTES 102
3.7 EXERCISES AND PROBLEMS 102
IMAGE 3
C O N T E N T S XIII
PART II ON THE FOUNDATIONS SIDE: THE ATOMICITY CONCEPT
4 ATOMICITY: FORMAL DEFINITION AND PROPERTIES 113
4.1 INTRODUCTION 113
4.2 COMPUTATION MODEL 115
4.2.1 PROCESSES AND OPERATIONS 115
4.2.2 OBJECTS 116
4.2.3 HISTORIES 117
4.2.4 SEQUENTIAL HISTORY 119
4.3 ATOMICITY 120
4.3.1 LEGAL HISTORY 120
4.3.2 THE CASE O F COMPLETE HISTORIES 121
4.3.3 THE CASE O F PARTIAL HISTORIES 123
4.4 OBJECT COMPOSABILITY AND GUARANTEED TERMINATION PROPERTY 125
4.4.1 ATOMIC OBJECTS COMPOSE FOR FREE 125
4.4.2 GUARANTEED TERMINATION 127
4.5 ALTERNATIVES TO ATOMICITY 128
4.5.1 SEQUENTIAL CONSISTENCY 128
4.5.2 SERIALIZABILITY 130
4.6 SUMMARY 131
4.7 BIBLIOGRAPHIC NOTES 132
PART III MUTEX-FREE SYNCHRONIZATION
5 MUTEX-FREE CONCURRENT OBJECTS 135
5.1 MUTEX-FREEDOM AND PROGRESS CONDITIONS 135
5.1.1 THE MUTEX-FREEDOM NOTION 135
5.1.2 PROGRESS CONDITIONS 137
5.1.3 NON-BLOCKING WITH RESPECT TO WAIT-FREEDOM 140
5.2 MUTEX-FREE CONCURRENT OBJECTS 140
5.2.1 THE SPLITTER: A SIMPLE WAIT-FREE OBJECT FROM READ/WRITE REGISTERS
140
5.2.2 A SIMPLE OBSTRUCTION-FREE OBJECT FROM READ/WRITE REGISTERS 143
5.2.3 A REMARK ON COMPARE&SWAP: THE ABA PROBLEM. . . 145 5.2.4 A
NON-BLOCKING QUEUE BASED ON READ/WRITE REGISTERS AND COMPARE&SWAP 146
5.2.5 A NON-BLOCKING STACK BASED ON COMPARE&SWAP REGISTERS 150
5.2.6 A WAIT-FREE STACK BASED ON FETCH&ADD AND SWAP REGISTERS 152
IMAGE 4
X I V
C O N T E N T S
5.3 BOOSTING OBSTRUCTION-FREEDOM TO STRONGER PROGRESS
IN THE READ/WRITE MODEL 155
5.3.1 FAILURE DETECTORS 155
5.3.2 CONTENTION MANAGERS FOR OBSTRUCTION-FREE OBJECT IMPLEMENTATIONS
157
5.3.3 BOOSTING OBSTRUCTION-FREEDOM TO NON-BLOCKING . . . . 158 5.3.4
BOOSTING OBSTRUCTION-FREEDOM TO WAIT-FREEDOM . . . 159 5.3.5
MUTEX-FREEDOM VERSUS LOOPS INSIDE A CONTENTION MANAGER OPERATION 161
5.4 SUMMARY 162
5.5 BIBLIOGRAPHIC NOTES 162
5.6 EXERCISES AND PROBLEMS 163
6 HYBRID CONCURRENT OBJECTS 165
6.1 THE NOTION OF A HYBRID IMPLEMENTATION 165
6.1.1 LOCK-BASED VERSUS MUTEX-FREE OPERATION: STATIC HYBRID
IMPLEMENTATION 166
6.1.2 CONTENTION SENSITIVE (OR DYNAMIC HYBRID) IMPLEMENTATION 166
6.1.3 THE CASE O F PROCESS CRASHES 166
6.2 A STATIC HYBRID IMPLEMENTATION OF A CONCURRENT SET OBJECT . . . 167
6.2.1 DEFINITION AND ASSUMPTIONS 167
6.2.2 INTERNAL REPRESENTATION AND OPERATION IMPLEMENTATION 167
6.2.3 PROPERTIES OF THE IMPLEMENTATION . . . 171
6.3 CONTENTION-SENSITIVE IMPLEMENTATIONS 172
6.3.1 CONTENTION-SENSITIVE BINARY CONSENSUS 172
6.3.2 A CONTENTION SENSITIVE NON-BLOCKING DOUBLE-ENDED QUEUE 176
6.4 THE NOTION O F AN ABORTABLE OBJECT 181
6.4.1 CONCURRENCY-ABORTABLE OBJECT 181
6.4.2 FROM A NON-BLOCKING ABORTABLE OBJECT TO A STARVATION-FREE OBJECT
183
6.5 SUMMARY 186
6.6 BIBLIOGRAPHIC NOTES 186
6.7 EXERCISES AND PROBLEMS 187
7 WAIT-FREE OBJECTS FROM READ/WRITE REGISTERS ONLY 189
7.1 A WAIT-FREE WEAK COUNTER FOR INFINITELY MANY PROCESSES. . . 189
7.1.1 A SIMPLE COUNTER OBJECT 190
7.1.2 WEAK COUNTER OBJECT FOR INFINITELY MANY PROCESSES. . . 191 7.1.3 A
ONE-SHOT WEAK COUNTER WAIT-FREE ALGORITHM . . . 193 7.1.4 PROOF OF THE
ONE-SHOT IMPLEMENTATION 194
7.1.5 A MULTI-SHOT W E A K COUNTER WAIT-FREE ALGORITHM . . . 199
IMAGE 5
C O N T E N T S X V
7.2 STORE-COLLECT OBJECT 201
7.2.1 STORE-COLLECT OBJECT: DEFINITION 201
7.2.2 AN ADAPTIVE STORE-COLLECT IMPLEMENTATION 204
7.2.3 PROOF AND COST OF THE ADAPTIVE IMPLEMENTATION . . . . 208
7.3 FAST STORE-COLLECT OBJECT 211
7.3.1 FAST STORE-COLLECT OBJECT: DEFINITION 211
7.3.2 A FAST ALGORITHM FOR THE STORE_COLLECT() O P E R A T I O N . . .
212 7.3.3 PROOF O F THE FAST STORE-COLLECT ALGORITHM 215
7.4 SUMMARY 217
7.5 BIBLIOGRAPHIC NOTES 217
7.6 PROBLEM 218
8 SNAPSHOT OBJECTS FROM READ/WRITE REGISTERS ONLY 219
8.1 SNAPSHOT OBJECTS: DEFINITION 219
8.2 SINGLE-WRITER SNAPSHOT OBJECT 220
8.2.1 AN OBSTRUCTION-FREE IMPLEMENTATION 221
8.2.2 FROM OBSTRUCTION-FREEDOM TO BOUNDED WAIT-FREEDOM 223
8.2.3 ONE-SHOT SINGLE-WRITER SNAPSHOT OBJECT: CONTAINMENT PROPERTY 227
8.3 SINGLE-WRITER SNAPSHOT OBJECT WITH INFINITELY MANY PROCESSES 228
8.4 MULTI-WRITER SNAPSHOT OBJECT 230
8.4.1 THE STRONG FRESHNESS PROPERTY 231
8.4.2 AN IMPLEMENTATION OF A MULTI-WRITER SNAPSHOT OBJECT 231
8.4.3 PROOF OF THE IMPLEMENTATION 234
8.5 IMMEDIATE SNAPSHOT OBJECTS 238
8.5.1 ONE-SHOT IMMEDIATE SNAPSHOT OBJECT: DEFINITION. . . 238 8.5.2
ONE-SHOT IMMEDIATE SNAPSHOT VERSUS ONE-SHOT SNAPSHOT 238
8.5.3 AN IMPLEMENTATION OF ONE-SHOT IMMEDIATE SNAPSHOT OBJECTS 240
8.5.4 A RECURSIVE IMPLEMENTATION OF A ONE-SHOT IMMEDIATE SNAPSHOT OBJECT
244
8.6 SUMMARY 247
8.7 BIBLIOGRAPHIC NOTES 247
8.8 PROBLEM 248
IMAGE 6
X V J C O N T E N T S
9 RENAMING OBJECTS FROM READ/WRITE REGISTERS ONLY 249
9.1 RENAMING OBJECTS 249
9.1.1 THE BASE RENAMING PROBLEM 249
9.1.2 ONE-SHOT RENAMING OBJECT 250
9.1.3 ADAPTIVE IMPLEMENTATIONS 250
9.1.4 A FUNDAMENTAL RESULT 251
9.1.5 LONG-LIVED RENAMING 252
9.2 NON-TRIVIALITY OF THE RENAMING PROBLEM 252
9.3 A SPLITTER-BASED OPTIMAL TIME-ADAPTIVE IMPLEMENTATION . . . 254 9.4
A SNAPSHOT-BASED OPTIMAL SIZE-ADAPTIVE IMPLEMENTATION. . . 256 9.4.1 A
SNAPSHOT-BASED IMPLEMENTATION 256
9.4.2 PROOF OF THE IMPLEMENTATION 258
9.5 RECURSIVE STORE-COLLECT-BASED SIZE-ADAPTIVE IMPLEMENTATION 259
9.5.1 A RECURSIVE RENAMING ALGORITHM 259
9.5.2 AN EXAMPLE 262
9.5.3 PROOF OF THE RENAMING IMPLEMENTATION 263
9.6 VARIANT OF THE PREVIOUS RECURSION-BASED RENAMING ALGORITHM 266
9.6.1 A RENAMING IMPLEMENTATION BASED ON IMMEDIATE SNAPSHOT OBJECTS 266
9.6.2 AN EXAMPLE O F A RENAMING EXECUTION 268
9.7 LONG-LIVED PERFECT RENAMING BASED ON TEST&SET REGISTERS 269
9.7.1 PERFECT ADAPTIVE RENAMING 269
9.7.2 PERFECT LONG-LIVED TEST&SET-BASED RENAMING . . . . 270
9.8 SUMMARY 271
9.9 BIBLIOGRAPHIC NOTES 271
9.10 EXERCISES AND PROBLEMS 272
PART IV THE TRANSACTIONAL MEMORY APPROACH
10 TRANSACTIONAL MEMORY 277
10.1 WHAT ARE SOFTWARE TRANSACTIONAL MEMORIES 277
10.1.1 TRANSACTIONS = HIGH-LEVEL SYNCHRONIZATION 277
10.1.2 AT THE PROGRAMMING LEVEL 279
10.2 STM SYSTEM 281
10.2.1 SPECULATIVE EXECUTIONS, COMMIT AND ABORT OF A TRANSACTION 281
10.2.2 AN STM CONSISTENCY CONDITION: OPACITY 282
10.2.3 AN STM INTERFACE 282
10.2.4 INCREMENTAL READS AND DEFERRED UPDATES 283
IMAGE 7
C O N T E N T S
XVLL
10.2.5 READ-ONLY VERSUS UPDATE TRANSACTIONS 283
10.2.6 READ INVISIBILITY 284
10.3 A LOGICAL CLOCK-BASED STM SYSTEM: TL2 284
10.3.1 UNDERLYING SYSTEM AND CONTROL VARIABLES OF THE STM SYSTEM 284
10.3.2 UNDERLYING PRINCIPLE: CONSISTENCY WITH RESPECT TO TRANSACTION
BIRTH DATE 285
10.3.3 THE IMPLEMENTATION OF AN UPDATE TRANSACTION 286
10.3.4 THE IMPLEMENTATION OF A READ-ONLY TRANSACTION . . . 288 10.4 A
VERSION-BASED STM SYSTEM: JVSTM 289
10.4.1 UNDERLYING AND CONTROL VARIABLES O F THE STM SYSTEM 290
10.4.2 THE IMPLEMENTATION OF AN UPDATE TRANSACTION 291
10.4.3 THE IMPLEMENTATION OF A READ-ONLY TRANSACTION . . . 293 10.5 A
VECTOR CLOCK-BASED STM SYSTEM 293
10.5.1 THE VIRTUAL WORLD CONSISTENCY CONDITION 293
10.5.2 AN STM SYSTEM FOR VIRTUAL WORLD CONSISTENCY. . . . 295 10.5.3 THE
ALGORITHMS IMPLEMENTING THE STM OPERATIONS 296
10.6 SUMMARY 299
10.7 BIBLIOGRAPHIC NOTES 299
10.8 EXERCISES AND PROBLEMS 300
PART V ON THE FOUNDATIONS SIDE: FROM SAFE BITS TO ATOMIC REGISTERS
11 SAFE, REGULAR, AND ATOMIC READ/WRITE REGISTERS 305
11.1 SAFE, REGULAR, AND ATOMIC REGISTERS 305
11.1.1 REMINDER: THE MANY FACES OF A REGISTER 305
11.1.2 FROM REGULARITY TO ATOMICITY: A THEOREM 308
11.1.3 A FUNDAMENTAL PROBLEM: THE CONSTRUCTION O F REGISTERS 310
11.2 TWO VERY SIMPLE BOUNDED CONSTRUCTIONS 311
11.2.1 SAFE/REGULAR REGISTERS: FROM SINGLE-READER TO MULTI-READER 311
11.2.2 BINARY MULTI-READER REGISTERS: FROM SAFE TO REGULAR 313
11.3 FROM BITS TO B-VALUED REGISTERS 314
11.3.1 FROM SAFE BITS TO ^-VALUED SAFE REGISTERS 314
11.3.2 FROM REGULAR BITS TO REGULAR -VALUED REGISTERS. . . 315 I 1.3.3
FROM ATOMIC BITS TO ATOMIC /^-VALUED REGISTERS . . . 319
IMAGE 8
XVIII C O N T E N T S
11.4 THREE UNBOUNDED CONSTRUCTIONS 321
11.4.1 SWSR REGISTERS: FROM UNBOUNDED REGULAR TO ATOMIC 322
11.4.2 ATOMIC REGISTERS: FROM UNBOUNDED SWSR TO SWMR 324
11.4.3 ATOMIC REGISTERS: FROM UNBOUNDED SWMR TO M W M R 325
11.5 SUMMARY 327
11.6 BIBLIOGRAPHIC NOTES 327
12 FROM SAFE BITS TO ATOMIC BITS: LOWER BOUND AND OPTIMAL CONSTRUCTION
329
12.1 A LOWER BOUND THEOREM 329
12.1.1 TWO PRELIMINARY LEMMAS 330
12.1.2 THE LOWER BOUND THEOREM 331
12.2 A CONSTRUCTION OF AN ATOMIC BIT FROM THREE SAFE BITS 334
12.2.1 BASE ARCHITECTURE OF THE CONSTRUCTION 334
12.2.2 UNDERLYING PRINCIPLE AND SIGNALING SCHEME 335
12.2.3 THE ALGORITHM IMPLEMENTING THE OPERATION R. WRITE() 336
12.2.4 THE ALGORITHM IMPLEMENTING THE OPERATION /?.READ() 336
12.2.5 COST OF THE CONSTRUCTION 338
12.3 PROOF OF THE CONSTRUCTION OF AN ATOMIC BIT 338
12.3.1 A PRELIMINARY THEOREM 338
12.3.2 PROOF OF THE CONSTRUCTION 340
12.4 SUMMARY 344
12.5 BIBLIOGRAPHIC NOTES 345
12.6 EXERCISE 345
13 BOUNDED CONSTRUCTIONS O F ATOMIC B- VALUED REGISTERS 347
13.1 INTRODUCTION 347
13.2 A COLLISION-FREE (PURE BUFFERS) CONSTRUCTION 349
13.2.1 INTERNAL REPRESENTATION OF THE ATOMIC ^-VALUED REGISTER R 349
13.2.2 UNDERLYING PRINCIPLE: TWO-LEVEL SWITCH TO ENSURE COLLISION-FREE
ACCESSES TO BUFFERS 349
13.2.3 THE ALGORITHMS IMPLEMENTING THE OPERATIONS R. WRITE() AND
/?.READ() 350
13.2.4 PROOF OF THE CONSTRUCTION: COLLISION-FREEDOM 352
13.2.5 CORRECTNESS PROOF 355
13.3 A CONSTRUCTION BASED ON IMPURE BUFFERS 357
13.3.1 INTERNAL REPRESENTATION O F THE ATOMIC /;-VALUED REGISTER R 357
IMAGE 9
C O N T E N T S X I X
13.3.2 AN INCREMENTAL CONSTRUCTION 358
13.3.3 THE ALGORITHMS IMPLEMENTING THE OPERATIONS /?.WRITE() AND
/?.READ() 360
13.3.4 PROOF OF THE CONSTRUCTION 360
13.3.5 FROM SWSR TO SWMR ^-VALUED ATOMIC REGISTER 367
13.4 SUMMARY 368
13.5 BIBLIOGRAPHIC NOTES 368
PART VI ON THE FOUNDATIONS SIDE: THE COMPUTABILITY POWER O F CONCURRENT
OBJECTS (CONSENSUS)
14 UNIVERSALITY O F CONSENSUS 371
14.1 UNIVERSAL OBJECT, UNIVERSAL CONSTRUCTION, AND CONSENSUS OBJECT 371
14.1.1 UNIVERSAL (SYNCHRONIZATION) OBJECT AND UNIVERSAL CONSTRUCTION 371
14.1.2 THE NOTION O F A CONSENSUS OBJECT 372
14.2 INPUTS AND BASE PRINCIPLES O F UNIVERSAL CONSTRUCTIONS 373
14.2.1 THE SPECIFICATION OF THE CONSTRUCTED OBJECT 373
14.2.2 BASE PRINCIPLES OF UNIVERSAL CONSTRUCTIONS 374
14.3 AN UNBOUNDED WAIT-FREE UNIVERSAL CONSTRUCTION 374
14.3.1 PRINCIPLES AND DESCRIPTION O F THE CONSTRUCTION 375
14.3.2 PROOF O F THE CONSTRUCTION 378
14.3.3 NON-DETERMINISTIC OBJECTS 382
14.3.4 WAIT-FREEDOM VERSUS BOUNDED WAIT-FREEDOM 383 14.4 A BOUNDED
WAIT-FREE UNIVERSAL CONSTRUCTION 384
14.4.1 PRINCIPLES O F THE CONSTRUCTION 384
14.4.2 PROOF OF THE CONSTRUCTION 388
14.4.3 NON-DETERMINISTIC OBJECTS 391
14.5 FROM BINARY CONSENSUS TO MULTI-VALUED CONSENSUS 391
14.5.1 A CONSTRUCTION BASED ON THE BIT REPRESENTATION OF PROPOSED VALUES
392
14.5.2 A CONSTRUCTION FOR UNBOUNDED PROPOSED VALUES . . . 394 14.6
SUMMARY 395
14.7 BIBLIOGRAPHIC NOTES 396
14.8 EXERCISES AND PROBLEMS 396
15 THE CASE O F UNRELIABLE BASE OBJECTS 399
15.1 RESPONSIVE VERSUS NON-RESPONSIVE CRASH FAILURES 400
15.2 SWSR REGISTERS PRONE TO CRASH FAILURES 400
15.2.1 RELIABLE REGISTER WHEN CRASH FAILURES ARE RESPONSIVE: AN
UNBOUNDED CONSTRUCTION 401
IMAGE 10
X X
C O N T E N T S
15.2.2 RELIABLE REGISTER WHEN CRASH FAILURES ARE
RESPONSIVE: A BOUNDED CONSTRUCTION 403
15.2.3 RELIABLE REGISTER WHEN CRASH FAILURES ARE NOT RESPONSIVE: AN
UNBOUNDED CONSTRUCTION 406
15.3 CONSENSUS WHEN CRASH FAILURES ARE RESPONSIVE: A BOUNDED
CONSTRUCTION 408
15.3.1 THE "PARALLEL INVOCATION" APPROACH DOES NOT WORK 408
15.3.2 A /-TOLERANT WAIT-FREE CONSTRUCTION 409
15.3.3 CONSENSUS WHEN CRASH FAILURES ARE NOT RESPONSIVE: AN
IMPOSSIBILITY 410
15.4 OMISSION AND ARBITRARY FAILURES 410
15.4.1 OBJECT FAILURE MODES 410
15.4.2 SIMPLE EXAMPLES 412
15.4.3 GRACEFUL DEGRADATION 413
15.4.4 FAULT-TOLERANCE VERSUS GRACEFUL DEGRADATION 417
15.5 SUMMARY 418
15.6 BIBLIOGRAPHIC NOTES 419
15.7 EXERCISES AND PROBLEMS 419
16 CONSENSUS NUMBERS AND THE CONSENSUS HIERARCHY 421
16.1 THE CONSENSUS NUMBER NOTION 421
16.2 FUNDAMENTALS 422
16.2.1 SCHEDULE, CONFIGURATION, AND VALENCE 422
16.2.2 BIVALENT INITIAL CONFIGURATION 423
16.3 THE WEAK WAIT-FREE POWER O F ATOMIC REGISTERS 425
16.3.1 THE CONSENSUS NUMBER O F ATOMIC READ/WRITE REGISTERS IS 1 425
16.3.2 THE WAIT-FREE LIMIT O F ATOMIC REGISTERS 428
16.4 OBJECTS WHOSE CONSENSUS NUMBER IS 2 429
16.4.1 CONSENSUS FROM TEST&SET OBJECTS 429
16.4.2 CONSENSUS FROM QUEUE OBJECTS 431
16.4.3 CONSENSUS FROM SWAP OBJECTS 432
16.4.4 OTHER OBJECTS FOR WAIT-FREE CONSENSUS IN A SYSTEM OF TWO
PROCESSES 432
16.4.5 POWER AND LIMIT OF THE PREVIOUS OBJECTS 433
16.5 OBJECTS WHOSE CONSENSUS NUMBER IS + O O 438
16.5.1 CONSENSUS FROM COMPARE&SWAP OBJECTS 439
16.5.2 CONSENSUS FROM MEM-TO-MEM-SWAP OBJECTS 440
16.5.3 CONSENSUS FROM AN AUGMENTED QUEUE 442
16.5.4 FROM A STICKY BIT TO BINARY CONSENSUS 442
16.5.5 IMPOSSIBILITY RESULT 443
IMAGE 11
C O N T E N T S X X I
16.6 HIERARCHY O F ATOMIC OBJECTS 443
16.6.1 FROM CONSENSUS NUMBERS TO A HIERARCHY 443
16.6.2 ON FAULT MASKING 444
16.6.3 ROBUSTNESS O F THE HIERARCHY 445
16.7 SUMMARY 445
16.8 BIBLIOGRAPHIC NOTES 445
16.9 EXERCISES AND PROBLEMS 446
17 THE ALPHA(S) AND OMEGA O F CONSENSUS: FAILURE DETECTOR-BASED
CONSENSUS 449
17.1 DE-CONSTRUCTING COMPARE&SWAP 450
17.2 A LIVENESS-ORIENTED ABSTRACTION: THE FAILURE DETECTOR Q . . . 452
17.2.1 DEFINITION O F Q 452
17.2.2 Q-BASED CONSENSUS: Q AS A RESOURCE ALLOCATOR OR A SCHEDULER 453
17.3 THREE SAFETY-ORIENTED ABSTRACTIONS: ALPHA], ALPHA2, AND ALPHA3 454
17.3.1 A ROUND-FREE ABSTRACTION: ALPHAI 454
17.3.2 A ROUND-BASED ABSTRACTION: ALPHA 2 4 5 5
17.3.3 ANOTHER ROUND-FREE ABSTRACTION: ALPHA3 456
17.3.4 THE ROUNDS SEEN AS A RESOURCE 457
17.4 Q-BASED CONSENSUS 457
17.4.1 CONSENSUS FROM ALPHAI OBJECTS AND Q 457
17.4.2 CONSENSUS FROM AN ALPHAI OBJECT AND Q 459
17.4.3 CONSENSUS FROM AN ALPHA3 OBJECT AND Q 460
17.4.4 WHEN THE EVENTUAL LEADER ELECTED BY Q DOES NOT PARTICIPATE 463
17.4.5 THE NOTION O F AN INDULGENT ALGORITHM 464
17.4.6 CONSENSUS OBJECT VERSUS Q 464
17.5 WAIT-FREE IMPLEMENTATIONS OF THE ALPHA: AND ALPHA 2 ABSTRACTIONS
465
17.5.1 ALPHA] FROM ATOMIC REGISTERS 465
17.5.2 ALPHA 2 FROM REGULAR REGISTERS 467
17.6 WAIT-FREE IMPLEMENTATIONS O F THE ALPHA2 ABSTRACTION FROM SHARED
DISKS 472
17.6.1 ALPHA 2 FROM UNRELIABLE READ/WRITE DISKS 472
17.6.2 ALPHA 2 FROM ACTIVE DISKS 476
17.7 IMPLEMENTING Q 477
17.7.1 THE ADDITIONAL TIMING ASSUMPTION EWB 478
17.7.2 AN EWB-BASED IMPLEMENTATION O F Q 479
17.7.3 PROOF O F THE CONSTRUCTION 481
17.7.4 DISCUSSION 484
IMAGE 12
X X I I C O N T E N T S
17.8 SUMMARY 485
17.9 BIBLIOGRAPHIC NOTES 485
17.10 EXERCISES AND PROBLEMS 486
AFTERWORD 489
BIBLIOGRAPHY 495
INDEX 509 |
| any_adam_object | 1 |
| author | Raynal, Michel |
| author_facet | Raynal, Michel |
| author_role | aut |
| author_sort | Raynal, Michel |
| author_variant | m r mr |
| building | Verbundindex |
| bvnumber | BV040522382 |
| classification_rvk | ST 134 ST 230 ST 234 |
| classification_tum | DAT 516f |
| ctrlnum | (OCoLC)820380494 (DE-599)DNB1023814544 |
| dewey-full | 005.275 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.275 |
| dewey-search | 005.275 |
| dewey-sort | 15.275 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV040522382</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20221026</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">121106s2013 gw d||| |||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">12,N27</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1023814544</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642320262</subfield><subfield code="c">Gb. : ca. EUR 48.10 (DE) (freier Pr.), ca. EUR 49.50 (AT) (freier Pr.), ca. sfr 60.00 (freier Pr.)</subfield><subfield code="9">978-3-642-32026-2</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783642320262</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">Best.-Nr.: 86096024</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)820380494</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1023814544</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">XA-DE-BE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-473</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-526</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.275</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 230</subfield><subfield code="0">(DE-625)143617:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 234</subfield><subfield code="0">(DE-625)143621:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 516f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Raynal, Michel</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Concurrent programming: algorithms, principles, and foundations</subfield><subfield code="c">Michel Raynal</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2013</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXXII, 515 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Objekt</subfield><subfield code="g">Informatik</subfield><subfield code="0">(DE-588)4197181-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Parallelverarbeitung</subfield><subfield code="0">(DE-588)4075860-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Synchronisierung</subfield><subfield code="0">(DE-588)4130847-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Atomarität</subfield><subfield code="g">Informatik</subfield><subfield code="0">(DE-588)4704497-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Wechselseitiger Ausschluss</subfield><subfield code="0">(DE-588)4373478-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Nebenläufigkeit</subfield><subfield code="0">(DE-588)4115352-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Nebenläufigkeit</subfield><subfield code="0">(DE-588)4115352-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Synchronisierung</subfield><subfield code="0">(DE-588)4130847-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Wechselseitiger Ausschluss</subfield><subfield code="0">(DE-588)4373478-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="4"><subfield code="a">Objekt</subfield><subfield code="g">Informatik</subfield><subfield code="0">(DE-588)4197181-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="5"><subfield code="a">Atomarität</subfield><subfield code="g">Informatik</subfield><subfield code="0">(DE-588)4704497-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Parallelverarbeitung</subfield><subfield code="0">(DE-588)4075860-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-3-642-32027-9</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">X:MVB</subfield><subfield code="q">text/html</subfield><subfield code="u">http://deposit.dnb.de/cgi-bin/dokserv?id=4068260&prov=M&dok_var=1&dok_ext=htm</subfield><subfield code="3">Inhaltstext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=025368654&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-025368654</subfield></datafield></record></collection> |
| id | DE-604.BV040522382 |
| illustrated | Illustrated |
| indexdate | 2024-08-21T00:18:12Z |
| institution | BVB |
| isbn | 9783642320262 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-025368654 |
| oclc_num | 820380494 |
| open_access_boolean | |
| owner | DE-473 DE-BY-UBG DE-739 DE-91G DE-BY-TUM DE-384 DE-19 DE-BY-UBM DE-634 DE-83 DE-526 DE-11 |
| owner_facet | DE-473 DE-BY-UBG DE-739 DE-91G DE-BY-TUM DE-384 DE-19 DE-BY-UBM DE-634 DE-83 DE-526 DE-11 |
| physical | XXXII, 515 S. graph. Darst. |
| publishDate | 2013 |
| publishDateSearch | 2013 |
| publishDateSort | 2013 |
| publisher | Springer |
| record_format | marc |
| spelling | Raynal, Michel Verfasser aut Concurrent programming: algorithms, principles, and foundations Michel Raynal Berlin [u.a.] Springer 2013 XXXII, 515 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Objekt Informatik (DE-588)4197181-4 gnd rswk-swf Parallelverarbeitung (DE-588)4075860-6 gnd rswk-swf Synchronisierung (DE-588)4130847-5 gnd rswk-swf Atomarität Informatik (DE-588)4704497-4 gnd rswk-swf Wechselseitiger Ausschluss (DE-588)4373478-9 gnd rswk-swf Programmierung (DE-588)4076370-5 gnd rswk-swf Nebenläufigkeit (DE-588)4115352-2 gnd rswk-swf Nebenläufigkeit (DE-588)4115352-2 s Programmierung (DE-588)4076370-5 s Synchronisierung (DE-588)4130847-5 s Wechselseitiger Ausschluss (DE-588)4373478-9 s Objekt Informatik (DE-588)4197181-4 s Atomarität Informatik (DE-588)4704497-4 s DE-604 Parallelverarbeitung (DE-588)4075860-6 s 1\p DE-604 Erscheint auch als Online-Ausgabe 978-3-642-32027-9 X:MVB text/html http://deposit.dnb.de/cgi-bin/dokserv?id=4068260&prov=M&dok_var=1&dok_ext=htm Inhaltstext DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=025368654&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Raynal, Michel Concurrent programming: algorithms, principles, and foundations Objekt Informatik (DE-588)4197181-4 gnd Parallelverarbeitung (DE-588)4075860-6 gnd Synchronisierung (DE-588)4130847-5 gnd Atomarität Informatik (DE-588)4704497-4 gnd Wechselseitiger Ausschluss (DE-588)4373478-9 gnd Programmierung (DE-588)4076370-5 gnd Nebenläufigkeit (DE-588)4115352-2 gnd |
| subject_GND | (DE-588)4197181-4 (DE-588)4075860-6 (DE-588)4130847-5 (DE-588)4704497-4 (DE-588)4373478-9 (DE-588)4076370-5 (DE-588)4115352-2 |
| title | Concurrent programming: algorithms, principles, and foundations |
| title_auth | Concurrent programming: algorithms, principles, and foundations |
| title_exact_search | Concurrent programming: algorithms, principles, and foundations |
| title_full | Concurrent programming: algorithms, principles, and foundations Michel Raynal |
| title_fullStr | Concurrent programming: algorithms, principles, and foundations Michel Raynal |
| title_full_unstemmed | Concurrent programming: algorithms, principles, and foundations Michel Raynal |
| title_short | Concurrent programming: algorithms, principles, and foundations |
| title_sort | concurrent programming algorithms principles and foundations |
| topic | Objekt Informatik (DE-588)4197181-4 gnd Parallelverarbeitung (DE-588)4075860-6 gnd Synchronisierung (DE-588)4130847-5 gnd Atomarität Informatik (DE-588)4704497-4 gnd Wechselseitiger Ausschluss (DE-588)4373478-9 gnd Programmierung (DE-588)4076370-5 gnd Nebenläufigkeit (DE-588)4115352-2 gnd |
| topic_facet | Objekt Informatik Parallelverarbeitung Synchronisierung Atomarität Informatik Wechselseitiger Ausschluss Programmierung Nebenläufigkeit |
| url | http://deposit.dnb.de/cgi-bin/dokserv?id=4068260&prov=M&dok_var=1&dok_ext=htm http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=025368654&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT raynalmichel concurrentprogrammingalgorithmsprinciplesandfoundations |