Lower bounds for embeddings into hypercubes]Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes

07/18/2018
by   R. Sundara Rajan, et al.
0

Interconnection networks provide an effective mechanism for exchanging data between processors in a parallel computing system. One of the most efficient interconnection networks is the hypercube due to its structural regularity, potential for parallel computation of various algorithms, and the high degree of fault tolerance. Thus it becomes the first choice of topological structure of parallel processing and computing systems. In this paper, lower bounds for the dilation, wirelength, and edge congestion of an embedding of a graph into a hypercube are proved. Two of these bounds are expressed in terms of the bisection width. Applying these results, the dilation and wirelength of embedding of certain complete multipartite graphs, folded hypercubes, wheels, and specific Cartesian products are computed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/18/2018

Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes

Interconnection networks provide an effective mechanism for exchanging d...
research
05/25/2018

Graph Oracle Models, Lower Bounds, and Gaps for Parallel Stochastic Optimization

We suggest a general oracle-based framework that captures different para...
research
02/17/2018

Lower Bounds on Sparse Spanners, Emulators, and Diameter-reducing shortcuts

We prove better lower bounds on additive spanners and emulators, which a...
research
03/23/2020

Author's approach to the topological modeling of parallel computing systems

The author's research of topologies of parallel computing systems and th...
research
09/29/2020

Communication Lower-Bounds for Distributed-Memory Computations for Mass Spectrometry based Omics Data

Mass spectrometry based omics data analysis require significant time and...
research
05/08/2019

Brief Announcement: Does Preprocessing Help under Congestion?

This paper investigates the power of preprocessing in the CONGEST model....
research
05/29/2023

On Complexity Bounds and Confluence of Parallel Term Rewriting

We revisit parallel-innermost term rewriting as a model of parallel comp...

Please sign up or login with your details

Forgot password? Click here to reset