How processes learn (Q1082071)
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 3972177
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How processes learn |
scientific article; zbMATH DE number 3972177 |
Statements
How processes learn (English)
0 references
1986
0 references
Processes in distributed systems communicate with one another exclusively by sending and receiving messages. A process has access to its state but not to the states of other processes. Many distributed algorithms require that a process determine facts about the overall system computation. In anthropomorphic terms, processes ''learn'' about states of other processes in the evolution of system computation. This paper is concerned with how processes learn. We give a precise characterization of the minimum information law necessary for a process to determine specific facts about the system.
0 references
Processes in distributed systems
0 references
messages
0 references
distributed algorithms
0 references
information law
0 references
0.7025018930435181
0 references
0.6997438669204712
0 references