distributed directed sssp in sublinear time
play

Distributed Directed SSSP in Sublinear Time Jason Li Carnegie - PowerPoint PPT Presentation

Jul 28, 2023 •201 likes •1.08k views

Distributed Directed SSSP in Sublinear Time Jason Li Carnegie Mellon University Joint work with Mohsen Ghaffari (ETH Zurich) STOC 2018 Joint work with Mohsen Ghaffari (ETH Zurich) Distributed Directed SSSP in Sublinear Time Distributed

  1. Distributed Directed SSSP in Sublinear Time Jason Li Carnegie Mellon University Joint work with Mohsen Ghaffari (ETH Zurich) STOC 2018 Joint work with Mohsen Ghaffari (ETH Zurich) Distributed Directed SSSP in Sublinear Time

  2. Distributed Computing, CONGEST Model Distributed Model Joint work with Mohsen Ghaffari (ETH Zurich) Distributed Directed SSSP in Sublinear Time

  3. Distributed Computing, CONGEST Model Distributed Model Network graph Joint work with Mohsen Ghaffari (ETH Zurich) Distributed Directed SSSP in Sublinear Time

  4. Distributed Computing, CONGEST Model Distributed Model Network graph Vertices are called nodes Joint work with Mohsen Ghaffari (ETH Zurich) Distributed Directed SSSP in Sublinear Time

  5. Distributed Computing, CONGEST Model Distributed Model Network graph Vertices are called nodes Algorithm runs in rounds. In each round: Joint work with Mohsen Ghaffari (ETH Zurich) Distributed Directed SSSP in Sublinear Time

  6. Distributed Computing, CONGEST Model Distributed Model Network graph Vertices are called nodes Algorithm runs in rounds. In each round: Every node performs unbounded local computation Joint work with Mohsen Ghaffari (ETH Zurich) Distributed Directed SSSP in Sublinear Time

  7. Distributed Computing, CONGEST Model Distributed Model Network graph Vertices are called nodes Algorithm runs in rounds. In each round: Every node performs unbounded local computation Every node sends an O ( log n ) -bit message to each neighbor Joint work with Mohsen Ghaffari (ETH Zurich) Distributed Directed SSSP in Sublinear Time

  8. Distributed Computing, CONGEST Model Distributed Model Network graph Vertices are called nodes Algorithm runs in rounds. In each round: Every node performs unbounded local computation Every node sends an O ( log n ) -bit message to each neighbor The running time is the number of rounds Joint work with Mohsen Ghaffari (ETH Zurich) Distributed Directed SSSP in Sublinear Time

  9. Distributed Computing, CONGEST Model Distributed Model Network graph Vertices are called nodes Algorithm runs in rounds. In each round: Every node performs unbounded local computation Every node sends an O ( log n ) -bit message to each neighbor The running time is the number of rounds SSSP Problem Joint work with Mohsen Ghaffari (ETH Zurich) Distributed Directed SSSP in Sublinear Time

  10. Distributed Computing, CONGEST Model Distributed Model Network graph Vertices are called nodes Algorithm runs in rounds. In each round: Every node performs unbounded local computation Every node sends an O ( log n ) -bit message to each neighbor The running time is the number of rounds SSSP Problem Input graph and network graph have same edges Joint work with Mohsen Ghaffari (ETH Zurich) Distributed Directed SSSP in Sublinear Time

  11. Distributed Computing, CONGEST Model Distributed Model Network graph Vertices are called nodes Algorithm runs in rounds. In each round: Every node performs unbounded local computation Every node sends an O ( log n ) -bit message to each neighbor The running time is the number of rounds SSSP Problem Input graph and network graph have same edges Beginning: every node knows weights of its edges Joint work with Mohsen Ghaffari (ETH Zurich) Distributed Directed SSSP in Sublinear Time

  12. Distributed Computing, CONGEST Model Distributed Model Network graph Vertices are called nodes Algorithm runs in rounds. In each round: Every node performs unbounded local computation Every node sends an O ( log n ) -bit message to each neighbor The running time is the number of rounds SSSP Problem Input graph and network graph have same edges Beginning: every node knows weights of its edges End: every node knows its distance from source Joint work with Mohsen Ghaffari (ETH Zurich) Distributed Directed SSSP in Sublinear Time

  13. Distributed SSSP Trivial n − 1 upper bound (Bellman-Ford) Joint work with Mohsen Ghaffari (ETH Zurich) Distributed Directed SSSP in Sublinear Time

  14. Distributed SSSP Trivial n − 1 upper bound (Bellman-Ford) Trivial Ω( D ) lower bound Joint work with Mohsen Ghaffari (ETH Zurich) Distributed Directed SSSP in Sublinear Time

  15. Distributed SSSP Trivial n − 1 upper bound (Bellman-Ford) Trivial Ω( D ) lower bound Unweighted, undirected: BFS in D rounds Joint work with Mohsen Ghaffari (ETH Zurich) Distributed Directed SSSP in Sublinear Time

  16. Distributed SSSP Trivial n − 1 upper bound (Bellman-Ford) Trivial Ω( D ) lower bound Unweighted, undirected: BFS in D rounds Weighted, undirected? Joint work with Mohsen Ghaffari (ETH Zurich) Distributed Directed SSSP in Sublinear Time

  17. Distributed SSSP Trivial n − 1 upper bound (Bellman-Ford) Trivial Ω( D ) lower bound Unweighted, undirected: BFS in D rounds Weighted, undirected? BFS, Bellman-Ford? Joint work with Mohsen Ghaffari (ETH Zurich) Distributed Directed SSSP in Sublinear Time

  18. Distributed SSSP Trivial n − 1 upper bound (Bellman-Ford) Trivial Ω( D ) lower bound Unweighted, undirected: BFS in D rounds Weighted, undirected? BFS, Bellman-Ford? • s • • Blue edges: weight 1 Red edges: weight n 2 • • • • • • • • • Joint work with Mohsen Ghaffari (ETH Zurich) Distributed Directed SSSP in Sublinear Time

  19. Distributed SSSP Trivial n − 1 upper bound (Bellman-Ford) Trivial Ω( D ) lower bound Unweighted, undirected: BFS in D rounds Weighted, undirected? BFS, Bellman-Ford? • s • • Blue edges: weight 1 Red edges: weight n 2 • • • • • • • • • Joint work with Mohsen Ghaffari (ETH Zurich) Distributed Directed SSSP in Sublinear Time

  20. Distributed SSSP Trivial n − 1 upper bound (Bellman-Ford) Trivial Ω( D ) lower bound Unweighted, undirected: BFS in D rounds Weighted, undirected? BFS, Bellman-Ford all Θ( n ) time on a D = 2 graph! • s • • Blue edges: weight 1 • • Red edges: weight n 2 • • • • • • • Joint work with Mohsen Ghaffari (ETH Zurich) Distributed Directed SSSP in Sublinear Time

  21. Prior Work Elkin, 2004: Approximate SSSP in sublinear time? Joint work with Mohsen Ghaffari (ETH Zurich) Distributed Directed SSSP in Sublinear Time

  22. Prior Work Elkin, 2004: Approximate SSSP in sublinear time? O ( n 1 / 2 D 1 / 4 + D ) undirected, slightly [Nan14, STOC’14] ˜ worse for directed Joint work with Mohsen Ghaffari (ETH Zurich) Distributed Directed SSSP in Sublinear Time

  23. Prior Work Elkin, 2004: Approximate SSSP in sublinear time? O ( n 1 / 2 D 1 / 4 + D ) undirected, slightly [Nan14, STOC’14] ˜ worse for directed [HKN16, STOC’16] O ( n 1 / 2 + o ( 1 ) + n o ( 1 ) D ) undirected Joint work with Mohsen Ghaffari (ETH Zurich) Distributed Directed SSSP in Sublinear Time

  24. Prior Work Elkin, 2004: Approximate SSSP in sublinear time? O ( n 1 / 2 D 1 / 4 + D ) undirected, slightly [Nan14, STOC’14] ˜ worse for directed [HKN16, STOC’16] O ( n 1 / 2 + o ( 1 ) + n o ( 1 ) D ) undirected O ( n 1 / 2 + D ) undirected [BKKL17, DISC’17] ˜ Joint work with Mohsen Ghaffari (ETH Zurich) Distributed Directed SSSP in Sublinear Time

  25. Prior Work Elkin, 2004: Approximate SSSP in sublinear time? O ( n 1 / 2 D 1 / 4 + D ) undirected, slightly [Nan14, STOC’14] ˜ worse for directed [HKN16, STOC’16] O ( n 1 / 2 + o ( 1 ) + n o ( 1 ) D ) undirected O ( n 1 / 2 + D ) undirected [BKKL17, DISC’17] ˜ O ( n 1 / 2 + D ) lower bound [SHK+11, STOC’11] ˜ Joint work with Mohsen Ghaffari (ETH Zurich) Distributed Directed SSSP in Sublinear Time

  26. Prior Work Elkin, 2004: Approximate SSSP in sublinear time? O ( n 1 / 2 D 1 / 4 + D ) undirected, slightly [Nan14, STOC’14] ˜ worse for directed [HKN16, STOC’16] O ( n 1 / 2 + o ( 1 ) + n o ( 1 ) D ) undirected O ( n 1 / 2 + D ) undirected [BKKL17, DISC’17] ˜ O ( n 1 / 2 + D ) lower bound [SHK+11, STOC’11] ˜ Joint work with Mohsen Ghaffari (ETH Zurich) Distributed Directed SSSP in Sublinear Time

  27. Prior Work Elkin, 2004: Approximate SSSP in sublinear time? O ( n 1 / 2 D 1 / 4 + D ) undirected, slightly [Nan14, STOC’14] ˜ worse for directed [HKN16, STOC’16] O ( n 1 / 2 + o ( 1 ) + n o ( 1 ) D ) undirected O ( n 1 / 2 + D ) undirected [BKKL17, DISC’17] ˜ O ( n 1 / 2 + D ) lower bound [SHK+11, STOC’11] ˜ Joint work with Mohsen Ghaffari (ETH Zurich) Distributed Directed SSSP in Sublinear Time

  28. Prior Work Elkin, 2004: Approximate SSSP in sublinear time? O ( n 1 / 2 D 1 / 4 + D ) undirected, slightly [Nan14, STOC’14] ˜ worse for directed [HKN16, STOC’16] O ( n 1 / 2 + o ( 1 ) + n o ( 1 ) D ) undirected O ( n 1 / 2 + D ) undirected [BKKL17, DISC’17] ˜ O ( n 1 / 2 + D ) lower bound [SHK+11, STOC’11] ˜ Elkin, 2004: Exact SSSP in sublinear time? Joint work with Mohsen Ghaffari (ETH Zurich) Distributed Directed SSSP in Sublinear Time

  29. Prior Work Elkin, 2004: Approximate SSSP in sublinear time? O ( n 1 / 2 D 1 / 4 + D ) undirected, slightly [Nan14, STOC’14] ˜ worse for directed [HKN16, STOC’16] O ( n 1 / 2 + o ( 1 ) + n o ( 1 ) D ) undirected O ( n 1 / 2 + D ) undirected [BKKL17, DISC’17] ˜ O ( n 1 / 2 + D ) lower bound [SHK+11, STOC’11] ˜ Elkin, 2004: Exact SSSP in sublinear time? [ Elk17, STOC’17] ˜ O ( max { n 5 / 6 , n 2 / 3 D 1 / 3 } ) undirected Joint work with Mohsen Ghaffari (ETH Zurich) Distributed Directed SSSP in Sublinear Time

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Sublinear Algorithms for Big Data Qin Zhang 1-1 Part 3: Sublinear in Time 2-1 Sublinear in

Sublinear Algorithms for Big Data Qin Zhang 1-1 Part 3: Sublinear in Time 2-1 Sublinear in

Sublinear Algorithms for Big Data Qin Zhang 1-1 Part 3: Sublinear in Time 2-1 Sublinear in time Given a social network graph, if we have no time to ask everyone, can we still compute something non-trivial? For example, the average # of

557 views • 26 slides
Random Local Exploration Techniques for Sublinear-Time Algorithms Krzysztof Onak IBM Research

Random Local Exploration Techniques for Sublinear-Time Algorithms Krzysztof Onak IBM Research

Random Local Exploration Techniques for Sublinear-Time Algorithms Krzysztof Onak IBM Research Sublinear-Time Algorithms BIG DATA Sublinear-Time Algorithms Sublinear-time algorithms: Fast answer based on inspecting a tiny fraction of the

2.05k views • 152 slides
L ECTURE 2 Last time Introduction Basic models for sublinear-time computation Simple

L ECTURE 2 Last time Introduction Basic models for sublinear-time computation Simple

Sublinear Algorithms L ECTURE 2 Last time Introduction Basic models for sublinear-time computation Simple examples of sublinear algorithms Today Properties of lists and functions. Testing if a list is sorted/Lipschitz and if a

266 views • 24 slides
SSSP & SSE Presentation to President's Cabinet 03-07-2017 by Maxey & Crakes DATA / FALL

SSSP & SSE Presentation to President's Cabinet 03-07-2017 by Maxey & Crakes DATA / FALL

SPRING 2017 UPDATE SSSP & SSE Presentation to President's Cabinet 03-07-2017 by Maxey & Crakes DATA / FALL 2016 REPORT SSSP REPORTING Fully Matriculated - SSSP services completed Non - Matriculated - missing 1 or more SSSP service New -

691 views • 23 slides
Single Source Shortest Paths (SSSP) Directed graph Edge weights Shortest path from to :

Single Source Shortest Paths (SSSP) Directed graph Edge weights Shortest path from to :

Single Source Shortest Paths (SSSP) Directed graph Edge weights Shortest path from to : Path = 0 , 1 , , of minimum weight () 5 3 where 0 = , = and 4 7 4 1

766 views • 21 slides
L ECTURE 6 Last time Limitations of sublinear-time algorithms Yaos Minimax Principle

L ECTURE 6 Last time Limitations of sublinear-time algorithms Yaos Minimax Principle

Sublinear Algorithms L ECTURE 6 Last time Limitations of sublinear-time algorithms Yaos Minimax Principle Example: testing monotonicity Communication complexity Today Communication complexity Other models of computation

566 views • 38 slides
Introduction Computer Science & Engineering 423/823 I Similar to SSSP, but find shortest paths

Introduction Computer Science & Engineering 423/823 I Similar to SSSP, but find shortest paths

Introduction Computer Science & Engineering 423/823 I Similar to SSSP, but find shortest paths for all pairs of vertices Design and Analysis of Algorithms I Given a weighted, directed graph G = ( V , E ) with weight function w : E ! R , find

422 views • 4 slides
Sublinear Algorithms for Big Data Qin Zhang 1-1 Part 2: Sublinear in Communication 2-1

Sublinear Algorithms for Big Data Qin Zhang 1-1 Part 2: Sublinear in Communication 2-1

Sublinear Algorithms for Big Data Qin Zhang 1-1 Part 2: Sublinear in Communication 2-1 Sublinear in communication x 2 = 111011 x 1 = 010011 The model x 3 = 111111 x k = 100011 They want to jointly compute f ( x 1 , x 2 , . . . , x k ) Goal:

819 views • 70 slides
Parallel Depth First on GPU M. Naumov, A. Vrielink and M. Garland, GTC 2017 Introduction

Parallel Depth First on GPU M. Naumov, A. Vrielink and M. Garland, GTC 2017 Introduction

Parallel Depth First on GPU M. Naumov, A. Vrielink and M. Garland, GTC 2017 Introduction Directed Trees Directed Acyclic Graphs (DAGs) AGENDA Path- and SSSP-based variants Optimizations Performance Experiments 2 What is DFS? a Node:

1.03k views • 60 slides
Sublinear Algorithms for Big Data Part 4: Random Topics Qin Zhang 1-1 Topic 3: Random sampling

Sublinear Algorithms for Big Data Part 4: Random Topics Qin Zhang 1-1 Topic 3: Random sampling

Sublinear Algorithms for Big Data Part 4: Random Topics Qin Zhang 1-1 Topic 3: Random sampling in distributed data streams (based on a paper with Cormode, Muthukrishnan and Yi, PODS10, JACM12) 2-1 Distributed streaming Motivated by

534 views • 52 slides
Sublinear Algorithms Lectures 1 and 2 Sofya Raskhodnikova Penn State University 1 Tentative

Sublinear Algorithms Lectures 1 and 2 Sofya Raskhodnikova Penn State University 1 Tentative

Sublinear Algorithms Lectures 1 and 2 Sofya Raskhodnikova Penn State University 1 Tentative Topics Introduction, examples and general techniques. Sublinear-time algorithms for graphs strings basic properties of functions

1.04k views • 64 slides
Sublinear Time Nearest Neighbor Search over Generalized Weighted Space Yifan Lei

Sublinear Time Nearest Neighbor Search over Generalized Weighted Space Yifan Lei

Sublinear Time Nearest Neighbor Search over Generalized Weighted Space Yifan Lei Mohan S. Kankanhalli Anthony K. H. Tung School of Computing, National University of Singapore Source code:

514 views • 10 slides
Chapter 25: All-Pairs Shortest Path A trivial solution is to use SSSP algorithms for APSP With

Chapter 25: All-Pairs Shortest Path A trivial solution is to use SSSP algorithms for APSP With

Chapter 25: All-Pairs Shortest Path A trivial solution is to use SSSP algorithms for APSP With Dijkstras algorithm (no negative weights!) the running time would become O ( V ( V lg V + E )) = O ( V 2 lg V + V E ) With the Bellman-Ford

176 views • 14 slides
Time within Distributed Systems Time is important, however, it is problematic in distributed

Time within Distributed Systems Time is important, however, it is problematic in distributed

Time within Distributed Systems Time is important, however, it is problematic in distributed systems as we cannot synchronize time perfectly Introducing Time Time is a quantity that we often want to measure accurately Algorithms that

535 views • 29 slides
L ECTURE 4 Last time Testing if a graph is connected. Estimating the number of connected

L ECTURE 4 Last time Testing if a graph is connected. Estimating the number of connected

Sublinear Algorithms L ECTURE 4 Last time Testing if a graph is connected. Estimating the number of connected components. Estimating the weight of a MST Today Limitations of sublinear-time algorithms Yaos Minimax Principle

610 views • 28 slides
Distributed Coordination What makes a system distributed? Time in a distributed system

Distributed Coordination What makes a system distributed? Time in a distributed system

CPSC-410/611: Operating Systems Distr Coord Distributed Coordination What makes a system distributed? Time in a distributed system How do we determine the global state of a distributed system? Event ordering Mutual exclusion

405 views • 12 slides
Knowledge Acquisition Mackie Blackburn Learning Situated Knowledge Bases through Dialog,

Knowledge Acquisition Mackie Blackburn Learning Situated Knowledge Bases through Dialog,

Knowledge Acquisition Mackie Blackburn Learning Situated Knowledge Bases through Dialog, Pappu et al. Objective Event recommendation system Recommends university lectures based on research interests of user The system attempts

628 views • 59 slides
Team Academy framework for enterprise and entrepreneurship UWE: Adrian Rivers education

Team Academy framework for enterprise and entrepreneurship UWE: Adrian Rivers education

Team Academy framework for enterprise and entrepreneurship UWE: Adrian Rivers education (adrian.rivers@uwe.ac.uk) Aston: Elinor Vettraino (e.vettraino@aston.ac.uk) Team Academy Pedagogy Enterprising and entrepreneurial competencies

94 views • 7 slides
Writing and Critical Thinking Roger Graves, DirectorWriting Across the Curriculum Critical

Writing and Critical Thinking Roger Graves, DirectorWriting Across the Curriculum Critical

Writing and Critical Thinking Roger Graves, DirectorWriting Across the Curriculum Critical thinking = Raise questions/formulate problems Gather and assess information Identify potential conclusions/solutions Probe assumptions

295 views • 16 slides
learning David Boud Centre for Research in Assessment and Digital Learning, Deakin University

learning David Boud Centre for Research in Assessment and Digital Learning, Deakin University

Feedback must have an impact on learning David Boud Centre for Research in Assessment and Digital Learning, Deakin University Professor, Centre for Work and Learning, Middlesex University Emeritus Professor, University of Technology Sydney

745 views • 39 slides
A polynomial time algorithm for bounded directed pathwidth Hisao Tamaki Meiji University

A polynomial time algorithm for bounded directed pathwidth Hisao Tamaki Meiji University

A polynomial time algorithm for bounded directed pathwidth Hisao Tamaki Meiji University Directed pathwidth/decomposition A directed path-decomposition of 1 2 3 4 5 f b f c d a e e c g g g g g b

504 views • 37 slides
t-spanners for Transmission Graphs Using the Path-Greedy Algorithm Stav Ashur and Paz Carmi

t-spanners for Transmission Graphs Using the Path-Greedy Algorithm Stav Ashur and Paz Carmi

Intro. Transmission Graphs Computing t -Spanner t-spanners for Transmission Graphs Using the Path-Greedy Algorithm Stav Ashur and Paz Carmi EuroCG20 W urzburg Ashur and Carmi EuroCG20 Intro. Transmission Graphs Computing t -Spanner

1.01k views • 87 slides
DSG Recovery Plans Kay Goodacre, Lewis Goodger & Mark Wilson National Fair Funding Conference

DSG Recovery Plans Kay Goodacre, Lewis Goodger & Mark Wilson National Fair Funding Conference

DSG Recovery Plans Kay Goodacre, Lewis Goodger & Mark Wilson National Fair Funding Conference May 2019 Contents Workshop Aims Background Information Consultation Responses Progress made since the consultation Delivery

612 views • 13 slides
Cognitive Science Overview Ausubels Meaningful Reception Learning Theory Schema Theory

Cognitive Science Overview Ausubels Meaningful Reception Learning Theory Schema Theory

Cognitive Science Overview Ausubels Meaningful Reception Learning Theory Schema Theory Advance Organizers Managing Essential Processing Application to the design of multimedia learning materials Cognitive Science Scenario

409 views • 22 slides

More recommend