2 // Copyright Oliver Kowalke 2015.
3 // Distributed under the Boost Software License, Version 1.0.
4 // (See accompanying file LICENSE_1_0.txt or copy at
5 // http://www.boost.org/LICENSE_1_0.txt)
7 // based on https://github.com/atemerev/skynet from Alexander Temerev
12 #include <condition_variable>
25 #include <boost/fiber/all.hpp>
27 #include "barrier.hpp"
28 #include "bind/bind_processor.hpp"
30 using clock_type = std::chrono::steady_clock;
31 using duration_type = clock_type::duration;
32 using time_point_type = clock_type::time_point;
33 using channel_type = boost::fibers::buffered_channel< std::uint64_t >;
34 using allocator_type = boost::fibers::fixedsize_stack;
35 using lock_type = std::unique_lock< std::mutex >;
37 static bool done = false;
38 static std::mutex mtx{};
39 static boost::fibers::condition_variable_any cnd{};
42 void skynet( allocator_type & salloc, channel_type & c, std::size_t num, std::size_t size, std::size_t div) {
46 channel_type rc{ 16 };
47 std::vector< boost::fibers::fiber > fibers;
48 for ( std::size_t i = 0; i < div; ++i) {
49 auto sub_num = num + i * size / div;
51 boost::fibers::fiber{ boost::fibers::launch::dispatch,
52 std::allocator_arg, salloc,
54 std::ref( salloc), std::ref( rc), sub_num, size / div, div });
56 std::uint64_t sum{ 0 };
57 for ( std::size_t i = 0; i < div; ++i) {
58 sum += rc.value_pop();
60 for ( auto & f: fibers) {
67 void thread( unsigned int max_idx, unsigned int idx, barrier * b) {
68 bind_to_processor( idx);
69 boost::fibers::use_scheduling_algorithm< boost::fibers::algo::work_stealing >( max_idx, idx);
72 cnd.wait( lk, [](){ return done; });
78 unsigned int cpus = std::thread::hardware_concurrency();
80 unsigned int max_idx = cpus - 1;
81 boost::fibers::use_scheduling_algorithm< boost::fibers::algo::work_stealing >( max_idx, max_idx);
82 bind_to_processor( max_idx);
83 std::size_t size{ 1000000 };
84 std::size_t div{ 10 };
85 std::vector< std::thread > threads;
86 for ( unsigned int idx = 0; idx < max_idx; ++idx) {
87 threads.push_back( std::thread( thread, max_idx, idx, & b) );
89 allocator_type salloc{ allocator_type::traits_type::page_size() };
90 std::uint64_t result{ 0 };
91 duration_type duration{ duration_type::zero() };
94 time_point_type start{ clock_type::now() };
95 skynet( salloc, rc, 0, size, div);
96 result = rc.value_pop();
97 duration = clock_type::now() - start;
98 std::cout << "Result: " << result << " in " << duration.count() / 1000000 << " ms" << std::endl;
103 for ( std::thread & t : threads) {
106 std::cout << "done." << std::endl;
108 } catch ( std::exception const& e) {
109 std::cerr << "exception: " << e.what() << std::endl;
111 std::cerr << "unhandled exception" << std::endl;