Methods and problems of communication in usual networks (Q1339884)

From MaRDI portal
Revision as of 21:16, 4 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q127213036, #quickstatements; #temporary_batch_1722802475495)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Methods and problems of communication in usual networks
scientific article

    Statements

    Methods and problems of communication in usual networks (English)
    0 references
    0 references
    0 references
    28 August 1995
    0 references
    This paper surveys results on some communication problems in processor networks. In particular, the following problems are considered: broadcasting (i.e. sending a message from one processor to all other ones), gossiping (i.e. each processor is the source of a broadcast), scattering (i.e. one processor sends a different message to each other processor), and multiscattering (i.e. each processor is the source of a scattering). Each of these problems is studied with respect to 1. the network topology, 2. the communication mode of the links -- full-duplex or half-duplex --, 3. the model for communication time -- constant time or linear time --, and 4. the number of neighbours a processor can communicate with at the same time. Moreover, references to other communication problems are given. The paper concludes with a list of open problems. It should be noted that some of the results in this paper are new.
    0 references
    processor networks
    0 references
    broadcasting
    0 references
    gossiping
    0 references
    scattering
    0 references
    multiscattering
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references