Laws of order, expensive synchronization in concurrent algorithms cannot be eliminated (Q5408568)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Laws of order, expensive synchronization in concurrent algorithms cannot be eliminated |
scientific article; zbMATH DE number 6282628
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Laws of order, expensive synchronization in concurrent algorithms cannot be eliminated |
scientific article; zbMATH DE number 6282628 |
Statements
Laws of order (English)
0 references
10 April 2014
0 references
algorithms
0 references
concurrency
0 references
lower bounds
0 references
memory barriers
0 references
memory fences
0 references
0.7513921856880188
0 references
0.7421594858169556
0 references
0.7208895683288574
0 references
0.7164139151573181
0 references
