index.rst 6.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160
  1. .. Copyright (C) 2004-2009 The Trustees of Indiana University.
  2. Use, modification and distribution is subject to the Boost Software
  3. License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
  4. http://www.boost.org/LICENSE_1_0.txt)
  5. ===================================
  6. |Logo| Parallel Boost Graph Library
  7. ===================================
  8. Overview
  9. --------
  10. The Parallel Boost Graph Library is an extension to the `Boost Graph
  11. Library`_ (BGL) for parallel and distributed computing. It offers
  12. distributed graphs and graph algorithms to exploit coarse-grained
  13. parallelism along with parallel algorithms that exploit fine-grained
  14. parallelism, while retaining the same interfaces as the (sequential)
  15. BGL. Code written using the sequential BGL should be easy to
  16. parallelize with the parallel BGL. Visitors new to the Parallel BGL
  17. should read our `architectural overview`_.
  18. 1. `Process groups`_
  19. - `MPI process group`_
  20. - `Simple trigger interface`_
  21. 2. Auxiliary data structures
  22. - `Distributed queue`_
  23. - `Distributed property map`_
  24. 3. Distributed graph concepts
  25. - `Distributed Graph`_
  26. - `Distributed Vertex List Graph`_
  27. - `Distributed Edge List Graph`_
  28. - `Global Descriptor`_
  29. 4. Graph data structures
  30. - `Distributed adjacency list`_
  31. 5. Graph adaptors
  32. - `Local subgraph adaptor`_
  33. - `Vertex list graph adaptor`_
  34. 6. Graph input/output
  35. - Graphviz output
  36. - `METIS input`_
  37. 7. Synthetic data generators
  38. - `R-MAT generator`_
  39. - `Sorted R-MAT generator`_
  40. - `Sorted unique R-MAT generator`_
  41. - `Unique R-MAT generator`_
  42. - `Scalable R-MAT generator`_
  43. - `Erdos-Renyi generator`_
  44. - `Sorted Erdos-Renyi generator`_
  45. - `Small world generator`_
  46. - `SSCA generator`_
  47. - `Mesh generator`_
  48. 8. Algorithms
  49. - Distributed algorithms
  50. - `Breadth-first search`_
  51. - `Dijkstra's single-source shortest paths`_
  52. - `Eager Dijkstra shortest paths`_
  53. - `Crauser et al. Dijkstra shortest paths`_
  54. - `Delta-Stepping shortest paths`_
  55. - `Depth-first search`_
  56. - `Minimum spanning tree`_
  57. - `Boruvka's minimum spanning tree`_
  58. - `Merging local minimum spanning forests`_
  59. - `Boruvka-then-merge`_
  60. - `Boruvka-mixed-merge`_
  61. - Connected components
  62. - `Connected components`_
  63. - `Connected components parallel search`_
  64. - `Strongly-connected components`_
  65. - PageRank_
  66. - `Boman et al. Graph coloring`_
  67. - `Fruchterman Reingold force-directed layout`_
  68. - `s-t connectivity`_
  69. - `Betweenness centrality`_
  70. - `Non-distributed betweenness centrality`_
  71. ----------------------------------------------------------------------------
  72. Copyright (C) 2005-2009 The Trustees of Indiana University.
  73. Authors: Nick Edmonds, Douglas Gregor, and Andrew Lumsdaine
  74. .. |Logo| image:: pbgl-logo.png
  75. :align: middle
  76. :alt: Parallel BGL
  77. :target: http://www.osl.iu.edu/research/pbgl
  78. .. _Parallel Dijkstra example: dijkstra_example.html
  79. .. _Boost Graph Library: http://www.boost.org/libs/graph/doc
  80. .. _adjacency_list: http://www.boost.org/libs/graph/doc/adjacency_list.html
  81. .. _local subgraph adaptor: local_subgraph.html
  82. .. _vertex list graph adaptor: vertex_list_adaptor.html
  83. .. _MPI: http://www-unix.mcs.anl.gov/mpi/
  84. .. _generic programming: http://www.cs.rpi.edu/~musser/gp/
  85. .. _development page: design/index.html
  86. .. _process groups: process_group.html
  87. .. _MPI process group: process_group.html
  88. .. _Simple trigger interface: simple_trigger.html
  89. .. _Open Systems Laboratory: http://www.osl.iu.edu
  90. .. _Indiana University: http://www.indiana.edu
  91. .. _Distributed adjacency list: distributed_adjacency_list.html
  92. .. _Distributed queue: distributed_queue.html
  93. .. _Distributed property map: distributed_property_map.html
  94. .. _R-MAT generator: rmat_generator.html
  95. .. _Sorted R-MAT generator: sorted_rmat_generator.html
  96. .. _Sorted Unique R-MAT generator: sorted_unique_rmat_generator.html
  97. .. _Unique R-MAT generator: unique_rmat_generator.html
  98. .. _Scalable R-MAT generator: scalable_rmat_generator.html
  99. .. _Erdos-Renyi generator: http://www.boost.org/libs/graph/doc/erdos_renyi_generator.html
  100. .. _Sorted Erdos-Renyi generator: http://www.boost.org/libs/graph/doc/sorted_erdos_renyi_gen.html
  101. .. _Small world generator: http://www.boost.org/libs/graph/doc/small_world_generator.html
  102. .. _SSCA generator: ssca_generator.html
  103. .. _Mesh generator: mesh_generator.html
  104. .. _Breadth-first search: breadth_first_search.html
  105. .. _Depth-first search: tsin_depth_first_visit.html
  106. .. _Dijkstra's single-source shortest paths: dijkstra_shortest_paths.html
  107. .. _Eager Dijkstra shortest paths: dijkstra_shortest_paths.html#eager-dijkstra-s-algorithm
  108. .. _Crauser et al. Dijkstra shortest paths: dijkstra_shortest_paths.html#crauser-et-al-s-algorithm
  109. .. _Delta-Stepping shortest paths: dijkstra_shortest_paths.html#delta-stepping-algorithm
  110. .. _Minimum spanning tree: dehne_gotz_min_spanning_tree.html
  111. .. _Boruvka's minimum spanning tree: dehne_gotz_min_spanning_tree.html#dense-boruvka-minimum-spanning-tree
  112. .. _Merging local minimum spanning forests: dehne_gotz_min_spanning_tree.html#merge-local-minimum-spanning-trees
  113. .. _Boruvka-then-merge: dehne_gotz_min_spanning_tree.html#boruvka-then-merge
  114. .. _Boruvka-mixed-merge: dehne_gotz_min_spanning_tree.html#boruvka-mixed-merge
  115. .. _PageRank: page_rank.html
  116. .. _Boman et al. Graph coloring: boman_et_al_graph_coloring.html
  117. .. _Connected components: connected_components.html
  118. .. _Connected components parallel search: connected_components_parallel_search.html
  119. .. _Strongly-connected components: strong_components.html
  120. .. _Distributed Graph: DistributedGraph.html
  121. .. _Distributed Vertex List Graph: DistributedVertexListGraph.html
  122. .. _Distributed Edge List Graph: DistributedEdgeListGraph.html
  123. .. _Global Descriptor: GlobalDescriptor.html
  124. .. _METIS Input: metis.html
  125. .. _architectural overview: overview.html
  126. .. _Fruchterman Reingold force-directed layout: fruchterman_reingold.html
  127. .. _s-t connectivity: st_connected.html
  128. .. _Betweenness centrality: betweenness_centrality.html
  129. .. _Non-distributed betweenness centrality: non_distributed_betweenness_centrality.html