A more efficient generalization of Peterson's mutual exclusion algorithm (Q918655): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(90)90048-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2071009528 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new solution of Dijkstra's concurrent programming problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Myths about the mutual exclusion problem / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 09:23, 21 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A more efficient generalization of Peterson's mutual exclusion algorithm |
scientific article |
Statements
A more efficient generalization of Peterson's mutual exclusion algorithm (English)
0 references
1990
0 references
concurrent programming
0 references
concurrency control
0 references
mutual exclusion
0 references
critical section
0 references
