1 / 1

External Memory Breadth First Search

L ( t- 2) L ( t- 1) L ( t ). b. d. f. N ( b ) N ( c ). a c d a b d e. d e. a c d b e. a d e. s. a. c. e. N ( L ( t- 1)) –dupl. – L ( t- 1) – L ( t- 2). Deepak Ajwani Max-Planck-Institute for Informatics.

velika
Télécharger la présentation

External Memory Breadth First Search

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. L(t-2) L(t-1) L(t) b d f N(b) N(c) a c d a b d e d e a c d b e a d e s a c e N(L(t-1)) –dupl. – L(t-1) – L(t-2) Deepak Ajwani Max-Planck-Institute for Informatics External Memory Breadth First Search Problem: Given a massive sparse undirected graph, compute its BFS level decomposition BFS algorithm by Munagala and Ranade • External memory: D disks • Data transfer in blocks of size B (~1M) • Up to D·B elements transfer in one I/O Goal: Minimize total number of I/O steps Mehlhorn and Meyer BFS algorithm - Randomized clustering Mehlhorn and Meyer BFS algorithm - Deterministic clustering * * * Implementation MADALGO – Center for Massive Data Algorithmics, a Center of the Danish National Research Foundation

More Related