diff --git a/src/graph/centrality/graph_betweenness.cc b/src/graph/centrality/graph_betweenness.cc
index a35d276ad5a173695f404c005c81f4cce6d0a5d3..da165ae1dca6616731f868785fc787e58cd40f56 100644
--- a/src/graph/centrality/graph_betweenness.cc
+++ b/src/graph/centrality/graph_betweenness.cc
@@ -45,7 +45,7 @@ void normalize_betweenness(const Graph& g,
 
     int i, N = num_vertices(g);
     #pragma omp parallel for default(shared) private(i)   \
-        schedule(dynamic)
+        schedule(static, 100)
     for (i = 0; i < N; ++i)
     {
         typename graph_traits<Graph>::vertex_descriptor v = vertex(i, g);
diff --git a/src/graph/centrality/graph_closeness.hh b/src/graph/centrality/graph_closeness.hh
index f96b17d839ac29a269da1bf01dcf023826f2cd54..447f332c2fa354480b67b2924ae2390180f0fe94 100644
--- a/src/graph/centrality/graph_closeness.hh
+++ b/src/graph/centrality/graph_closeness.hh
@@ -68,7 +68,7 @@ struct get_closeness
         get_vertex_dists_t get_vertex_dists;
         size_t HN = HardNumVertices()(g);
         int i, N = num_vertices(g);
-        #pragma omp parallel for default(shared) private(i) schedule(dynamic)
+        #pragma omp parallel for default(shared) private(i) schedule(static, 100)
         for (i = 0; i < N; ++i)
         {
             vertex_t v = vertex(i, g);
diff --git a/src/graph/centrality/graph_eigentrust.hh b/src/graph/centrality/graph_eigentrust.hh
index e80c6b29aea41f516218218d6b6e571e046d323a..92a26f0c95ed6fc4d2e0dcca0104be1cc5e2bb25 100644
--- a/src/graph/centrality/graph_eigentrust.hh
+++ b/src/graph/centrality/graph_eigentrust.hh
@@ -48,7 +48,7 @@ struct get_eigentrust
 
             int i, N = num_vertices(g);
             #pragma omp parallel for default(shared) private(i)  \
-                schedule(dynamic)
+                schedule(static, 100)
             for (i = 0; i < N; ++i)
             {
                 typename graph_traits<Graph>::vertex_descriptor v =
@@ -72,7 +72,7 @@ struct get_eigentrust
             c_sum.reserve(num_vertices(g));
             int i, N = num_vertices(g);
             #pragma omp parallel for default(shared) private(i)     \
-                schedule(dynamic)
+                schedule(static, 100)
             for (i = 0; i < N; ++i)
             {
                 typename graph_traits<Graph>::vertex_descriptor v =
@@ -90,7 +90,7 @@ struct get_eigentrust
         // init inferred trust t
         int i, N = num_vertices(g), V = HardNumVertices()(g);
         #pragma omp parallel for default(shared) private(i)     \
-                schedule(dynamic)
+                schedule(static, 100)
         for (i = 0; i < N; ++i)
         {
             typename graph_traits<Graph>::vertex_descriptor v = vertex(i, g);
@@ -105,7 +105,7 @@ struct get_eigentrust
         {
             delta = 0;
             #pragma omp parallel for default(shared) private(i)     \
-                schedule(dynamic) reduction(+:delta)
+                schedule(static, 100) reduction(+:delta)
             for (i = 0; i < N; ++i)
             {
                 typename graph_traits<Graph>::vertex_descriptor v =
@@ -137,7 +137,7 @@ struct get_eigentrust
         if (iter % 2 != 0)
         {
             #pragma omp parallel for default(shared) private(i)     \
-                schedule(dynamic)
+                schedule(static, 100)
             for (i = 0; i < N; ++i)
             {
                 typename graph_traits<Graph>::vertex_descriptor v =
diff --git a/src/graph/centrality/graph_eigenvector.hh b/src/graph/centrality/graph_eigenvector.hh
index 711bf602eef8dc530d2c67010df9231ba9b60c69..994bb73ce3d1bb459183044689482012d416c5f7 100644
--- a/src/graph/centrality/graph_eigenvector.hh
+++ b/src/graph/centrality/graph_eigenvector.hh
@@ -51,7 +51,7 @@ struct get_eigenvector
         {
             norm = 0;
             #pragma omp parallel for default(shared) private(i) \
-                schedule(dynamic) reduction(+:norm)
+                schedule(static, 100) reduction(+:norm)
             for (i = 0; i < N; ++i)
             {
                 typename graph_traits<Graph>::vertex_descriptor v =
@@ -77,7 +77,7 @@ struct get_eigenvector
 
             delta = 0;
             #pragma omp parallel for default(shared) private(i) \
-                schedule(dynamic) reduction(+:delta)
+                schedule(static, 100) reduction(+:delta)
             for (i = 0; i < N; ++i)
             {
                 typename graph_traits<Graph>::vertex_descriptor v =
@@ -97,7 +97,7 @@ struct get_eigenvector
         if (iter % 2 != 0)
         {
             #pragma omp parallel for default(shared) private(i)     \
-                schedule(dynamic)
+                schedule(static, 100)
             for (i = 0; i < N; ++i)
             {
                 typename graph_traits<Graph>::vertex_descriptor v =
diff --git a/src/graph/centrality/graph_hits.hh b/src/graph/centrality/graph_hits.hh
index fa7928906041e45ed732c7e2140418f36cbd35f3..83d3b5d50a702848de98a46b55e0c09682d1b507 100644
--- a/src/graph/centrality/graph_hits.hh
+++ b/src/graph/centrality/graph_hits.hh
@@ -47,7 +47,7 @@ struct get_hits
         // init centrality
         int i, N = num_vertices(g), V = HardNumVertices()(g);
         #pragma omp parallel for default(shared) private(i)     \
-                schedule(dynamic)
+                schedule(static, 100)
         for (i = 0; i < N; ++i)
         {
             typename graph_traits<Graph>::vertex_descriptor v = vertex(i, g);
@@ -65,7 +65,7 @@ struct get_hits
         {
             x_norm = 0;
             #pragma omp parallel for default(shared) private(i) \
-                schedule(dynamic) reduction(+:x_norm)
+                schedule(static, 100) reduction(+:x_norm)
             for (i = 0; i < N; ++i)
             {
                 typename graph_traits<Graph>::vertex_descriptor v =
@@ -100,7 +100,7 @@ struct get_hits
 
             delta = 0;
             #pragma omp parallel for default(shared) private(i) \
-                schedule(dynamic) reduction(+:delta)
+                schedule(static, 100) reduction(+:delta)
             for (i = 0; i < N; ++i)
             {
                 typename graph_traits<Graph>::vertex_descriptor v =
@@ -122,7 +122,7 @@ struct get_hits
         if (iter % 2 != 0)
         {
             #pragma omp parallel for default(shared) private(i)     \
-                schedule(dynamic)
+                schedule(static, 100)
             for (i = 0; i < N; ++i)
             {
                 typename graph_traits<Graph>::vertex_descriptor v =
diff --git a/src/graph/centrality/graph_katz.hh b/src/graph/centrality/graph_katz.hh
index 526f71fb381c480fbeb148ee0dc78049a2d0050a..8496353e016c041f6a940983284e17519e668cf9 100644
--- a/src/graph/centrality/graph_katz.hh
+++ b/src/graph/centrality/graph_katz.hh
@@ -51,7 +51,7 @@ struct get_katz
         {
             norm = 0;
             #pragma omp parallel for default(shared) private(i) \
-                schedule(dynamic) reduction(+:norm)
+                schedule(static, 100) reduction(+:norm)
             for (i = 0; i < N; ++i)
             {
                 typename graph_traits<Graph>::vertex_descriptor v =
@@ -77,7 +77,7 @@ struct get_katz
 
             delta = 0;
             #pragma omp parallel for default(shared) private(i) \
-                schedule(dynamic) reduction(+:delta)
+                schedule(static, 100) reduction(+:delta)
             for (i = 0; i < N; ++i)
             {
                 typename graph_traits<Graph>::vertex_descriptor v =
@@ -97,7 +97,7 @@ struct get_katz
         if (iter % 2 != 0)
         {
             #pragma omp parallel for default(shared) private(i)     \
-                schedule(dynamic)
+                schedule(static, 100)
             for (i = 0; i < N; ++i)
             {
                 typename graph_traits<Graph>::vertex_descriptor v =
diff --git a/src/graph/centrality/graph_pagerank.hh b/src/graph/centrality/graph_pagerank.hh
index 2bc7a7386231e1ef9aee79a6c56c11654b32b4ae..89da12832a24e07e9362e759f40288094e53445c 100644
--- a/src/graph/centrality/graph_pagerank.hh
+++ b/src/graph/centrality/graph_pagerank.hh
@@ -43,7 +43,7 @@ struct get_pagerank
         // init degs
         int i, N = num_vertices(g);
         #pragma omp parallel for default(shared) private(i)     \
-                schedule(dynamic)
+                schedule(static, 100)
         for (i = 0; i < N; ++i)
         {
             typename graph_traits<Graph>::vertex_descriptor v = vertex(i, g);
@@ -62,7 +62,7 @@ struct get_pagerank
         {
             delta = 0;
             #pragma omp parallel for default(shared) private(i)     \
-                schedule(dynamic) reduction(+:delta)
+                schedule(static, 100) reduction(+:delta)
             for (i = 0; i < N; ++i)
             {
                 typename graph_traits<Graph>::vertex_descriptor v =
@@ -96,7 +96,7 @@ struct get_pagerank
         if (iter % 2 != 0)
         {
             #pragma omp parallel for default(shared) private(i)     \
-                schedule(dynamic)
+                schedule(static, 100)
             for (i = 0; i < N; ++i)
             {
                 typename graph_traits<Graph>::vertex_descriptor v =
diff --git a/src/graph/centrality/graph_trust_transitivity.hh b/src/graph/centrality/graph_trust_transitivity.hh
index 2b87ac6ea413f65110ddd4699f5d4e779a25440c..94c76ce8242431c89f9b9c649106e10e9478f51a 100644
--- a/src/graph/centrality/graph_trust_transitivity.hh
+++ b/src/graph/centrality/graph_trust_transitivity.hh
@@ -106,7 +106,7 @@ struct get_trust_transitivity
             property_traits<InferredTrustMap>::value_type::value_type t_type;
 
         int i, N = num_vertices(g);
-        #pragma omp parallel for default(shared) private(i) schedule(dynamic)
+        #pragma omp parallel for default(shared) private(i) schedule(static, 100)
         for (i = 0; i < N; ++i)
         {
             vertex_t v = vertex(i, g);
@@ -116,7 +116,7 @@ struct get_trust_transitivity
         }
 
         N = (target == -1) ? num_vertices(g) : target + 1;
-        #pragma omp parallel for default(shared) private(i) schedule(dynamic)
+        #pragma omp parallel for default(shared) private(i) schedule(static, 100)
         for (i = (target == -1) ? 0 : target; i < N; ++i)
         {
             vertex_t tgt = vertex(i, g);
@@ -210,7 +210,7 @@ struct get_trust_transitivity
                          distance_zero(t_type(1)));
 
                     #pragma omp parallel for default(shared) private(j) \
-                        schedule(dynamic)
+                        schedule(static, 100)
                     for (j = 0; j < N2; ++j)
                     {
                         vertex_t src = vertex(j, g);
@@ -224,7 +224,7 @@ struct get_trust_transitivity
                 }
 
                 #pragma omp parallel for default(shared) private(j) \
-                    schedule(dynamic)
+                    schedule(static, 100)
                 for (j = 0; j < N2; ++j)
                 {
                     vertex_t src = vertex(j, g);
diff --git a/src/graph/clustering/graph_clustering.hh b/src/graph/clustering/graph_clustering.hh
index 252eb2589dc1f6c6b9cbdbcb6fd103cdc0e9d685..dc604c9f7ab3231051120e196d47c65a37fbcf1e 100644
--- a/src/graph/clustering/graph_clustering.hh
+++ b/src/graph/clustering/graph_clustering.hh
@@ -98,7 +98,7 @@ struct get_global_clustering
         int i, N = num_vertices(g);
 
         #pragma omp parallel for default(shared) private(i,temp) \
-            schedule(dynamic) reduction(+:triangles, n)
+            schedule(static, 100) reduction(+:triangles, n)
         for (i = 0; i < N; ++i)
         {
             typename graph_traits<Graph>::vertex_descriptor v = vertex(i, g);
@@ -117,7 +117,7 @@ struct get_global_clustering
 	double cerr = 0.0;
 
         #pragma omp parallel for default(shared) private(i,temp) \
-            schedule(dynamic) reduction(+:cerr)
+            schedule(static, 100) reduction(+:cerr)
         for (i = 0; i < N; ++i)
         {
             typename graph_traits<Graph>::vertex_descriptor v = vertex(i, g);
@@ -143,7 +143,7 @@ struct set_clustering_to_property
         typename get_undirected_graph<Graph>::type ug(g);
         int i, N = num_vertices(g);
 
-        #pragma omp parallel for default(shared) private(i) schedule(dynamic)
+        #pragma omp parallel for default(shared) private(i) schedule(static, 100)
         for (i = 0; i < N; ++i)
         {
             typename graph_traits<Graph>::vertex_descriptor v = vertex(i, g);
diff --git a/src/graph/clustering/graph_extended_clustering.hh b/src/graph/clustering/graph_extended_clustering.hh
index 2deea90be47f3a8a02ec2e309f0f40b996108735..33ea406442c017fe178c1bc6d9550ed60806de8d 100644
--- a/src/graph/clustering/graph_extended_clustering.hh
+++ b/src/graph/clustering/graph_extended_clustering.hh
@@ -122,7 +122,7 @@ struct get_extended_clustering
 
         int i, N = num_vertices(g);
 
-        #pragma omp parallel for default(shared) private(i) schedule(dynamic)
+        #pragma omp parallel for default(shared) private(i) schedule(static, 100)
         for (i = 0; i < N; ++i)
         {
             vertex_t v = vertex(i, g);
diff --git a/src/graph/clustering/graph_motifs.hh b/src/graph/clustering/graph_motifs.hh
index 83f29f5e56a3736105dbbcc58852f0e166941158..49a7ed682ae60f14573e8fac50e6c00b69c8d35d 100644
--- a/src/graph/clustering/graph_motifs.hh
+++ b/src/graph/clustering/graph_motifs.hh
@@ -357,7 +357,7 @@ struct get_all_motifs
 
         int i, N = (p < 1) ? V.size() : num_vertices(g);
         #pragma omp parallel for default(shared) private(i, sig) \
-            schedule(dynamic)
+            schedule(static, 100)
         for (i = 0; i < N; ++i)
         {
             vector<vector<typename graph_traits<Graph>::vertex_descriptor> >
diff --git a/src/graph/community/graph_community.hh b/src/graph/community/graph_community.hh
index 81ca59213ef253b9c6860cb9ab47d165343e44fd..7c356394a2ecc856d0529c7035d873521cd953df 100644
--- a/src/graph/community/graph_community.hh
+++ b/src/graph/community/graph_community.hh
@@ -109,7 +109,7 @@ struct get_communities
             // sample a new spin for every vertex
             int NV = num_vertices(g),i;
             #pragma omp parallel for default(shared) private(i)\
-                reduction(+:E) schedule(dynamic)
+                reduction(+:E) schedule(static, 100)
             for (i = 0; i < NV; ++i)
             {
                 vertex_t v = vertex(i, g);
@@ -212,7 +212,7 @@ struct get_communities
         {
             int NV = num_vertices(g), i;
             #pragma omp parallel for default(shared) private(i)\
-                schedule(dynamic)
+                schedule(static, 100)
             for (i = 0; i < NV; ++i)
             {
                 vertex_t v = vertex(i, g);
@@ -381,7 +381,7 @@ public:
     void Update(size_t k, size_t old_s, size_t s)
     {
         int i, NK = _degs.size();
-        #pragma omp parallel for default(shared) private(i) schedule(dynamic)
+        #pragma omp parallel for default(shared) private(i) schedule(static, 100)
         for (i = 0; i < NK; ++i)
         {
             size_t k1 = _degs[i], k2 = k;
@@ -407,7 +407,7 @@ public:
             _Nks[k].erase(old_s);
         _Nks[k][s]++;
 
-        #pragma omp parallel for default(shared) private(i) schedule(dynamic)
+        #pragma omp parallel for default(shared) private(i) schedule(static, 100)
         for (i = 0; i < NK; ++i)
         {
             size_t k1 = _degs[i], k2 = k;
diff --git a/src/graph/correlations/graph_assortativity.hh b/src/graph/correlations/graph_assortativity.hh
index 88a53091d449698522a34e863ee8bd9716180c22..cb1fe55c5a86a432e6dadaf7d52d4eddf1d18787 100644
--- a/src/graph/correlations/graph_assortativity.hh
+++ b/src/graph/correlations/graph_assortativity.hh
@@ -48,7 +48,7 @@ struct get_assortativity_coefficient
         SharedMap<tr1::unordered_map<double,count_t> > sa(a), sb(b);
         int i, N = num_vertices(g);
         #pragma omp parallel for default(shared) private(i) firstprivate(sa,sb)\
-            schedule(dynamic) reduction(+:e_kk, n_edges)
+            schedule(static, 100) reduction(+:e_kk, n_edges)
         for (i = 0; i < N; ++i)
         {
             typename graph_traits<Graph>::vertex_descriptor v = vertex(i, g);
@@ -82,7 +82,7 @@ struct get_assortativity_coefficient
 
         // "jackknife" variance
         double err = 0.0;
-        #pragma omp parallel for default(shared) private(i) schedule(dynamic)\
+        #pragma omp parallel for default(shared) private(i) schedule(static, 100)\
             reduction(+:err)
         for (i = 0; i < N; ++i)
         {
@@ -127,7 +127,7 @@ struct get_scalar_assortativity_coefficient
         double a = 0.0, b = 0.0, da = 0.0, db = 0.0;
         int i, N = num_vertices(g);
         #pragma omp parallel for default(shared) private(i) \
-            schedule(dynamic) reduction(+:e_xy,n_edges,a,b,da,db)
+            schedule(static, 100) reduction(+:e_xy,n_edges,a,b,da,db)
         for (i = 0; i < N; ++i)
         {
             typename graph_traits<Graph>::vertex_descriptor v = vertex(i, g);
@@ -163,7 +163,7 @@ struct get_scalar_assortativity_coefficient
         r_err = 0.0;
 
         double err = 0.0;
-        #pragma omp parallel for default(shared) private(i) schedule(dynamic)\
+        #pragma omp parallel for default(shared) private(i) schedule(static, 100)\
             reduction(+:err)
         for (i = 0; i < N; ++i)
         {
diff --git a/src/graph/correlations/graph_avg_correlations.hh b/src/graph/correlations/graph_avg_correlations.hh
index b6056345cdcfef42a357cbd315f4018f53324a9d..6d10a5691ff6c0f6d915fde73723a275a3955acb 100644
--- a/src/graph/correlations/graph_avg_correlations.hh
+++ b/src/graph/correlations/graph_avg_correlations.hh
@@ -67,7 +67,7 @@ struct get_avg_correlation
 
         int i, N = num_vertices(g);
         #pragma omp parallel for default(shared) private(i) \
-            firstprivate(s_sum, s_sum2, s_count) schedule(dynamic)
+            firstprivate(s_sum, s_sum2, s_count) schedule(static, 100)
         for (i = 0; i < N; ++i)
         {
             typename graph_traits<Graph>::vertex_descriptor v = vertex(i, g);
diff --git a/src/graph/correlations/graph_corr_hist.hh b/src/graph/correlations/graph_corr_hist.hh
index 831f52959a4274629a831f421c19ab8c557e5e75..35ddd7553a806ce7ae6ed9c46760d78ca2710c22 100644
--- a/src/graph/correlations/graph_corr_hist.hh
+++ b/src/graph/correlations/graph_corr_hist.hh
@@ -60,7 +60,7 @@ struct get_correlation_histogram
 
             int i, N = num_vertices(g);
             #pragma omp parallel for default(shared) private(i) \
-                firstprivate(s_hist) schedule(dynamic)
+                firstprivate(s_hist) schedule(static, 100)
             for (i = 0; i < N; ++i)
             {
                 typename graph_traits<Graph>::vertex_descriptor v =
diff --git a/src/graph/generation/graph_geometric.hh b/src/graph/generation/graph_geometric.hh
index 7f76de3917c7e954ddde94c02d15c95c5e520cc9..3f1b9b6f08249fab36ac4b69e7a18571db085ea5 100644
--- a/src/graph/generation/graph_geometric.hh
+++ b/src/graph/generation/graph_geometric.hh
@@ -127,7 +127,7 @@ struct get_geometric
         }
 
         #pragma omp parallel for default(shared) private(i, box) \
-            schedule(dynamic)
+            schedule(static, 100)
         for (int i = 0; i < N; ++i)
         {
             typename graph_traits<Graph>::vertex_descriptor v = vertex(i, g);
diff --git a/src/graph/generation/graph_lattice.hh b/src/graph/generation/graph_lattice.hh
index ca8776b7a5de6e6748d071628841183b07187401..f34ba27b52da56e74a3e1dbda3eb1436f3f4aa50 100644
--- a/src/graph/generation/graph_lattice.hh
+++ b/src/graph/generation/graph_lattice.hh
@@ -71,7 +71,7 @@ struct get_lattice
 
         vector<int> pos(shape.size());
         //#pragma omp parallel for default(shared) private(i) 
-        //    firstprivate(pos) schedule(dynamic)
+        //    firstprivate(pos) schedule(static, 100)
         for (int i = 0; i < N; ++i)
         {
             get_pos(i, shape, pos);
diff --git a/src/graph/graph_python_interface.cc b/src/graph/graph_python_interface.cc
index 3693c3e2be785bd6d2ae8b1a6de41cc179e838b3..fa60c30871c556daad70bdd8aae13e7076484cf9 100644
--- a/src/graph/graph_python_interface.cc
+++ b/src/graph/graph_python_interface.cc
@@ -244,7 +244,7 @@ struct get_degree_map
         typename map_t::unchecked_t deg_map = cdeg_map.get_unchecked(num_vertices(g));
 
         int i, N = num_vertices(g);
-        #pragma omp parallel for default(shared) private(i) schedule(dynamic)
+        #pragma omp parallel for default(shared) private(i) schedule(static, 100)
         for (i = 0; i < N; ++i)
         {
             typename graph_traits<Graph>::vertex_descriptor v = vertex(i, g);
diff --git a/src/graph/stats/graph_average.hh b/src/graph/stats/graph_average.hh
index 6df78ca77fc0ab4bec6d6221a3a58f12cde511c1..fe816447443e10c664b017a1ccb94fb53607790d 100644
--- a/src/graph/stats/graph_average.hh
+++ b/src/graph/stats/graph_average.hh
@@ -77,7 +77,7 @@ struct get_average
         AverageTraverse traverse;
         int i, N = num_vertices(g);
         #pragma omp parallel for default(shared) private(i) \
-            reduction(+:a,aa,count) schedule(dynamic)
+            reduction(+:a,aa,count) schedule(static, 100)
         for (i = 0; i < N; ++i)
         {
             typename graph_traits<Graph>::vertex_descriptor v = vertex(i, g);
diff --git a/src/graph/stats/graph_distance.hh b/src/graph/stats/graph_distance.hh
index e51a17aa6343bde69f03b1f49996803b3f3a7b59..f002a400919dd410cd5b51cbf4d165fe1a06e99b 100644
--- a/src/graph/stats/graph_distance.hh
+++ b/src/graph/stats/graph_distance.hh
@@ -80,7 +80,7 @@ struct get_distance_histogram
         get_vertex_dists_t get_vertex_dists;
         int i, N = num_vertices(g);
         #pragma omp parallel for default(shared) private(i,point) \
-            firstprivate(s_hist) schedule(dynamic)
+            firstprivate(s_hist) schedule(static, 100)
         for (i = 0; i < N; ++i)
         {
             vertex_t v = vertex(i, g);
diff --git a/src/graph/stats/graph_distance_sampled.hh b/src/graph/stats/graph_distance_sampled.hh
index 8d25b2b26613990a877e215665f9bb717261f708..482df134f1680e3d82c776a9a8e9f39cb7b8e1c9 100644
--- a/src/graph/stats/graph_distance_sampled.hh
+++ b/src/graph/stats/graph_distance_sampled.hh
@@ -88,7 +88,7 @@ struct get_sampled_distance_histogram
         typename hist_t::point_t point;
         get_vertex_dists_t get_vertex_dists;
         #pragma omp parallel for default(shared) private(i,point) \
-            firstprivate(s_hist) schedule(dynamic)
+            firstprivate(s_hist) schedule(static, 100)
         for (i = 0; i < int(n_samples); ++i)
         {
             vertex_t v;
diff --git a/src/graph/stats/graph_histograms.hh b/src/graph/stats/graph_histograms.hh
index a1244350dbd2610d046f891a2e2110ecc49dbd0f..3137f9913da4dc36381c5422b3b3e9ee18bc95cb 100644
--- a/src/graph/stats/graph_histograms.hh
+++ b/src/graph/stats/graph_histograms.hh
@@ -119,7 +119,7 @@ struct get_histogram
 
         int i, N = num_vertices(g);
         #pragma omp parallel for default(shared) private(i) \
-            firstprivate(s_hist) schedule(dynamic)
+            firstprivate(s_hist) schedule(static, 100)
         for (i = 0; i < N; ++i)
         {
             typename graph_traits<Graph>::vertex_descriptor v = vertex(i, g);
diff --git a/src/graph/stats/graph_parallel.hh b/src/graph/stats/graph_parallel.hh
index 3f36099a3163ec466a5f0767caf713447ca60091..56c20ce53d54bef83c0d352e064ef1b37369ebd8 100644
--- a/src/graph/stats/graph_parallel.hh
+++ b/src/graph/stats/graph_parallel.hh
@@ -36,7 +36,7 @@ struct label_parallel_edges
         typedef typename graph_traits<Graph>::edge_descriptor edge_t;
 
         int i, N = num_vertices(g);
-        #pragma omp parallel for default(shared) private(i) schedule(dynamic)
+        #pragma omp parallel for default(shared) private(i) schedule(static, 100)
         for (i = 0; i < N; ++i)
         {
             typename graph_traits<Graph>::vertex_descriptor v = vertex(i, g);
@@ -74,7 +74,7 @@ struct label_self_loops
         typedef typename graph_traits<Graph>::edge_descriptor edge_t;
 
         int i, N = num_vertices(g);
-        #pragma omp parallel for default(shared) private(i) schedule(dynamic)
+        #pragma omp parallel for default(shared) private(i) schedule(static, 100)
         for (i = 0; i < N; ++i)
         {
             typename graph_traits<Graph>::vertex_descriptor v = vertex(i, g);
diff --git a/src/graph/topology/graph_all_distances.cc b/src/graph/topology/graph_all_distances.cc
index 6f393cfef6ae5070cd157b75320ad3cc8fdc0c72..da0f8a99ac3802f20870f87317566038b68c10c4 100644
--- a/src/graph/topology/graph_all_distances.cc
+++ b/src/graph/topology/graph_all_distances.cc
@@ -37,7 +37,7 @@ struct do_all_pairs_search
             dist_t;
 
         int i, N = num_vertices(g);
-        #pragma omp parallel for default(shared) private(i) schedule(dynamic)
+        #pragma omp parallel for default(shared) private(i) schedule(static, 100)
         for (i = 0; i < N; ++i)
         {
             dist_map[i].clear();
diff --git a/src/graph/topology/graph_bipartite.cc b/src/graph/topology/graph_bipartite.cc
index b0339a326a739813785be464d403f4b17ddca182..dd63fddd5e16acba1f8de918b980df216525cf6f 100644
--- a/src/graph/topology/graph_bipartite.cc
+++ b/src/graph/topology/graph_bipartite.cc
@@ -37,7 +37,7 @@ struct get_bipartite
         is_bip = is_bipartite(g, vertex_index, part);
 
         int i, N = num_vertices(g);
-        #pragma omp parallel for default(shared) private(i) schedule(dynamic)
+        #pragma omp parallel for default(shared) private(i) schedule(static, 100)
         for (i = 0; i < N; ++i)
         {
             typename graph_traits<Graph>::vertex_descriptor v = vertex(i, g);
diff --git a/src/graph/topology/graph_components.hh b/src/graph/topology/graph_components.hh
index 75277523439fd45b88eb91871807163a86e85f6c..5ae44d229d42aef2103924af51a1f3692f83c8d1 100644
--- a/src/graph/topology/graph_components.hh
+++ b/src/graph/topology/graph_components.hh
@@ -194,7 +194,7 @@ struct label_attractors
     {
         typedef typename property_traits<CompMap>::value_type c_type;
         int i, N = num_vertices(g);
-        #pragma omp parallel for default(shared) private(i) schedule(dynamic)
+        #pragma omp parallel for default(shared) private(i) schedule(static, 100)
         for (i = 0; i < N; ++i)
         {
             typename graph_traits<Graph>::vertex_descriptor v =
diff --git a/src/graph/topology/graph_diameter.cc b/src/graph/topology/graph_diameter.cc
index 70cd12efba558bcf02f0c139d32f1c756b3d245a..a996970c2a7705b7d0c98673acf6f40d136d8710 100644
--- a/src/graph/topology/graph_diameter.cc
+++ b/src/graph/topology/graph_diameter.cc
@@ -101,7 +101,7 @@ struct do_bfs_search
         typedef unchecked_vector_property_map<size_t, VertexIndexMap> dist_map_t;
         dist_map_t dist_map(vertex_index, num_vertices(g));
         int i, N = num_vertices(g);
-        #pragma omp parallel for default(shared) private(i) schedule(dynamic)
+        #pragma omp parallel for default(shared) private(i) schedule(static, 100)
         for (i = 0; i < N; ++i)
         {
             typename graph_traits<Graph>::vertex_descriptor v = vertex(i, g);
diff --git a/src/graph/topology/graph_minimum_spanning_tree.cc b/src/graph/topology/graph_minimum_spanning_tree.cc
index 22e102f217acbd907b7e12557ab7b24bc96bd02c..1a13612088573b896104f70e9c3d84f09b2a08e9 100644
--- a/src/graph/topology/graph_minimum_spanning_tree.cc
+++ b/src/graph/topology/graph_minimum_spanning_tree.cc
@@ -78,7 +78,7 @@ struct get_prim_min_span_tree
         // convert the predecessor map to a tree map, and avoid trouble with
         // parallel edges
         int i, N = num_vertices(g);
-        #pragma omp parallel for default(shared) private(i) schedule(dynamic)
+        #pragma omp parallel for default(shared) private(i) schedule(static, 100)
         for (i = 0; i < N; ++i)
         {
             typename graph_traits<Graph>::vertex_descriptor v = vertex(i, g);
diff --git a/src/graph/topology/graph_planar.cc b/src/graph/topology/graph_planar.cc
index 212a4d697a6f145f5216c9f33446ea94e9852e15..f7b99bd6a6384b628de825053c9bc4feb179d995 100644
--- a/src/graph/topology/graph_planar.cc
+++ b/src/graph/topology/graph_planar.cc
@@ -64,7 +64,7 @@ struct get_planar_embedding
              boyer_myrvold_params::kuratowski_subgraph = kur_insert);
 
         int i, N = num_vertices(g);
-        #pragma omp parallel for default(shared) private(i) schedule(dynamic)
+        #pragma omp parallel for default(shared) private(i) schedule(static, 100)
         for (i = 0; i < N; ++i)
         {
             typename graph_traits<Graph>::vertex_descriptor v = vertex(i, g);
diff --git a/src/graph/topology/graph_random_spanning_tree.cc b/src/graph/topology/graph_random_spanning_tree.cc
index 8f8fe4e6d197e483b53058186b1e9205544d4601..4c3ec4f239e1b34e3f5b8bba91b766a3e41a2dd7 100644
--- a/src/graph/topology/graph_random_spanning_tree.cc
+++ b/src/graph/topology/graph_random_spanning_tree.cc
@@ -47,7 +47,7 @@ struct get_random_span_tree
         // convert the predecessor map to a tree map, and avoid trouble with
         // parallel edges
         int i, N = num_vertices(g);
-        #pragma omp parallel for default(shared) private(i) schedule(dynamic)
+        #pragma omp parallel for default(shared) private(i) schedule(static, 100)
         for (i = 0; i < N; ++i)
         {
             typename graph_traits<Graph>::vertex_descriptor v = vertex(i, g);
diff --git a/src/graph/topology/graph_reciprocity.cc b/src/graph/topology/graph_reciprocity.cc
index e17567a48faaf682bba6ea36ad100b6cae797fe5..9b6d9a6753dbf75977a74dc62c183240015d4755 100644
--- a/src/graph/topology/graph_reciprocity.cc
+++ b/src/graph/topology/graph_reciprocity.cc
@@ -34,7 +34,7 @@ struct get_reciprocity
 
         int i, NV = num_vertices(g);
         #pragma omp parallel for default(shared) private(i) reduction(+:L,Lbd) \
-            schedule(dynamic)
+            schedule(static, 100)
         for (i = 0; i < NV; ++i)
         {
             typename graph_traits<Graph>::vertex_descriptor v = vertex(i, g);
diff --git a/src/graph/topology/graph_subgraph_isomorphism.cc b/src/graph/topology/graph_subgraph_isomorphism.cc
index 662b7bb5831a904f5299df7dc786a2350b0794cd..16aa25cdb70ee694d0e6e35c4e669df231582b9d 100644
--- a/src/graph/topology/graph_subgraph_isomorphism.cc
+++ b/src/graph/topology/graph_subgraph_isomorphism.cc
@@ -113,7 +113,7 @@ struct get_mapping
         elabelling_t edge_labelling(sub, *g, edge_label1,
                                     any_cast<EdgeLabel>(edge_label2));
         int i, N = F.size();
-        #pragma omp parallel for default(shared) private(i) schedule(dynamic)
+        #pragma omp parallel for default(shared) private(i) schedule(static, 100)
         for (i = 0; i < N; ++i)
         {
             if (vertex(i, sub) == graph_traits<Graph1>::null_vertex())
diff --git a/src/graph/topology/graph_subgraph_isomorphism.hh b/src/graph/topology/graph_subgraph_isomorphism.hh
index 8691dfddca3dfbb76b6cdb40dc5c98dcfe862e57..f86a99c9be6c73666b475aa76f4a95e00ed254d6 100644
--- a/src/graph/topology/graph_subgraph_isomorphism.hh
+++ b/src/graph/topology/graph_subgraph_isomorphism.hh
@@ -148,7 +148,7 @@ bool refine_check(const Graph1& sub, const Graph2& g, matrix_t& M, size_t count,
     matrix_t M_temp(num_vertices(sub));
 
     int k = 0, N = num_vertices(sub);
-    #pragma omp parallel for default(shared) private(k) schedule(dynamic)
+    #pragma omp parallel for default(shared) private(k) schedule(static, 100)
     for (k = 0; k < int(count); ++k)
         M_temp[k] = M[k];
 
@@ -157,7 +157,7 @@ bool refine_check(const Graph1& sub, const Graph2& g, matrix_t& M, size_t count,
     {
         n_mod = 0;
         bool abort = false;
-        #pragma omp parallel for default(shared) private(k) schedule(dynamic) \
+        #pragma omp parallel for default(shared) private(k) schedule(static, 100) \
             reduction(+:n_mod)
         for (k = count; k < N; ++k)
         {
@@ -306,7 +306,7 @@ void subgraph_isomorphism(const Graph1& sub, const Graph2& g,
 
     bool abort = false;
     int i, N = num_vertices(sub);
-    #pragma omp parallel for default(shared) private(i) schedule(dynamic)
+    #pragma omp parallel for default(shared) private(i) schedule(static, 100)
     for (i = 0; i < N; ++i)
     {
         if (vertex(i, sub) == graph_traits<Graph1>::null_vertex() || abort)
diff --git a/src/graph/util/graph_search.hh b/src/graph/util/graph_search.hh
index 8dc036efa93c7225f3f3c0c009123159e57782c5..1712085d1f35aacb1703c32f0b7273f06381fb8f 100644
--- a/src/graph/util/graph_search.hh
+++ b/src/graph/util/graph_search.hh
@@ -75,7 +75,7 @@ struct find_vertices
         #endif
 
         int i, N = num_vertices(g);
-        #pragma omp parallel for default(shared) private(i) schedule(dynamic) \
+        #pragma omp parallel for default(shared) private(i) schedule(static, 100) \
             num_threads(nt)
         for (i = 0; i < N; ++i)
         {
@@ -117,7 +117,7 @@ struct find_edges
         #endif
 
         int i, N = num_vertices(g);
-        #pragma omp parallel for default(shared) private(i) schedule(dynamic) \
+        #pragma omp parallel for default(shared) private(i) schedule(static, 100) \
             num_threads(nt)
         for (i = 0; i < N; ++i)
         {