Lines Matching +full:max +full:- +full:parallel
24 #include <boost/graph/parallel/distribution.hpp>
31 #include <boost/property_map/parallel/distributed_property_map.hpp>
39 #include <boost/graph/parallel/algorithm.hpp>
46 #include <boost/graph/parallel/container_traits.hpp>
106 value = this->f(gen); in generator_iterator()
110 pointer operator->() const { return &value; } in operator ->()
156 int new_distance = get(weight, e) == (std::numeric_limits<Weight>::max)() ? in tree_edge()
157 (std::numeric_limits<Weight>::max)() : get(distance, source(e, g)) + get(weight, e); in tree_edge()
181 typedef typename boost::graph::parallel::process_group_type<Graph>::type in generate_sources()
192 uniform_int<vertices_size_type> rand_vertex(0, num_vertices(g) - 1); in generate_sources()
195 local_vertices += (id < (num_sources - (p * local_vertices)) ? 1 : 0); in generate_sources()
204 --local_vertices; in generate_sources()
214 // Kernel 2 - Classify large sets
220 typedef typename boost::graph::parallel::process_group_type<Graph>::type in classify_sets()
254 int global_max = all_reduce(pg, max_, boost::parallel::maximum<int>()); in classify_sets()
271 std::cerr << " Distributed Graph: " << print_time(end - start) << std::endl in classify_sets()
272 << " Max int weight = " << global_max << std::endl; in classify_sets()
303 std::cerr << " Non-Distributed Graph: " << print_time(end - start) << std::endl in seq_classify_sets()
304 << " Max int weight = " << max_ << std::endl; in seq_classify_sets()
307 // Kernel 3 - Graph Extraction
318 // Unfortunately we can't run subgraph extraction in parallel in subgraph_extraction()
327 typedef typename boost::graph::parallel::process_group_type<Graph>::type in subgraph_extraction()
355 local_put(distances, v, (std::numeric_limits<int>::max)()); in subgraph_extraction()
359 vertex_descriptor u = iter->first, v = iter->second; in subgraph_extraction()
382 if (get(distances, v) < (std::numeric_limits<int>::max)()) in subgraph_extraction()
410 std::cerr << " Distributed Graph: " << print_time(end - start) << std::endl; in subgraph_extraction()
453 put(distances, v, (std::numeric_limits<int>::max)()); in seq_subgraph_extraction()
477 if (get(distances, v) < (std::numeric_limits<int>::max)()) in seq_subgraph_extraction()
513 std::cerr << " Non-Distributed Graph: " << print_time(end - start) << std::endl; in seq_subgraph_extraction()
521 using boost::graph::parallel::process_group; in extract_max_bc_vertices()
522 using boost::parallel::all_gather; in extract_max_bc_vertices()
523 using boost::parallel::all_reduce; in extract_max_bc_vertices()
542 centrality_type global_max = all_reduce(pg, max_, boost::parallel::minimum<int>()); in extract_max_bc_vertices()
561 return (get(m_weight, e) & ((std::numeric_limits<weight_type>::max)() - 7)) != get(m_weight, e); in operator ()()
640 << " Non-Distributed Graph: " << print_time(end - start) << std::endl; in run_non_distributed_graph_tests()
648 std::cerr << "Degree - Fraction of vertices of that degree\n"; in run_non_distributed_graph_tests()
651 …std::cerr << " " << iter->first << " - " << double(iter->second) / num_vertices(sg) << std::endl … in run_non_distributed_graph_tests()
655 // Kernel 2 - Classify large sets in run_non_distributed_graph_tests()
671 // Kernel 3 - Graph Extraction in run_non_distributed_graph_tests()
712 // Non-Distributed Centrality Map in run_non_distributed_graph_tests()
731 // Non-Distributed Graph BC in run_non_distributed_graph_tests()
737 … edges_size_type nonDistributedExactTEPs = edges_size_type(floor(7 * n* (n - n0) / (end - start))); in run_non_distributed_graph_tests()
740 std::cerr << " non-Distributed Graph Exact = " << print_time(end - start) << " (" in run_non_distributed_graph_tests()
744 // Non-Distributed Graph Approximate BC in run_non_distributed_graph_tests()
752 uniform_int<vertices_size_type> rand_vertex(0, num_vertices(fsg) - 1); in run_non_distributed_graph_tests()
763 --remaining_sources; in run_non_distributed_graph_tests()
777 …edges_size_type nonDistributedApproxTEPs = edges_size_type(floor(7 * n * pow(2, K4Alpha) / (end - … in run_non_distributed_graph_tests()
780 …std::cerr << " Non-Distributed Graph Approximate (" << floor(pow(2, K4Alpha)) << " sources) = " in run_non_distributed_graph_tests()
781 << print_time(end - start) << " (" << nonDistributedApproxTEPs << " TEPs)\n"; in run_non_distributed_graph_tests()
810 edges_size_type sequentialTEPs = edges_size_type(floor(7 * n* (n - n0) / (end - start))); in run_non_distributed_graph_tests()
812 …std::cerr << " Sequential = " << print_time(end - start) << " (" << sequentialTEPs << " TEPs)\n… in run_non_distributed_graph_tests()
819 std::cerr << "\nVerifying non-scalable betweenness centrality...\n"; in run_non_distributed_graph_tests()
824 // Verify non-scalable betweenness centrality in run_non_distributed_graph_tests()
827 std::cerr << " " << id << ": Error - centrality of " << v in run_non_distributed_graph_tests()
869 parallel::variant_distribution<ProcessGroup> distrib in run_distributed_graph_tests()
870 = parallel::block(pg, n); in run_distributed_graph_tests()
878 typedef keep_local_edges<parallel::variant_distribution<ProcessGroup>, in run_distributed_graph_tests()
883 // Kernel 1 - Graph construction in run_distributed_graph_tests()
914 << " Distributed Graph: " << print_time(end - start) << std::endl; in run_distributed_graph_tests()
920 // Kernel 2 - Classify large sets in run_distributed_graph_tests()
937 // Kernel 3 - Graph Extraction in run_distributed_graph_tests()
967 // Kernel 4 - Betweenness Centrality in run_distributed_graph_tests()
983 // Vectors of max BC scores for all tests in run_distributed_graph_tests()
998 n0 = boost::parallel::all_reduce(pg, local_n0, std::plus<vertices_size_type>()); in run_distributed_graph_tests()
1012 edges_size_type exactTEPs = edges_size_type(floor(7 * n* (n - n0) / (end - start))); in run_distributed_graph_tests()
1015 std::cerr << " Exact = " << print_time(end - start) << " (" in run_distributed_graph_tests()
1031 edges_size_type approxTEPs = edges_size_type(floor(7 * n * pow(2, K4Alpha) / (end - start))); in run_distributed_graph_tests()
1035 << print_time(end - start) << " (" << approxTEPs << " TEPs)\n"; in run_distributed_graph_tests()
1041 // Build non-distributed graph to verify against in run_distributed_graph_tests()
1099 edges_size_type sequentialTEPs = edges_size_type(floor(7 * n* (n - n0) / (end - start))); in run_distributed_graph_tests()
1101 …std::cerr << " Sequential = " << print_time(end - start) << " (" << sequentialTEPs << " TEPs)\n… in run_distributed_graph_tests()
1115 … std::cerr << " " << id << ": Error - centrality of " << get(local, v) << "@" << get(owner, v) in run_distributed_graph_tests()
1133 << "\t--vertices v\t\t\tNumber of vertices in the graph\n" in usage()
1134 << "\t--edges v\t\t\tNumber of edges in the graph\n" in usage()
1135 << "\t--seed s\t\t\tSeed for synchronized random number generator\n" in usage()
1136 << "\t--full-bc\t\t\tRun full (exact) Betweenness Centrality\n" in usage()
1137 << "\t--max-weight miw\t\tMaximum integer edge weight\n" in usage()
1138 << "\t--subgraph-edge-length sel\tEdge length of subgraphs to extract in Kernel 3\n" in usage()
1139 << "\t--k4alpha k\t\t\tValue of K4Alpha in Kernel 4\n" in usage()
1140 << "\t--scale s\t\t\tSCALE parameter for the SSCA benchmark (sets n, m, and C)\n" in usage()
1141 << "\t--dot\t\t\t\tEmit a dot file containing the graph\n" in usage()
1142 << "\t--verify\t\t\tVerify result\n" in usage()
1143 << "\t--degree-dist\t\t\t Output degree distribution of graph\n" in usage()
1144 << "\t--no-distributed-graph\t\tOmit distributed graph tests\n"; in usage()
1189 exit(-1); in test_main()
1196 if (arg == "--vertices") in test_main()
1199 if (arg == "--seed") in test_main()
1202 if (arg == "--full-bc") in test_main()
1205 if (arg == "--max-weight") in test_main()
1208 if (arg == "--subgraph-edge-length") in test_main()
1211 if (arg == "--edges") in test_main()
1214 if (arg == "--k4alpha") in test_main()
1217 if (arg == "--dot") in test_main()
1220 if (arg == "--verify") in test_main()
1223 if (arg == "--degree-dist") in test_main()
1226 if (arg == "--no-distributed-graph") in test_main()
1229 if (arg == "--no-non-distributed-graph") in test_main()
1232 if (arg == "--scale") { in test_main()
1238 if (arg == "--help") { in test_main()
1241 exit(-1); in test_main()
1247 std::cerr << "Non-Distributed Graph Tests\n"; in test_main()