-
Notifications
You must be signed in to change notification settings - Fork 0
/
fibonacci_task_region_handle_gen.cpp
77 lines (62 loc) · 1.75 KB
/
fibonacci_task_region_handle_gen.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
/*
* $ g++ -Wall -O2 -std=c++11 -I C:\Tools\boost_1_69_0
* -L C:\Tools\boost_1_69_0\stage\lib
* -o fibonacci_task_region_handle_gen.exe
* fibonacci_task_region_handle_gen.cpp
* -l libboost_thread-mgw81-mt-x64-1_69
*/
#include <iostream>
#define BOOST_THREAD_PROVIDES_FUTURE
#define BOOST_THREAD_PROVIDES_EXECUTORS
#define BOOST_THREAD_TASK_REGION_HAS_SHARED_CANCELED
#include <boost/thread.hpp>
#include <boost/thread/future.hpp>
#include <boost/thread/csbl/vector.hpp>
#include <boost/thread/experimental/task_region.hpp>
// Horribly recursive and huge memory consumption!
int fib_task_region(int n)
{
using boost::experimental::parallel::task_region;
using boost::experimental::parallel::task_region_handle;
if (n == 0) return 0;
if (n == 1) return 1;
int n1;
int n2;
task_region([&](task_region_handle& trh)
{
trh.run([&]
{
n1 = fib_task_region(n - 1);
});
n2 = fib_task_region(n - 2);
});
return n1 + n2;
}
template <class Ex>
int fib_task_region_gen( Ex& ex, int n)
{
using boost::experimental::parallel::task_region;
using boost::experimental::parallel::task_region_handle_gen;
if (n == 0) return 0;
if (n == 1) return 1;
int n1 = 0;
int n2 = 0;
task_region(ex, [&](task_region_handle_gen<Ex>& trh) // (2)
{
trh.run([&]
{
n1 = fib_task_region(n - 1);
});
n2 = fib_task_region(n - 2);
});
return n1 + n2;
}
int main()
{
boost::basic_thread_pool tp; // (1)
for (int i = 0; i < 25; ++i) {
std::cout << fib_task_region_gen(tp, i) << " ";
}
std::cout << std::endl;
return 0;
}