updated workstealing

tsung-wei-huang · tsung-wei-huang · commit 037e33b6a5b8 · 2018-12-06T18:34:42.000-06:00
diff --git a/README.md b/README.md
@@ -19,7 +19,7 @@ than existing parallel task programming libraries such as [OpenMP Tasking][OpenM
 
 Cpp-Taskflow enables you to implement efficient task decomposition strategies
 that incorporate both regular loop-based parallelism 
-and irregular compute patterns to optimize the cpu performance.
+and irregular compute patterns to optimize multicore performance.
 
 
 | Without Cpp-Taskflow | With Cpp-Taskflow |
diff --git a/example/simple.cpp b/example/simple.cpp
@@ -4,7 +4,6 @@
 // TaskA---->TaskC---->TaskD
 
 #include <taskflow/taskflow.hpp>  // the only include you need
-#include <new>
 
 int main(){
 
diff --git a/example/taskflow.cpp b/example/taskflow.cpp
@@ -352,13 +352,13 @@ auto multiple_dispatches() {
 // Function: main
 int main(int argc, char* argv[]) {
 
+  BENCHMARK("Map Reduce", map_reduce);
   BENCHMARK("Multiple Dispatches", multiple_dispatches);
   BENCHMARK("Empty Jobs", empty_jobs);
   BENCHMARK("Atomic Add", atomic_add);
   BENCHMARK("Binary Tree", binary_tree);
   BENCHMARK("Linear Graph", linear_graph);
   BENCHMARK("Level Graph", level_graph);
-  BENCHMARK("Map Reduce", map_reduce);
   BENCHMARK("Dynamic Stem", dynamic_stem);
 
   
diff --git a/image/plot.py b/image/plot.py
@@ -41,7 +41,7 @@
 plt.plot(graph_sizes, tbb_runtimes, label='TBB')
 plt.plot(graph_sizes, ctf_runtimes, label='Cpp-Taskflow')
 plt.title('Graph Algorithm', fontsize=22)
-plt.xlabel('graph size (|V|+|E| = # tasks)', fontsize=18)
+plt.xlabel('graph size (|V|+|E| ~ # tasks)', fontsize=18)
 plt.ylabel('cpu runtime (ms)', fontsize=16)
 #plt.xticks(np.arange(len(graph_sizes)), graph_sizes)
 plt.legend(fontsize=16)
diff --git a/taskflow/threadpool/workstealing_threadpool.hpp b/taskflow/threadpool/workstealing_threadpool.hpp
