Efficient distributed algorithms by using the archimedean time assumption (Q3816977)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient distributed algorithms by using the archimedean time assumption |
scientific article |
Statements
Efficient distributed algorithms by using the archimedean time assumption (English)
0 references
1989
0 references
Archimedean networks
0 references
synchronous networks
0 references
limited asynchrony
0 references
distributed computation
0 references
logical ring
0 references
mutual exclusion
0 references
readers and writers
0 references
symmetry breaking problem
0 references
message complexity
0 references
time complexity
0 references
