A technique for decomposing algorithms which use a single shared variable (Q800081): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0022-0000(83)90047-8 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1984593614 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4160417 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4190136 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Data Requirements for Implementation of <i>N</i> -Process Mutual Exclusion Using a Single Shared Variable / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Upper bounds for static resource allocation in a distributed system / rank | |||
Normal rank |
Latest revision as of 15:55, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A technique for decomposing algorithms which use a single shared variable |
scientific article |
Statements
A technique for decomposing algorithms which use a single shared variable (English)
0 references
1983
0 references
asynchronous processes
0 references
contending processes
0 references
synchronization algorithms
0 references
0 references