|
|
Boost-Commit : |
Subject: [Boost-commit] svn:boost r52736 - sandbox/interthreads/libs/interthreads/example
From: vicente.botet_at_[hidden]
Date: 2009-05-02 10:10:51
Author: viboes
Date: 2009-05-02 10:10:49 EDT (Sat, 02 May 2009)
New Revision: 52736
URL: http://svn.boost.org/trac/boost/changeset/52736
Log:
Boost.Interthreads V0.1.3 : Removal of Async
Removed:
sandbox/interthreads/libs/interthreads/example/multiple_algorithms.cpp
sandbox/interthreads/libs/interthreads/example/parallel_sort.cpp
sandbox/interthreads/libs/interthreads/example/parallel_sort2.cpp
Deleted: sandbox/interthreads/libs/interthreads/example/multiple_algorithms.cpp
==============================================================================
--- sandbox/interthreads/libs/interthreads/example/multiple_algorithms.cpp 2009-05-02 10:10:49 EDT (Sat, 02 May 2009)
+++ (empty file)
@@ -1,103 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Roland Schwarz 2006.
-// (C) Copyright Vicente J. Botet Escriba 2008-2009.
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/interthreads for documentation.
-//
-// Based on the shared.cpp example from the threadalert library of Roland Schwarz
-//////////////////////////////////////////////////////////////////////////////
-
-#include <boost/thread/mutex.hpp>
-#include <boost/thread/thread.hpp>
-boost::mutex out_global_mutex;
-
-void sleep(int sec)
-{
- boost::xtime t;
- boost::xtime_get(&t,1);
- t.sec += sec;
- boost::thread::sleep(t);
-}
-
-
-#include <boost/interthreads/thread_tuple.hpp>
-#include <boost/interthreads/thread_tuple_once.hpp>
-#include <boost/interthreads/thread_group_once.hpp>
-#include <boost/interthreads/thread_and_join.hpp>
-#include <boost/interthreads/typeof/threader.hpp>
-#include <boost/interthreads/wait_for_any.hpp>
-#include <boost/thread.hpp>
-#include <iostream>
-
-namespace bith = boost::interthreads;
-
-int my_thread1() {
- sleep(3);
- {
- boost::lock_guard<boost::mutex> lock(out_global_mutex);
- std::cout << "1 thread_id=" << boost::this_thread::get_id() << std::endl;
- }
- return 0;
-}
-
-int my_thread2() {
- sleep(1);
- {
- boost::lock_guard<boost::mutex> lock(out_global_mutex);
- std::cout << "2 thread_id=" << boost::this_thread::get_id() << std::endl;
- }
- return 0;
-}
-
-int my_thread3() {
- sleep(2);
- {
- boost::lock_guard<boost::mutex> lock(out_global_mutex);
- std::cout << "3 thread_id=" << boost::this_thread::get_id() << std::endl;
- }
- return 0;
-}
-
-
-int main() {
- bith::shared_threader ae;
- BOOST_AUTO(result,bith::wait_for_any(ae, my_thread1, my_thread2, my_thread3));
- std::cout << "Algotithm " << result.first+1 << " finished the first with wait_for_any result=" << result.second << std::endl;
-
-
-#if 0
- //BOOST_AUTO(handles,bith::fork_all(ae, my_thread1, my_thread2, my_thread3));
-
- bith::thread_tuple<3> tt_0(my_thread1, my_thread2, my_thread3);
- bith::thread_tuple<3> tt_1;
- tt_1= tt_0.move();
- bith::thread_tuple<3> tt_2(tt_1.move());
- bith::thread_tuple<3> tt(boost::move(tt_2));
-
- tt.join_all();
- std::cout << "All finished join_all" << std::endl;
-
- bith::thread_tuple<3> kk_0= bith::make_thread_tuple(my_thread1, my_thread2, my_thread3);
- kk_0.join_all();
- std::cout << "All finished join_all" << std::endl;
-
- bith::thread_group_once tgo;
- boost::thread* th1 = tgo.create_thread(my_thread1);
- boost::thread* th2 = tgo.create_thread(my_thread2);
- boost::thread* th3 = tgo.create_thread(my_thread3);
- boost::thread* res_tgo= tgo.join_any();
- std::cout << "Algotithm " << res_tgo << " " << th2 << " finished the first with thread_group_once::join_any" << std::endl;
-
-
- bith::conc_join_all(my_thread1, my_thread2, my_thread3);
- std::cout << "All finished conc_join_all" << std::endl;
-
- unsigned res = bith::conc_join_any(my_thread1, my_thread2, my_thread3);
- std::cout << "Algotithm " << res+1 << " finished the first with conc_join_any" << std::endl;
-#endif
-
- return 0;
-}
Deleted: sandbox/interthreads/libs/interthreads/example/parallel_sort.cpp
==============================================================================
--- sandbox/interthreads/libs/interthreads/example/parallel_sort.cpp 2009-05-02 10:10:49 EDT (Sat, 02 May 2009)
+++ (empty file)
@@ -1,247 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Vicente J. Botet Escriba 2008-2009.
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/interthreads for documentation.
-//
-// Based on the shared.cpp example from the threadalert library of Roland Schwarz
-//////////////////////////////////////////////////////////////////////////////
-
-#include <iostream>
-#include <algorithm>
-
-#include <boost/progress.hpp>
-#include <boost/thread/thread.hpp>
-#include <boost/bind.hpp>
-#include <boost/tp/pool.hpp>
-#include <boost/tp/unbounded_channel.hpp>
-#include <boost/tp/fifo.hpp>
-#include <boost/range/algorithm/sort.hpp>
-#include <boost/range/algorithm/inplace_merge.hpp>
-#include <boost/range/sub_range.hpp>
-#include <boost/range/begin.hpp>
-#include <boost/range/end.hpp>
-#include <boost/array.hpp>
-#include <boost/range/algorithm/equal.hpp>
-#include <boost/range/adaptor/sliced.hpp>
-
-#include <assert.h>
-
-#define BOOST_PARTS 2
-#define NN 400000
-
-class scoped_timer {
- boost::posix_time::ptime start_;
-public:
- scoped_timer()
- : start_(boost::posix_time::microsec_clock::universal_time())
- {}
- ~scoped_timer() {
- boost::posix_time::ptime stop( boost::posix_time::microsec_clock::universal_time() );
- std::cout << " " << ( stop - start_).total_milliseconds() << " milli seconds" << std::endl;
- }
-};
-
-template <typename Range>
-class partition
-{
-public:
- boost::iterator_range<typename boost::range_iterator<Range>::type> range_;
- std::size_t parts_;
- partition(boost::iterator_range<typename boost::range_iterator<Range>::type>& range, std::size_t parts):
- range_(range),
- parts_(parts)
- {}
- boost::iterator_range<typename boost::range_iterator<Range>::type> operator[](unsigned i) {
- unsigned size = boost::size(range_);
- if (i<(parts_-1))
- return boost::make_sliced_range(range_, i*(size/parts_), ((i+1)*(size/parts_)));
- else
- return boost::make_sliced_range(range_, (parts_-1)*(size/parts_), size);
- }
-};
-
-typedef boost::tp::pool<
- boost::tp::unbounded_channel< boost::tp::fifo >
-> pool_type;
-
-typedef boost::tp::task< void > task_type;
-
-template <
- typename DirectSolver,
- typename Composer,
- typename AE,
- typename Range
->
- void inplace_solve( AE & ae, boost::sub_range<Range> range, unsigned cutoff );
-template <
- typename DirectSolver,
- typename Composer,
- typename AE,
- typename Range
->
- void inplace_solve( AE & ae,
- boost::sub_range<Range> range,
- unsigned cutoff) {
- unsigned size = boost::size(range);
- if ( size <= cutoff) DirectSolver()(range);
- else {
- partition<Range> parts(range, BOOST_PARTS);
- task_type tasks[BOOST_PARTS];
- for (unsigned i=0;i < BOOST_PARTS-1; ++i) {
- task_type tmp(ae.submit(
- boost::bind(
- &inplace_solve<DirectSolver,Composer,AE,Range>,
- boost::ref(ae),
- parts[i],
- cutoff
- )));
- tasks[i] = tmp;
-
- }
- inplace_solve<DirectSolver,Composer,AE,Range>(ae, parts[BOOST_PARTS-1], cutoff);
- for (unsigned i=0;i < BOOST_PARTS-1; ++i) {
- tasks[i].result().wait();
- };
-
- Composer()(range);
-
- }
- }
-
-struct sort_fct {
- template<class RandomAccessRange>
- RandomAccessRange& operator()(RandomAccessRange rng) {
- return boost::sort(rng);
- }
-};
-
-struct inplace_merge_fct {
- template<class BidirectionalRange>
- BidirectionalRange&
- operator()( BidirectionalRange rng) {
- return boost::inplace_merge(rng, boost::begin(rng)+(boost::size(rng)/2));
- }
-};
-template <typename Range>
-void parallel_sort(Range& range, unsigned cutoff=10000) {
- pool_type pool( boost::tp::poolsize( 2) );
-// pool_type& pool(boost::this_task::get_thread_pool<pool_type>() );
- boost::sub_range<Range> rng(boost::begin(range), boost::end(range));
- inplace_solve<sort_fct,inplace_merge_fct,pool_type,Range>( pool, rng, cutoff);
-}
-
-int sorted[NN];
-int values1[NN];
-int values2[NN];
-int values3[NN];
-int values4[NN];
-int values5[NN];
-int values6[NN];
-
-int main() {
- for (unsigned i=0; i<NN; ++i) sorted[i]=i;
-
- for (unsigned i=0; i<NN; ++i) values1[i]=NN-i-1;
- {
- std::cout << "std::sort: reverse 0.." << NN;
- scoped_timer t; // start timing
- std::sort(boost::begin(values1), boost::end(values1));
- }
- assert(boost::equal(values1, sorted));
- {
- std::cout << "std::sort: 0.." << NN;
- scoped_timer t; // start timing
- std::sort(boost::begin(values1), boost::end(values1));
- }
-
- for (unsigned i=0; i<NN; ++i) values2[i]=NN-i-1;
- {
- std::cout << "boost::sort: reverse 0.."<<NN;
- scoped_timer t; // start timing
- boost::sort(values2);
- }
- assert(boost::equal(values2, sorted));
- {
- std::cout << "boost::sort: 0.."<<NN;
- scoped_timer t; // start timing
- boost::sort(values2);
- }
-
- // creates a threadpool with two worker-threads
- //pool_type pool( boost::tp::poolsize( 2) );
-
-
- for (unsigned i=0; i<NN; ++i) values6[i]=NN-i-1;
- {
- std::cout << "parallel_sort "<<NN/2<<": reverse 0.."<<NN;
- scoped_timer tmr; // start timing
- parallel_sort(values6, NN/2);
- }
- assert(boost::equal(values6, sorted));
- {
- std::cout << "parallel_sort "<<NN/2<<": 0.."<<NN;
- scoped_timer tmr; // start timing
- parallel_sort(values6, NN/2);
- }
-
- for (unsigned i=0; i<NN; ++i) values6[i]=NN-i-1;
- {
- std::cout << "parallel_sort "<<NN/4<<": reverse 0.."<<NN;
- scoped_timer tmr; // start timing
- parallel_sort(values6, NN/4);
- }
- assert(boost::equal(values6, sorted));
- {
- std::cout << "parallel_sort "<<NN/4<<": 0.."<<NN;
- scoped_timer tmr; // start timing
- parallel_sort(values6, NN/4);
- }
-
- for (unsigned i=0; i<NN; ++i) values6[i]=NN-i-1;
- {
- std::cout << "parallel_sort "<<NN/8<<": reverse 0.."<<NN;
- scoped_timer tmr; // start timing
- parallel_sort(values6, NN/8);
- }
- assert(boost::equal(values6, sorted));
- {
- std::cout << "parallel_sort "<<NN/8<<": 0.."<<NN;
- scoped_timer tmr; // start timing
- parallel_sort(values6, NN/8);
- }
-
- for (unsigned i=0; i<NN; ++i) values5[i]=NN-i-1;
- {
- std::cout << "parallel_sort "<<NN/16<<": reverse 0.."<<NN;
- scoped_timer tmr; // start timing
- parallel_sort(values5, NN/16);
- }
- assert(boost::equal(values5, sorted));
- {
- std::cout << "parallel_sort "<<NN/16<<": 0.."<<NN;
- scoped_timer tmr; // start timing
- parallel_sort(values5, NN/16);
- }
-
- for (unsigned i=0; i<NN; ++i) values6[i]=NN-i-1;
- {
- std::cout << "parallel_sort "<<NN/32<<": reverse 0.."<<NN;
- scoped_timer tmr; // start timing
- parallel_sort(values6, NN/32);
- }
- assert(boost::equal(values6, sorted));
- {
- std::cout << "parallel_sort "<<NN/32<<": 0.."<<NN;
- scoped_timer tmr; // start timing
- parallel_sort(values6, NN/32);
- }
-
-
- //std::cout << "shutdown"<< std::endl;
- //pool.shutdown();
- std::cout << "end"<< std::endl;
- return 0;
-}
Deleted: sandbox/interthreads/libs/interthreads/example/parallel_sort2.cpp
==============================================================================
--- sandbox/interthreads/libs/interthreads/example/parallel_sort2.cpp 2009-05-02 10:10:49 EDT (Sat, 02 May 2009)
+++ (empty file)
@@ -1,311 +0,0 @@
-//////////////////////////////////////////////////////////////////////////////
-//
-// (C) Copyright Vicente J. Botet Escriba 2008-2009.
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-//
-// See http://www.boost.org/libs/interthreads for documentation.
-//
-// Based on the shared.cpp example from the threadalert library of Roland Schwarz
-//////////////////////////////////////////////////////////////////////////////
-
-#include <iostream>
-#include <algorithm>
-
-#include <boost/progress.hpp>
-#include <boost/thread/thread.hpp>
-#include <boost/bind.hpp>
-#include <boost/tp/pool.hpp>
-#include <boost/tp/unbounded_channel.hpp>
-#include <boost/tp/fifo.hpp>
-#include <boost/range/algorithm/sort.hpp>
-#include <boost/range/algorithm/inplace_merge.hpp>
-#include <boost/range/sub_range.hpp>
-#include <boost/range/begin.hpp>
-#include <boost/range/end.hpp>
-#include <boost/range/algorithm/equal.hpp>
-#include <boost/range/algorithm/for_each.hpp>
-#include <boost/range/algorithm/transform.hpp>
-#include <boost/range/adaptor/sliced.hpp>
-#include <boost/interthreads/fork.hpp>
-#include <boost/interthreads/algorithm/wait.hpp>
-#include <boost/interthreads/scheduler.hpp>
-#include <boost/array.hpp>
-
-#include <assert.h>
-
-#include <boost/range/algorithm/count.hpp>
-
-#if 0
-
-struct A {
- int x;
- int y;
-};
-
-namespace boost {
- //template <typename T>
- unsigned count(A& t, const int& i) {
- return 2;
- }
-}
-
-
-unsigned xx() {
- A a;
- return boost::count(a, 1);
-}
-
-int main() {
- std::cout << xx() << std::endl;
-
-}
-
-#else
-
-#define BOOST_NB_OF_THREADS 4
-#define BOOST_PARTS 2
-#define NN 400000
-
-class scoped_timer {
- boost::posix_time::ptime start_;
-public:
- scoped_timer()
- : start_(boost::posix_time::microsec_clock::universal_time())
- {}
- ~scoped_timer() {
- boost::posix_time::ptime stop( boost::posix_time::microsec_clock::universal_time() );
- std::cout << " " << ( stop - start_).total_milliseconds() << " milli seconds" << std::endl;
- }
-};
-
-template <typename Range>
-class partition
-{
-public:
- boost::iterator_range<typename boost::range_iterator<Range>::type> range_;
- std::size_t parts_;
- partition(boost::iterator_range<typename boost::range_iterator<Range>::type>& range, std::size_t parts):
- range_(range),
- parts_(parts)
- {}
- boost::iterator_range<typename boost::range_iterator<Range>::type> operator[](unsigned i) {
- unsigned size = boost::size(range_);
- if (i<(parts_-1))
- return boost::make_sliced_range(range_, i*(size/parts_), ((i+1)*(size/parts_)));
- else
- return boost::make_sliced_range(range_, (parts_-1)*(size/parts_), size);
- }
-};
-
-typedef boost::tp::pool<
- boost::tp::unbounded_channel< boost::tp::fifo >
-> pool_type;
-
-#ifdef TASK_POOL
- typedef boost::tp::task< pool_type, void > task_type;
-#else
- typedef boost::tp::task< void > task_type;
-#endif
-
-
-template <
- typename DirectSolver,
- typename Composer,
- typename AE,
- typename Range
->
- void inplace_solve( AE & ae,
- boost::iterator_range<typename boost::range_iterator<Range>::type> range,
- unsigned cutoff );
-
-template <
- typename DirectSolver,
- typename Composer,
- typename AE,
- typename Range
->
- void inplace_solve( AE & ae,
- boost::iterator_range<typename boost::range_iterator<Range>::type> range,
- unsigned cutoff )
- {
- unsigned size = boost::size(range);
- //std::cout << "<<par_ " << size;
- if ( size <= cutoff) DirectSolver()(range);
- else {
- partition<Range> parts(range, BOOST_PARTS);
- std::list<task_type> tasks;
- #if 0 // this code do not compiles with gcc 3.4.4 cygwin
- boost::transform(parts, boost::begin(tasks),
- boost::bind(&AE::submit, boost::ref(ae),
- //boost::bind(&boost::interthreads::fork<AE>, boost::ref(ae),
- boost::bind(&inplace_solve<DirectSolver,Composer,AE,Range>, boost::ref(ae),_1,cutoff)));
- #else
- for (unsigned i=0;i < BOOST_PARTS-1; ++i) {
- task_type tmp(ae.submit(
- boost::bind(
- &inplace_solve<DirectSolver,Composer,AE,Range>,
- boost::ref(ae),
- parts[i],
- cutoff
- )));
- tasks.push_back(tmp);
- }
- #endif
- inplace_solve<DirectSolver,Composer,AE,Range>(ae, parts[BOOST_PARTS-1], cutoff);
- boost::for_each(tasks, &boost::interthreads::wait_act<task_type>);
-
- //std::cout << "par_inplace_merge_fct " << size << ">>"<< std::endl;
- #if BOOST_PARTS == 4
- partition<Range> sorted(range, BOOST_PARTS/2);
- Composer composer;
- for (unsigned i=0;i < BOOST_PARTS-1; ++i) {
- task_type tmp(ae.submit(
- boost::bind(
- composer,
- parts[i]
- )));
- tasks.push_back(tmp);
- }
- boost::for_each(tasks, &boost::interthreads::wait_act<task_type>);
- #endif
- Composer()(range);
-
- //std::cout << "par_ " << size << ">>"<< std::endl;
-
- }
- }
-
-struct sort_fct {
- template<class RandomAccessRange>
- RandomAccessRange& operator()(RandomAccessRange rng) {
- return boost::sort(rng);
- }
-};
-
-struct inplace_merge_fct {
- template<class BidirectionalRange>
- BidirectionalRange&
- operator()( BidirectionalRange rng) {
- return boost::inplace_merge(rng, boost::begin(rng)+(boost::size(rng)/2));
- }
-};
-template <typename AE, typename Range>
-void parallel_sort(AE& ae, Range& range, unsigned cutoff=10000) {
- boost::iterator_range<typename boost::range_iterator<Range>::type> rng(range);
- inplace_solve<sort_fct,inplace_merge_fct,pool_type,Range>( ae, rng, cutoff);
-}
-
-int sorted[NN];
-int values1[NN];
-int values2[NN];
-int values3[NN];
-int values4[NN];
-int values5[NN];
-int values6[NN];
-
-int main() {
- for (unsigned i=0; i<NN; ++i) sorted[i]=i;
-
- for (unsigned i=0; i<NN; ++i) values1[i]=NN-i-1;
- {
- std::cout << "std::sort: reverse 0.." << NN;
- scoped_timer t; // start timing
- std::sort(boost::begin(values1), boost::end(values1));
- }
- assert(boost::equal(values1, sorted));
- {
- std::cout << "std::sort: 0.." << NN;
- scoped_timer t; // start timing
- std::sort(boost::begin(values1), boost::end(values1));
- }
-
- for (unsigned i=0; i<NN; ++i) values2[i]=NN-i-1;
- {
- std::cout << "boost::sort: reverse 0.."<<NN;
- scoped_timer t; // start timing
- boost::sort(values2);
- }
- assert(boost::equal(values2, sorted));
- {
- std::cout << "boost::sort: 0.."<<NN;
- scoped_timer t; // start timing
- boost::sort(values2);
- }
-
- // creates a threadpool with two worker-threads
- pool_type pool( boost::tp::poolsize(BOOST_NB_OF_THREADS) );
-
- for (unsigned i=0; i<NN; ++i) values5[i]=NN-i-1;
- {
- std::cout << "parallel_sort "<<NN/2<<": reverse 0.."<<NN;
- scoped_timer tmr; // start timing
- parallel_sort(pool, values5, NN/2);
- }
- assert(boost::equal(values5, sorted));
- {
- std::cout << "parallel_sort "<<NN/2<<": 0.."<<NN;
- scoped_timer tmr; // start timing
- parallel_sort(pool, values5, NN/2);
- }
-
- for (unsigned i=0; i<NN; ++i) values5[i]=NN-i-1;
- {
- std::cout << "parallel_sort "<<NN/4<<": reverse 0.."<<NN;
- scoped_timer tmr; // start timing
- parallel_sort(pool, values5, NN/4);
- }
- assert(boost::equal(values5, sorted));
- {
- std::cout << "parallel_sort "<<NN/4<<": 0.."<<NN;
- scoped_timer tmr; // start timing
- parallel_sort(pool, values5, NN/4);
- }
-
- for (unsigned i=0; i<NN; ++i) values5[i]=NN-i-1;
- {
- std::cout << "parallel_sort "<<NN/8<<": reverse 0.."<<NN;
- scoped_timer tmr; // start timing
- parallel_sort(pool, values5, NN/8);
- }
- assert(boost::equal(values5, sorted));
- {
- std::cout << "parallel_sort "<<NN/8<<": 0.."<<NN;
- scoped_timer tmr; // start timing
- parallel_sort(pool, values5, NN/8);
- }
-
- for (unsigned i=0; i<NN; ++i) values5[i]=NN-i-1;
- {
- std::cout << "parallel_sort "<<NN/16<<": reverse 0.."<<NN;
- scoped_timer tmr; // start timing
- parallel_sort(pool, values5, NN/16);
- }
- assert(boost::equal(values5, sorted));
- {
- std::cout << "parallel_sort "<<NN/16<<": 0.."<<NN;
- scoped_timer tmr; // start timing
- parallel_sort(pool, values5, NN/16);
- }
-
-#if 0
- for (unsigned i=0; i<NN; ++i) values5[i]=NN-i-1;
- {
- std::cout << "parallel_sort "<<NN/32<<": reverse 0.."<<NN;
- scoped_timer tmr; // start timing
- parallel_sort(pool, values5, NN/32);
- }
- assert(boost::equal(values5, sorted));
- {
- std::cout << "parallel_sort "<<NN/32<<": 0.."<<NN;
- scoped_timer tmr; // start timing
- parallel_sort(pool, values5, NN/32);
- }
-#endif
-
- //std::cout << "shutdown"<< std::endl;
- //pool.shutdown();
- std::cout << "end"<< std::endl;
- return 0;
-}
-#endif
Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk