Are Lock-Free Concurrent Algorithms Practically Wait-Free? (Q3177807)
From MaRDI portal
scientific article; zbMATH DE number 6451601
- Are lock-free concurrent algorithms practically wait-free?
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Are Lock-Free Concurrent Algorithms Practically Wait-Free? |
scientific article; zbMATH DE number 6451601 |
|
Statements
Are Lock-Free Concurrent Algorithms Practically Wait-Free? (English)
0 references
Are lock-free concurrent algorithms practically wait-free? (English)
0 references
2 August 2018
0 references
26 June 2015
0 references
distributed computing
0 references
lock-free algorithms
0 references
progress properties
0 references
schedulers
0 references
shared memory
0 references
wait-free algorithms
0 references
lockfree algorithms
0 references
0 references
