Are lock-free concurrent algorithms practically wait-free? (Q6829231)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6451601
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
26 June 2015
0 references
distributed computing
0 references
lockfree algorithms
0 references
progress properties
0 references
schedulers
0 references
shared memory
0 references
wait-free algorithms
0 references
