80 likes | 171 Views
Exponential Speed-Up of Local Algorithms using Non-Local Communication. distributed systems with "non-local" communication. abstracting communication. "classical" local model. Local vs. Non-Local Communication. Can we combine it?. Model. Communication:
E N D
Exponential Speed-Up of Local Algorithms using Non-Local Communication
distributed systems with "non-local" communication abstracting communication "classical" local model
Local vs. Non-Local Communication Can we combine it?
Model Communication: |V| =n nodes that may exchange messages directly bandwidth and memory limitation of n² (² constant) Task: graph problem on G = (V,E) maximum degree ¢ of G polylogarithmic nodes know neighbors in G MIS, MDS, max. matching, coloring, etc. large degrees implied small diameter anyway
Idea collect entire (multi-hop) neighorhoods in G distance to which graph is known grows exponentially simulate multiple rounds of local algorithm in one v
Results Theorem: Given that inputs are of size at most n²/2, any local algorithm terminating within r2O(log n) rounds can be simulated within O(log r) rounds.
Thank You!Questions & Comments? TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAAAAAA