Methods and problems of communication in usual networks (Q1339884): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3197858 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Décomposition de la somme cartesienne d'un cycle et de l'union de deux cycles hamiltoniens en cycles hamiltoniens / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3796744 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Potential function analysis of greedy hot-potato routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data transfers in broadcast networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple Communication in Multihop Radio Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcasting and Gossiping in de Bruijn Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antepenultimate broadcasting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcasting in Bounded Degree Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3793717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcasting in wraparound meshes with parallel monodirectional links / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3827949 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On bufferless routing of variable length messages in leveled networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4694740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the roots of a polynomial on an MIMD multicomputer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gossiping in Minimal Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deadlock-Free Message Routing in Multiprocessor Interconnection Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gossips and telegraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal algorithms for total exchange without buffering on the hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3886878 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-call broadcasting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3864434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity analysis of broadcasting in hypercubes with restricted communication capabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval routing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scattering on a ring of processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast gossiping on square mesh computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcasting on recursively decomposable Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cure for the Telephone Disease / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of gossiping and broadcasting in communication networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcasting and spanning trees in de Bruijn and Kautz networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning Balanced Trees in Boolean Cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum broadcasting and personalized communication in hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcasting in butterfly and deBruijn networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: New gossips and telephones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum \(k\)-broadcast graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Gossiping for the Hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds of the number of disjoint spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some minimum gossip graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information flows on hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quick gossiping by telegraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972008 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcasting in DMA-bound bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcast Networks of Bounded Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum broadcast digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of broadcasting and gossiping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the problem of gossiping in multidimensional grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orientations of the n-cube with minimum diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Synchronizer for the Hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded depth broadcasting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal total exchange for a 3-D torus of processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient routing in all-optical networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the optimal strongly connected orientations of city street graphs. III. Three east–west avenues or north–south streets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Optimal Strongly Connected Orientations of City Street Graphs I: Large Grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the optimal strongly connected orientations of city street graphs. II: Two east-west avenues or North—South Streets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data communication in parallel architectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comments on broadcast algorithms for two-dimensional grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for multiple simultaneous broadcasts in the hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcasting in the butterfly network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4694736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication algorithms for isotropic tasks in hypercubes and wraparound meshes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Communication Complexity of Atomic Commitment and of Gossiping / rank
 
Normal rank

Revision as of 09:54, 23 May 2024

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