How processes learn (Q1082071): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Impossibility of distributed consensus with one faulty process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knowledge and common knowledge in a distributed environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time, clocks, and the ordering of events in a distributed system / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the time to assure interactive consistency / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:21, 17 June 2024

scientific article
Language Label Description Also known as
English
How processes learn
scientific article

    Statements

    How processes learn (English)
    0 references
    0 references
    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

    Identifiers