cpp-taskflow/examples/taskflow_pipeline.cpp at master · feiyunwill/cpp-taskflow · GitHub

History

104 lines (86 loc) · 2.9 KB

Raw

100

101

102

103

104

// This program demonstrates how to propagates a sequence of input tokens through

// linearly dependent taskflows to implement complex parallel algorithms.

// Parallelism exhibits both inside and outside these taskflows, combining

// both task graph parallelism and pipeline parallelism.

#include <taskflow/taskflow.hpp>

#include <taskflow/algorithm/pipeline.hpp>

// taskflow on the first pipe

void make_taskflow1(tf::Taskflow& tf) {

auto [A1, B1, C1, D1] = tf.emplace(

[](){ printf("A1\n"); },

[](){ printf("B1\n"); },

[](){ printf("C1\n"); },

[](){ printf("D1\n"); }

);

A1.precede(B1, C1);

D1.succeed(B1, C1);

}

// taskflow on the second pipe

void make_taskflow2(tf::Taskflow& tf) {

auto [A2, B2, C2, D2] = tf.emplace(

[](){ printf("A2\n"); },

[](){ printf("B2\n"); },

[](){ printf("C2\n"); },

[](){ printf("D2\n"); }

);

tf.linearize({A2, B2, C2, D2});

}

// taskflow on the third pipe

void make_taskflow3(tf::Taskflow& tf) {

auto [A3, B3, C3, D3] = tf.emplace(

[](){ printf("A3\n"); },

[](){ printf("B3\n"); },

[](){ printf("C3\n"); },

[](){ printf("D3\n"); }

);

A3.precede(B3, C3, D3);

}

int main() {

tf::Taskflow taskflow("taskflow processing pipeline");

tf::Executor executor;

const size_t num_lines = 2;

const size_t num_pipes = 3;

// define the taskflow storage

// we use the pipe dimension because we create three 'serial' pipes

std::array<tf::Taskflow, num_pipes> taskflows;

// create three different taskflows for the three pipes

make_taskflow1(taskflows[0]);

make_taskflow2(taskflows[1]);

make_taskflow3(taskflows[2]);

// the pipeline consists of three serial pipes

// and up to two concurrent scheduling tokens

tf::Pipeline pl(num_lines,

// first pipe runs taskflow1

tf::Pipe{tf::PipeType::SERIAL, [&](tf::Pipeflow& pf) {

if(pf.token() == 5) { // we only handle five scheduling tokens

pf.stop();

return;

}

printf("begin token %zu\n", pf.token());

executor.corun(taskflows[pf.pipe()]);

}},

// second pipe runs taskflow2

tf::Pipe{tf::PipeType::SERIAL, [&](tf::Pipeflow& pf) {

executor.corun(taskflows[pf.pipe()]);

}},

// third pipe calls taskflow3

tf::Pipe{tf::PipeType::SERIAL, [&](tf::Pipeflow& pf) {

executor.corun(taskflows[pf.pipe()]);

}}

);

// build the pipeline graph using composition

tf::Task init = taskflow.emplace([](){ std::cout << "ready\n"; })

.name("starting pipeline");

tf::Task task = taskflow.composed_of(pl)

.name("pipeline");

tf::Task stop = taskflow.emplace([](){ std::cout << "stopped\n"; })

.name("pipeline stopped");

// create task dependency

init.precede(task);

task.precede(stop);

// dump the pipeline graph structure (with composition)

taskflow.dump(std::cout);

// run the pipeline

executor.run(taskflow).wait();

return 0;

}

cpp-taskflow/examples/taskflow_pipeline.cpp at master · feiyunwill/cpp-taskflow · GitHub

Expand file tree

Breadcrumbs

taskflow_pipeline.cpp

Latest commit

History

Breadcrumbs

taskflow_pipeline.cpp

File metadata and controls