Coupling coefficients of a distributed execution (Q1208733): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Complexity of network synchronization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Reasoning about continuous systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: How processes learn / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Decomposition of distributed programs into communication-closed layers / rank | |||
Normal rank | |||
Latest revision as of 16:28, 17 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Coupling coefficients of a distributed execution |
scientific article |
Statements
Coupling coefficients of a distributed execution (English)
0 references
16 May 1993
0 references
Coupling coefficients of a distributed execution which evaluate the temporal interactions (delays) of a distributed execution between the processes during execution are defined. The coefficients assess the structure of message exchanges rather than the quantity of exchanged information. Furthermore, it is proven that coupling coefficients are compatible with concatenation and fusion operators on distributed system and could be therefore regarded as a reasonable concurrency measure. Coupling coefficients provide a new criterion for comparison of the complexity of distributed algorithms and together with additional measures (as the speed-up), a new interesting tool for the analysis of distributed systems.
0 references
complexity measure
0 references
coupling coefficients
0 references
distributed execution
0 references
concurrency measure
0 references
distributed algorithms
0 references
