mirror of
https://github.com/wjakob/tbb.git
synced 2026-08-30 00:50:40 +08:00
Pau Argelaguet
90 lines
3.4 KiB
C++
90 lines
3.4 KiB
C++
/*
|
|
Copyright (c) 2005-2019 Intel Corporation
|
|
|
|
Licensed under the Apache License, Version 2.0 (the "License");
|
|
you may not use this file except in compliance with the License.
|
|
You may obtain a copy of the License at
|
|
|
|
http://www.apache.org/licenses/LICENSE-2.0
|
|
|
|
Unless required by applicable law or agreed to in writing, software
|
|
distributed under the License is distributed on an "AS IS" BASIS,
|
|
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
See the License for the specific language governing permissions and
|
|
limitations under the License.
|
|
*/
|
|
|
|
/* Example program that shows how to use parallel_do to do parallel preorder
|
|
traversal of a directed acyclic graph. */
|
|
|
|
#include <cstdlib>
|
|
#include "tbb/task_scheduler_init.h"
|
|
#include "tbb/tick_count.h"
|
|
#include "../../common/utility/utility.h"
|
|
#include <iostream>
|
|
#include <vector>
|
|
#include "Graph.h"
|
|
|
|
// some forward declarations
|
|
class Cell;
|
|
void ParallelPreorderTraversal( const std::vector<Cell*>& root_set );
|
|
|
|
//------------------------------------------------------------------------
|
|
// Test driver
|
|
//------------------------------------------------------------------------
|
|
utility::thread_number_range threads(tbb::task_scheduler_init::default_num_threads);
|
|
static unsigned nodes = 1000;
|
|
static unsigned traversals = 500;
|
|
static bool SilentFlag = false;
|
|
|
|
//! Parse the command line.
|
|
static void ParseCommandLine( int argc, const char* argv[] ) {
|
|
utility::parse_cli_arguments(
|
|
argc,argv,
|
|
utility::cli_argument_pack()
|
|
//"-h" option for displaying help is present implicitly
|
|
.positional_arg(threads,"n-of-threads",utility::thread_number_range_desc)
|
|
.positional_arg(nodes,"n-of-nodes","number of nodes in the graph.")
|
|
.positional_arg(traversals,"n-of-traversals","number of times to evaluate the graph. Reduce it (e.g. to 100) to shorten example run time\n")
|
|
.arg(SilentFlag,"silent","no output except elapsed time ")
|
|
);
|
|
}
|
|
|
|
int main( int argc, const char* argv[] ) {
|
|
try {
|
|
tbb::tick_count main_start = tbb::tick_count::now();
|
|
ParseCommandLine(argc,argv);
|
|
|
|
// Start scheduler with given number of threads.
|
|
for( int p=threads.first; p<=threads.last; p = threads.step(p) ) {
|
|
tbb::tick_count t0 = tbb::tick_count::now();
|
|
tbb::task_scheduler_init init(p);
|
|
srand(2);
|
|
size_t root_set_size = 0;
|
|
{
|
|
Graph g;
|
|
g.create_random_dag(nodes);
|
|
std::vector<Cell*> root_set;
|
|
g.get_root_set(root_set);
|
|
root_set_size = root_set.size();
|
|
for( unsigned int trial=0; trial<traversals; ++trial ) {
|
|
ParallelPreorderTraversal(root_set);
|
|
}
|
|
}
|
|
tbb::tick_count::interval_t interval = tbb::tick_count::now()-t0;
|
|
if (!SilentFlag){
|
|
std::cout
|
|
<<interval.seconds()<<" seconds using "<<p<<" threads ("<<root_set_size<<" nodes in root_set)\n";
|
|
}
|
|
}
|
|
utility::report_elapsed_time((tbb::tick_count::now()-main_start).seconds());
|
|
|
|
return 0;
|
|
}catch(std::exception& e){
|
|
std::cerr
|
|
<< "unexpected error occurred. \n"
|
|
<< "error description: "<<e.what()<<std::endl;
|
|
return -1;
|
|
}
|
|
}
|