Optimum broadcasting and personalized communication in hypercubes
From MaRDI portal
Publication:5375486
DOI10.1109/12.29465zbMath1395.68034OpenAlexW2104487100WikidataQ62608805 ScholiaQ62608805MaRDI QIDQ5375486
S. Lennart Johnsson, Ching-Tien Ho
Publication date: 14 September 2018
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/12.29465
Related Items
Communication algorithms in \(k\)-ary \(n\)-cube interconnection networks ⋮ On optimal broadcasting in faulty hypercubes ⋮ Methods and problems of communication in usual networks ⋮ Constructing edge-disjoint spanning trees in twisted cubes ⋮ Mutually independent Hamiltonian cycles of binary wrapped butterfly graphs ⋮ An efficient parallel construction of optimal independent spanning trees on hypercubes ⋮ A fault-tolerant broadcasting algorithm for hypercubes ⋮ An algorithm to construct independent spanning trees on parity cubes ⋮ Spanning subgraphs with applications to communication of a subclass of the Cayley-graph-based networks ⋮ Optimal communication algorithms for Manhattan Street networks ⋮ Data transmission in processor networks ⋮ A broadcasting algorithm on the arrangement graph ⋮ Concurrent flows and packet routing in Cayley graphs (Preliminary version) ⋮ Mapping pipeline skeletons onto heterogeneous platforms ⋮ Techniques for pipelined broadcast on Ethernet switched clusters ⋮ Optimal broadcast for fully connected processor-node networks ⋮ One-to-many node-disjoint paths of hyper-star networks ⋮ Proper connection number of graph products ⋮ On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube ⋮ Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes ⋮ Independent spanning trees on twisted cubes ⋮ Constructing edge-disjoint Steiner paths in lexicographic product networks ⋮ Bandwidth efficient all-to-all broadcast on switched clusters ⋮ Edge intersection on the hypercube computer ⋮ Optimal total exchange for a 3-D torus of processors ⋮ An efficient algorithm for multiple simultaneous broadcasts in the hypercube ⋮ Broadcasting in DMA-bound bounded degree graphs ⋮ Two-dimensional, viscous, incompressible flow in complex geometries on a massively parallel processor ⋮ A parallel routing algorithm on recursive cube of rings networks employing Hamiltonian circuit Latin square ⋮ Communication efficient multi-processor FFT ⋮ An algorithm for routing messages between processing elements in a multiprocessor system which tolerates a maximal number of faulty links ⋮ On constructing multiple spanning trees in a hypercube ⋮ Broadcasting secure messages via optimal independent spanning trees in folded hypercubes ⋮ Constructing Internally Disjoint Pendant Steiner Trees in Cartesian Product Networks ⋮ The <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>k</mml:mi></mml:math>-independence number of graph products ⋮ On character-based index schemes for complex wildcard search in peer-to-peer networks ⋮ A parallel routing algorithm on circulant networks employing the Hamiltonian circuit Latin square ⋮ Independent spanning trees on folded hyper-stars ⋮ Monochromatic connectivity and graph products ⋮ Constructing edge-disjoint spanning trees in locally twisted cubes ⋮ A bandwidth latency tradeoff for broadcast and reduction ⋮ All-to-all personalized communication on multistage interconnection networks ⋮ Minimizing broadcast costs under edge reductions in tree networks ⋮ Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks ⋮ Modelling and analysis of communication overhead for parallel matrix algorithms ⋮ Application of the special Latin square to a parallel routing algorithm on a recursive circulant network. ⋮ Some aspects of parallel and distributed iterative algorithms - a survey ⋮ Routings for involutions of a hypercube ⋮ Optimal gray-code labeling and recognition algorithms for hypercubes
