Parallel Graph Algorithms课件.ppt

CS267/EngC233 Spring 2010 April 15, 2010;Applications Review of key results Case studies: Graph traversal-based problems, parallel algorithms Breadth-First Search Single-source Shortest paths Betweenness Centrality Community Identification;Road networks, Point-to-point shortest paths: 15 seconds (na?ve) ? 10 microseconds;The world-wide web can be represented as a directed graph Web search and crawl: traversal Link analysis, ranking: Page rank and HITS Document classification and clustering Internet topologies (router networks) are naturally modeled as graphs ;Reorderings for sparse solvers Fill reducing orderings Partitioning, eigenvectors Heavy diagonal to reduce pivoting (matching) Data structures for efficient exploitation of sparsity Derivative computations for optimization Matroids, graph colorings, spanning trees Preconditioning Incomplete Factorizations Partitioning for domain decomposition Graph techniques in algebraic multigrid Independent sets, matchings, etc. Support Theory Spanning trees graph embedding techniques;Graph abstractions are very useful to analyze complex data sets. Sources of data: petascale simulations, experimental devices, the Internet, sensor networks Challenges: data size, heterogeneity, uncertainty, data quality;Study of the interactions between various components in a biological system Graph-theoretic formulations are pervasive: Predicting new interactions: modeling Functional annotation of novel proteins: matching, clustering Identifying metabolic pathways: paths, clustering Identifying new protein complexes: clustering, centrality ;;[Krebs ’04] Post 9/11 Terrorist Network Analysis from public domain information Plot masterminds correctly identified from interaction patterns: centrality A global view of entities is often more insightful Detect anomalous activities by exact/approximate subgraph isomorphism. ;Research in Parallel Graph Algorithms;Characterizing Graph-theoretic computations (2/2);Applications Review of key res