Congestion and almost invariant sets in dynamical systems
SNSC'01 Proceedings of the 2nd international conference on Symbolic and numerical scientific computation
GraphBuilder: scalable graph ETL framework
First International Workshop on Graph Data Management Experiences and Systems
| Hi-index | 0.00 |
When executing processes on parallel computer systems they encounter as a major bottleneck inter-processor communication. One way to address this problem is to minimize the communication between processes that are mapped to different processors. This translates to the k-partitioning problem of the corresponding process graph, where k is the number of processors. The classical spectral lower bound of ¦V¦ ÷ 2k &Sgr; k i =1 &lgr;i for the k-section width of a graph is well-known. We show new relations between the structure and the eigen values of a graph and present a new method to get tighter lower bounds on the k-section width. This method makes use of the level structure defined by the k-section. We define some global expansion property and prove that for graphs with the same k-section width the spectral lower bound increases with this global expansion. We also present examples of graphs for which our new bounds are tight up to a constant factor.