同步操作将从 Gitee 极速下载/cpp-taskflow 强制同步,此操作会覆盖自 Fork 仓库以来所做的任何修改,且无法恢复!!!
确定后同步将在后台操作,完成时将刷新页面,请耐心等待。
<?xml version='1.0' encoding='UTF-8' standalone='no'?><doxygen xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:noNamespaceSchemaLocation="compound.xsd" version="1.12.0" xml:lang="en-US"><compounddef id="GraphProcessingPipeline" kind="page"><compoundname>GraphProcessingPipeline</compoundname><title>Graph Processing Pipeline</title><tableofcontents><tocsect><name>Formulate the Graph Processing Pipeline Problem</name><reference>GraphProcessingPipeline_1FormulateTheGraphProcessingPipelineProblem</reference></tocsect><tocsect><name>Create a Graph Processing Pipeline</name><reference>GraphProcessingPipeline_1CreateAGraphProcessingPipeline</reference><tableofcontents><tocsect><name>Find a Topological Order of the Graph</name><reference>GraphProcessingPipeline_1GraphPipelineFindATopologicalOrderOfTheGraph</reference></tocsect><tocsect><name>Define the Stage Function</name><reference>GraphProcessingPipeline_1GraphPipelineDefineTheStageFunction</reference></tocsect><tocsect><name>Define the Pipes</name><reference>GraphProcessingPipeline_1GraphPipelineDefineThePipes</reference></tocsect><tocsect><name>Define the Task Graph</name><reference>GraphProcessingPipeline_1GraphPipelineDefineTheTaskGraph</reference></tocsect><tocsect><name>Submit the Task Graph</name><reference>GraphProcessingPipeline_1GraphPipelineSubmitTheTaskGraph</reference></tocsect></tableofcontents></tocsect><tocsect><name>Reference</name><reference>GraphProcessingPipeline_1GraphPipelineReference</reference></tocsect></tableofcontents><briefdescription></briefdescription><detaileddescription><para>We study a graph processing pipeline that propagates a sequence of linearly dependent tasks over a dependency graph. In this particular workload, we will learn how to transform task graph parallelism into pipeline parallelism.</para><sect1 id="GraphProcessingPipeline_1FormulateTheGraphProcessingPipelineProblem"><title>Formulate the Graph Processing Pipeline Problem</title><para>Given a directed acyclic graph (DAG), where each node encapsulates a sequence of linearly dependent tasks, namely <emphasis>stage tasks</emphasis>, and each edge represents a dependency between two tasks at the same stages of adjacent nodes. For example, assuming <computeroutput>fi(u)</computeroutput> represents the <computeroutput>i</computeroutput><superscript>th</superscript>-stage task of node <computeroutput>u</computeroutput>, a dependency from <computeroutput>u</computeroutput> to <computeroutput>v</computeroutput> requires <computeroutput>fi(u)</computeroutput> to run before <computeroutput>fi(v)</computeroutput>. The following figures shows an example of three stage tasks in a DAG of three nodes (<computeroutput>A</computeroutput>, <computeroutput>B</computeroutput>, and <computeroutput>C</computeroutput>) and two dependencies (<computeroutput>A->B</computeroutput> and <computeroutput>A->C</computeroutput>):</para><para><dotfile name="graph_pipeline_1.dot"></dotfile></para><para>While we can directly create a taskflow for the DAG (i.e., each task in the taskflow runs <computeroutput>f1</computeroutput>, <computeroutput>f2</computeroutput>, and <computeroutput>f3</computeroutput> sequentially), we can describe the parallelism as a three-stage pipeline that propagates a topological order of the DAG through three stage tasks. Consider a valid topological order of this DAG, <computeroutput>A, B, C</computeroutput>, its pipeline parallelism can be illustrated in the following figure:</para><para><dotfile name="graph_pipeline_2.dot"></dotfile></para><para>At the beginning, <computeroutput>f1(A)</computeroutput> runs first. When <computeroutput>f1(A)</computeroutput> completes, it moves on to <computeroutput>f2(A)</computeroutput> and, meanwhile, <computeroutput>f1(B)</computeroutput> can start to run together with <computeroutput>f2(A)</computeroutput>, and so on so forth. The straight line represents two parallel tasks that can overlap in time in the pipeline. For example, <computeroutput>f3(A)</computeroutput>, <computeroutput>f2(B)</computeroutput>, and <computeroutput>f1(C)</computeroutput> can run simultaneously. The following figures shows the task dependency graph of this pipeline workload:</para><para><dotfile name="graph_pipeline_3.dot"></dotfile></para><para>As we can see, tasks in diagonal lines (lower-left to upper-right) can run in parallel. This type of parallelism is also referred to as <emphasis>wavefront</emphasis> parallelism, which sweeps parallel elements in a diagonal direction.</para><para><simplesect kind="attention"><para>Depending on the graph size and the number of stage tasks, task graph parallelism and pipeline parallelism can bring very different performance results. For example, a small graph will a long chain of stage tasks may perform better with pipeline parallelism than task graph parallelism, and vice versa.</para></simplesect></para></sect1><sect1 id="GraphProcessingPipeline_1CreateAGraphProcessingPipeline"><title>Create a Graph Processing Pipeline</title><para>Using the example from the previous section, we create a three-stage pipeline that encapsulates the three stage tasks (<computeroutput>f1, f2, f3</computeroutput>) in three pipes. By finding a topological order of the graph, we can transform the node dependency into a sequence of linearly dependent data tokens to feed into the pipeline. The overall implementation is shown below:</para><para><programlisting filename=".cpp"><codeline><highlight class="preprocessor">#include<sp/><<ref refid="taskflow_8hpp" kindref="compound">taskflow/taskflow.hpp</ref>></highlight><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"></highlight><highlight class="preprocessor">#include<sp/><<ref refid="pipeline_8hpp" kindref="compound">taskflow/algorithm/pipeline.hpp</ref>></highlight><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"></highlight><highlight class="comment">//<sp/>1st-stage<sp/>function</highlight><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"></highlight><highlight class="keywordtype">void</highlight><highlight class="normal"><sp/>f1(</highlight><highlight class="keyword">const</highlight><highlight class="normal"><sp/><ref refid="cpp/string/basic_string" kindref="compound" external="/Users/twhuang/Code/taskflow/doxygen/cppreference-doxygen-web.tag.xml">std::string</ref>&<sp/>node)<sp/>{</highlight></codeline><codeline><highlight class="normal"><sp/><sp/>printf(</highlight><highlight class="stringliteral">"f1(%s)\n"</highlight><highlight class="normal">,<sp/>node.c_str());</highlight></codeline><codeline><highlight class="normal">}</highlight></codeline><codeline><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"></highlight><highlight class="comment">//<sp/>2nd-stage<sp/>function</highlight><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"></highlight><highlight class="keywordtype">void</highlight><highlight class="normal"><sp/>f2(</highlight><highlight class="keyword">const</highlight><highlight class="normal"><sp/><ref refid="cpp/string/basic_string" kindref="compound" external="/Users/twhuang/Code/taskflow/doxygen/cppreference-doxygen-web.tag.xml">std::string</ref>&<sp/>node)<sp/>{</highlight></codeline><codeline><highlight class="normal"><sp/><sp/>printf(</highlight><highlight class="stringliteral">"f2(%s)\n"</highlight><highlight class="normal">,<sp/>node.c_str());</highlight></codeline><codeline><highlight class="normal">}</highlight></codeline><codeline><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"></highlight><highlight class="comment">//<sp/>3rd-stage<sp/>function</highlight><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"></highlight><highlight class="keywordtype">void</highlight><highlight class="normal"><sp/>f3(</highlight><highlight class="keyword">const</highlight><highlight class="normal"><sp/><ref refid="cpp/string/basic_string" kindref="compound" external="/Users/twhuang/Code/taskflow/doxygen/cppreference-doxygen-web.tag.xml">std::string</ref>&<sp/>node)<sp/>{</highlight></codeline><codeline><highlight class="normal"><sp/><sp/><ref refid="cpp/io/c/fprintf" kindref="compound" external="/Users/twhuang/Code/taskflow/doxygen/cppreference-doxygen-web.tag.xml">printf</ref>(</highlight><highlight class="stringliteral">"f3(%s)\n"</highlight><highlight class="normal">,<sp/>node.c_str());</highlight></codeline><codeline><highlight class="normal">}</highlight></codeline><codeline><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"></highlight><highlight class="keywordtype">int</highlight><highlight class="normal"><sp/>main()<sp/>{</highlight></codeline><codeline><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"><sp/><sp/><ref refid="classtf_1_1Taskflow" kindref="compound">tf::Taskflow</ref><sp/>taskflow(</highlight><highlight class="stringliteral">"graph<sp/>processing<sp/>pipeline"</highlight><highlight class="normal">);</highlight></codeline><codeline><highlight class="normal"><sp/><sp/><ref refid="classtf_1_1Executor" kindref="compound">tf::Executor</ref><sp/>executor;</highlight></codeline><codeline><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"><sp/><sp/></highlight><highlight class="keyword">const</highlight><highlight class="normal"><sp/></highlight><highlight class="keywordtype">size_t</highlight><highlight class="normal"><sp/>num_lines<sp/>=<sp/>2;</highlight></codeline><codeline><highlight class="normal"><sp/><sp/></highlight></codeline><codeline><highlight class="normal"><sp/><sp/></highlight><highlight class="comment">//<sp/>a<sp/>topological<sp/>order<sp/>of<sp/>the<sp/>graph</highlight><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"><sp/><sp/></highlight><highlight class="comment">//<sp/><sp/><sp/><sp/>|-><sp/>B</highlight><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"><sp/><sp/></highlight><highlight class="comment">//<sp/>A--|</highlight><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"><sp/><sp/></highlight><highlight class="comment">//<sp/><sp/><sp/><sp/>|-><sp/>C</highlight><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"><sp/><sp/></highlight><highlight class="keyword">const</highlight><highlight class="normal"><sp/><ref refid="cpp/container/vector" kindref="compound" external="/Users/twhuang/Code/taskflow/doxygen/cppreference-doxygen-web.tag.xml">std::vector<std::string></ref><sp/>nodes<sp/>=<sp/>{</highlight><highlight class="stringliteral">"A"</highlight><highlight class="normal">,<sp/></highlight><highlight class="stringliteral">"B"</highlight><highlight class="normal">,<sp/></highlight><highlight class="stringliteral">"C"</highlight><highlight class="normal">};</highlight></codeline><codeline><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"><sp/><sp/></highlight><highlight class="comment">//<sp/>the<sp/>pipeline<sp/>consists<sp/>of<sp/>three<sp/>serial<sp/>pipes</highlight><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"><sp/><sp/></highlight><highlight class="comment">//<sp/>and<sp/>up<sp/>to<sp/>two<sp/>concurrent<sp/>scheduling<sp/>tokens</highlight><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"><sp/><sp/><ref refid="classtf_1_1Pipeline" kindref="compound">tf::Pipeline</ref><sp/>pl(num_lines,</highlight></codeline><codeline><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"><sp/><sp/><sp/><sp/></highlight><highlight class="comment">//<sp/>first<sp/>pipe<sp/>calls<sp/>f1</highlight><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"><sp/><sp/><sp/><sp/><ref refid="classtf_1_1Pipe" kindref="compound">tf::Pipe</ref>{<ref refid="namespacetf_1abb7a11e41fd457f69e7ff45d4c769564a7b804a28d6154ab8007287532037f1d0" kindref="member">tf::PipeType::SERIAL</ref>,<sp/>[&](<ref refid="classtf_1_1Pipeflow" kindref="compound">tf::Pipeflow</ref>&<sp/>pf)<sp/>{</highlight></codeline><codeline><highlight class="normal"><sp/><sp/><sp/><sp/><sp/><sp/></highlight><highlight class="keywordflow">if</highlight><highlight class="normal">(pf.token()<sp/>==<sp/>nodes.size())<sp/>{</highlight></codeline><codeline><highlight class="normal"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>pf.stop();</highlight></codeline><codeline><highlight class="normal"><sp/><sp/><sp/><sp/><sp/><sp/>}</highlight></codeline><codeline><highlight class="normal"><sp/><sp/><sp/><sp/><sp/><sp/></highlight><highlight class="keywordflow">else</highlight><highlight class="normal"><sp/>{</highlight></codeline><codeline><highlight class="normal"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>f1(nodes[pf.token()]);</highlight></codeline><codeline><highlight class="normal"><sp/><sp/><sp/><sp/><sp/><sp/>}</highlight></codeline><codeline><highlight class="normal"><sp/><sp/><sp/><sp/>}},</highlight></codeline><codeline><highlight class="normal"><sp/><sp/><sp/><sp/></highlight></codeline><codeline><highlight class="normal"><sp/><sp/><sp/><sp/></highlight><highlight class="comment">//<sp/>second<sp/>pipe<sp/>calls<sp/>f2</highlight><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"><sp/><sp/><sp/><sp/><ref refid="classtf_1_1Pipe" kindref="compound">tf::Pipe</ref>{<ref refid="namespacetf_1abb7a11e41fd457f69e7ff45d4c769564a7b804a28d6154ab8007287532037f1d0" kindref="member">tf::PipeType::SERIAL</ref>,<sp/>[&](<ref refid="classtf_1_1Pipeflow" kindref="compound">tf::Pipeflow</ref>&<sp/>pf)<sp/>{</highlight></codeline><codeline><highlight class="normal"><sp/><sp/><sp/><sp/><sp/><sp/>f2(nodes[pf.token()]);</highlight></codeline><codeline><highlight class="normal"><sp/><sp/><sp/><sp/>}},</highlight></codeline><codeline><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"><sp/><sp/><sp/><sp/></highlight><highlight class="comment">//<sp/>third<sp/>pipe<sp/>calls<sp/>f3</highlight><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"><sp/><sp/><sp/><sp/><ref refid="classtf_1_1Pipe" kindref="compound">tf::Pipe</ref>{<ref refid="namespacetf_1abb7a11e41fd457f69e7ff45d4c769564a7b804a28d6154ab8007287532037f1d0" kindref="member">tf::PipeType::SERIAL</ref>,<sp/>[&](<ref refid="classtf_1_1Pipeflow" kindref="compound">tf::Pipeflow</ref>&<sp/>pf)<sp/>{</highlight></codeline><codeline><highlight class="normal"><sp/><sp/><sp/><sp/><sp/><sp/>f3(nodes[pf.token()]);</highlight></codeline><codeline><highlight class="normal"><sp/><sp/><sp/><sp/>}}</highlight></codeline><codeline><highlight class="normal"><sp/><sp/>);</highlight></codeline><codeline><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"><sp/><sp/></highlight><highlight class="comment">//<sp/>build<sp/>the<sp/>pipeline<sp/>graph<sp/>using<sp/>composition</highlight><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"><sp/><sp/><ref refid="classtf_1_1Task" kindref="compound">tf::Task</ref><sp/>init<sp/>=<sp/>taskflow.emplace([](){<sp/><ref refid="cpp/io/basic_ostream" kindref="compound" external="/Users/twhuang/Code/taskflow/doxygen/cppreference-doxygen-web.tag.xml">std::cout</ref><sp/><<<sp/></highlight><highlight class="stringliteral">"ready\n"</highlight><highlight class="normal">;<sp/>})</highlight></codeline><codeline><highlight class="normal"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>.name(</highlight><highlight class="stringliteral">"starting<sp/>pipeline"</highlight><highlight class="normal">);</highlight></codeline><codeline><highlight class="normal"><sp/><sp/><ref refid="classtf_1_1Task" kindref="compound">tf::Task</ref><sp/>task<sp/>=<sp/>taskflow.<ref refid="classtf_1_1Task_1ab38be520fe700cb4ca1f312308a95585" kindref="member">composed_of</ref>(pl)</highlight></codeline><codeline><highlight class="normal"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>.<ref refid="classtf_1_1Task_1a08ada0425b490997b6ff7f310107e5e3" kindref="member">name</ref>(</highlight><highlight class="stringliteral">"pipeline"</highlight><highlight class="normal">);</highlight></codeline><codeline><highlight class="normal"><sp/><sp/><ref refid="classtf_1_1Task" kindref="compound">tf::Task</ref><sp/>stop<sp/>=<sp/>taskflow.emplace([](){<sp/><ref refid="cpp/io/basic_ostream" kindref="compound" external="/Users/twhuang/Code/taskflow/doxygen/cppreference-doxygen-web.tag.xml">std::cout</ref><sp/><<<sp/></highlight><highlight class="stringliteral">"stopped\n"</highlight><highlight class="normal">;<sp/>})</highlight></codeline><codeline><highlight class="normal"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>.name(</highlight><highlight class="stringliteral">"pipeline<sp/>stopped"</highlight><highlight class="normal">);</highlight></codeline><codeline><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"><sp/><sp/></highlight><highlight class="comment">//<sp/>create<sp/>task<sp/>dependency</highlight><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"><sp/><sp/>init.<ref refid="classtf_1_1Task_1a8c78c453295a553c1c016e4062da8588" kindref="member">precede</ref>(task);</highlight></codeline><codeline><highlight class="normal"><sp/><sp/>task.<ref refid="classtf_1_1Task_1a8c78c453295a553c1c016e4062da8588" kindref="member">precede</ref>(stop);</highlight></codeline><codeline><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"><sp/><sp/></highlight><highlight class="comment">//<sp/>dump<sp/>the<sp/>pipeline<sp/>graph<sp/>structure<sp/>(with<sp/>composition)</highlight><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"><sp/><sp/>taskflow.<ref refid="classtf_1_1Task_1a3318a49ff9d0a01cd1e8ee675251e3b7" kindref="member">dump</ref>(<ref refid="cpp/io/basic_ostream" kindref="compound" external="/Users/twhuang/Code/taskflow/doxygen/cppreference-doxygen-web.tag.xml">std::cout</ref>);</highlight></codeline><codeline><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"><sp/><sp/></highlight><highlight class="comment">//<sp/>run<sp/>the<sp/>pipeline</highlight><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"><sp/><sp/>executor.<ref refid="classtf_1_1Executor_1a519777f5783981d534e9e53b99712069" kindref="member">run</ref>(taskflow).wait();</highlight></codeline><codeline><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"><sp/><sp/></highlight><highlight class="keywordflow">return</highlight><highlight class="normal"><sp/>0;</highlight></codeline><codeline><highlight class="normal">}</highlight></codeline></programlisting></para><sect2 id="GraphProcessingPipeline_1GraphPipelineFindATopologicalOrderOfTheGraph"><title>Find a Topological Order of the Graph</title><para>The first step is to find a valid topological order of the graph, such that we can transform the graph dependency into a linear sequence. In this example, we simply hard-code it:</para><para><programlisting filename=".cpp"><codeline><highlight class="keyword">const</highlight><highlight class="normal"><sp/><ref refid="cpp/container/vector" kindref="compound" external="/Users/twhuang/Code/taskflow/doxygen/cppreference-doxygen-web.tag.xml">std::vector<std::string></ref><sp/>nodes<sp/>=<sp/>{</highlight><highlight class="stringliteral">"A"</highlight><highlight class="normal">,<sp/></highlight><highlight class="stringliteral">"B"</highlight><highlight class="normal">,<sp/></highlight><highlight class="stringliteral">"C"</highlight><highlight class="normal">};</highlight></codeline></programlisting></para></sect2><sect2 id="GraphProcessingPipeline_1GraphPipelineDefineTheStageFunction"><title>Define the Stage Function</title><para>This particular workload does not propagate data directly through the pipeline. In most situations, data is directly stored in a custom graph data structure, and the stage function will just need to know which node to process. For demo's sake, we simply output a message to show which stage function is processing which node:</para><para><programlisting filename=".cpp"><codeline><highlight class="comment">//<sp/>1st-stage<sp/>function</highlight><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"></highlight><highlight class="keywordtype">void</highlight><highlight class="normal"><sp/>f1(</highlight><highlight class="keyword">const</highlight><highlight class="normal"><sp/><ref refid="cpp/string/basic_string" kindref="compound" external="/Users/twhuang/Code/taskflow/doxygen/cppreference-doxygen-web.tag.xml">std::string</ref>&<sp/>node)<sp/>{</highlight></codeline><codeline><highlight class="normal"><sp/><sp/>printf(</highlight><highlight class="stringliteral">"f1(%s)\n"</highlight><highlight class="normal">,<sp/>node.c_str());</highlight></codeline><codeline><highlight class="normal">}</highlight></codeline><codeline><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"></highlight><highlight class="comment">//<sp/>2nd-stage<sp/>function</highlight><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"></highlight><highlight class="keywordtype">void</highlight><highlight class="normal"><sp/>f2(</highlight><highlight class="keyword">const</highlight><highlight class="normal"><sp/><ref refid="cpp/string/basic_string" kindref="compound" external="/Users/twhuang/Code/taskflow/doxygen/cppreference-doxygen-web.tag.xml">std::string</ref>&<sp/>node)<sp/>{</highlight></codeline><codeline><highlight class="normal"><sp/><sp/>printf(</highlight><highlight class="stringliteral">"f2(%s)\n"</highlight><highlight class="normal">,<sp/>node.c_str());</highlight></codeline><codeline><highlight class="normal">}</highlight></codeline><codeline><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"></highlight><highlight class="comment">//<sp/>3rd-stage<sp/>function</highlight><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"></highlight><highlight class="keywordtype">void</highlight><highlight class="normal"><sp/>f3(</highlight><highlight class="keyword">const</highlight><highlight class="normal"><sp/><ref refid="cpp/string/basic_string" kindref="compound" external="/Users/twhuang/Code/taskflow/doxygen/cppreference-doxygen-web.tag.xml">std::string</ref>&<sp/>node)<sp/>{</highlight></codeline><codeline><highlight class="normal"><sp/><sp/><ref refid="cpp/io/c/fprintf" kindref="compound" external="/Users/twhuang/Code/taskflow/doxygen/cppreference-doxygen-web.tag.xml">printf</ref>(</highlight><highlight class="stringliteral">"f3(%s)\n"</highlight><highlight class="normal">,<sp/>node.c_str());</highlight></codeline><codeline><highlight class="normal">}</highlight></codeline></programlisting></para><para><simplesect kind="attention"><para>A key advantage of Taskflow's pipeline programming model is that we do not provide any data abstraction but give users full control over data management, which is typically application-dependent. In an application like this graph processing pipeline, data is managed in a global custom graph data structure, and any data abstraction provided by the library can become a unnecessary overhead.</para></simplesect></para></sect2><sect2 id="GraphProcessingPipeline_1GraphPipelineDefineThePipes"><title>Define the Pipes</title><para>The pipe structure is straightforward. Each pipe encapsulates the corresponding stage function and passes the node into the function argument. The first pipe will cease the pipeline scheduling when it has processed all nodes. To identify which node is being processed at a running pipe, we use <ref refid="classtf_1_1Pipeflow_1a295e5d884665c076f4ef5d78139f7c51" kindref="member">tf::Pipeflow::token</ref> to find the index:</para><para><programlisting filename=".cpp"><codeline><highlight class="comment">//<sp/>first<sp/>pipe<sp/>calls<sp/>f1</highlight><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"><ref refid="classtf_1_1Pipe" kindref="compound">tf::Pipe</ref>{<ref refid="namespacetf_1abb7a11e41fd457f69e7ff45d4c769564a7b804a28d6154ab8007287532037f1d0" kindref="member">tf::PipeType::SERIAL</ref>,<sp/>[&](<ref refid="classtf_1_1Pipeflow" kindref="compound">tf::Pipeflow</ref>&<sp/>pf)<sp/>{</highlight></codeline><codeline><highlight class="normal"><sp/><sp/></highlight><highlight class="keywordflow">if</highlight><highlight class="normal">(pf.token()<sp/>==<sp/>nodes.size())<sp/>{</highlight></codeline><codeline><highlight class="normal"><sp/><sp/><sp/><sp/>pf.stop();</highlight></codeline><codeline><highlight class="normal"><sp/><sp/>}</highlight></codeline><codeline><highlight class="normal"><sp/><sp/></highlight><highlight class="keywordflow">else</highlight><highlight class="normal"><sp/>{</highlight></codeline><codeline><highlight class="normal"><sp/><sp/><sp/><sp/>f1(nodes[pf.token()]);</highlight></codeline><codeline><highlight class="normal"><sp/><sp/>}</highlight></codeline><codeline><highlight class="normal">}},</highlight></codeline><codeline><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"></highlight><highlight class="comment">//<sp/>second<sp/>pipe<sp/>calls<sp/>f2</highlight><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"><ref refid="classtf_1_1Pipe" kindref="compound">tf::Pipe</ref>{<ref refid="namespacetf_1abb7a11e41fd457f69e7ff45d4c769564a7b804a28d6154ab8007287532037f1d0" kindref="member">tf::PipeType::SERIAL</ref>,<sp/>[&](<ref refid="classtf_1_1Pipeflow" kindref="compound">tf::Pipeflow</ref>&<sp/>pf)<sp/>{</highlight></codeline><codeline><highlight class="normal"><sp/><sp/>f2(nodes[pf.token()]);</highlight></codeline><codeline><highlight class="normal">}},</highlight></codeline><codeline><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"></highlight><highlight class="comment">//<sp/>third<sp/>pipe<sp/>calls<sp/>f3</highlight><highlight class="normal"></highlight></codeline><codeline><highlight class="normal"><ref refid="classtf_1_1Pipe" kindref="compound">tf::Pipe</ref>{<ref refid="namespacetf_1abb7a11e41fd457f69e7ff45d4c769564a7b804a28d6154ab8007287532037f1d0" kindref="member">tf::PipeType::SERIAL</ref>,<sp/>[&](<ref refid="classtf_1_1Pipeflow" kindref="compound">tf::Pipeflow</ref>&<sp/>pf)<sp/>{</highlight></codeline><codeline><highlight class="normal"><sp/><sp/>f3(nodes[pf.token()]);</highlight></codeline><codeline><highlight class="normal">}}</highlight></codeline></programlisting></para></sect2><sect2 id="GraphProcessingPipeline_1GraphPipelineDefineTheTaskGraph"><title>Define the Task Graph</title><para>To build up the taskflow for the pipeline, we create a module task with the defined pipeline structure and connect it with two tasks that output helper messages before and after the pipeline:</para><para><programlisting filename=".cpp"><codeline><highlight class="normal"><ref refid="classtf_1_1Task" kindref="compound">tf::Task</ref><sp/>init<sp/>=<sp/>taskflow.emplace([](){<sp/><ref refid="cpp/io/basic_ostream" kindref="compound" external="/Users/twhuang/Code/taskflow/doxygen/cppreference-doxygen-web.tag.xml">std::cout</ref><sp/><<<sp/></highlight><highlight class="stringliteral">"ready\n"</highlight><highlight class="normal">;<sp/>})</highlight></codeline><codeline><highlight class="normal"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>.name(</highlight><highlight class="stringliteral">"starting<sp/>pipeline"</highlight><highlight class="normal">);</highlight></codeline><codeline><highlight class="normal"><ref refid="classtf_1_1Task" kindref="compound">tf::Task</ref><sp/>task<sp/>=<sp/>taskflow.<ref refid="classtf_1_1Task_1ab38be520fe700cb4ca1f312308a95585" kindref="member">composed_of</ref>(pl)</highlight></codeline><codeline><highlight class="normal"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>.<ref refid="classtf_1_1Task_1a08ada0425b490997b6ff7f310107e5e3" kindref="member">name</ref>(</highlight><highlight class="stringliteral">"pipeline"</highlight><highlight class="normal">);</highlight></codeline><codeline><highlight class="normal"><ref refid="classtf_1_1Task" kindref="compound">tf::Task</ref><sp/>stop<sp/>=<sp/>taskflow.emplace([](){<sp/><ref refid="cpp/io/basic_ostream" kindref="compound" external="/Users/twhuang/Code/taskflow/doxygen/cppreference-doxygen-web.tag.xml">std::cout</ref><sp/><<<sp/></highlight><highlight class="stringliteral">"stopped\n"</highlight><highlight class="normal">;<sp/>})</highlight></codeline><codeline><highlight class="normal"><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/><sp/>.name(</highlight><highlight class="stringliteral">"pipeline<sp/>stopped"</highlight><highlight class="normal">);</highlight></codeline><codeline><highlight class="normal">init.<ref refid="classtf_1_1Task_1a8c78c453295a553c1c016e4062da8588" kindref="member">precede</ref>(task);</highlight></codeline><codeline><highlight class="normal">task.<ref refid="classtf_1_1Task_1a8c78c453295a553c1c016e4062da8588" kindref="member">precede</ref>(stop);</highlight></codeline></programlisting></para><para><dotfile name="graph_pipeline_4.dot"></dotfile></para></sect2><sect2 id="GraphProcessingPipeline_1GraphPipelineSubmitTheTaskGraph"><title>Submit the Task Graph</title><para>Finally, we submit the taskflow to the execution and run it once:</para><para><programlisting filename=".cpp"><codeline><highlight class="normal">executor.<ref refid="classtf_1_1Executor_1a519777f5783981d534e9e53b99712069" kindref="member">run</ref>(taskflow).wait();</highlight></codeline></programlisting></para><para>Three possible outputs are shown below:</para><para><programlisting filename=".bash"><codeline><highlight class="normal">#<sp/>possible<sp/>output<sp/>1</highlight></codeline><codeline><highlight class="normal">ready</highlight></codeline><codeline><highlight class="normal">f1(A)</highlight></codeline><codeline><highlight class="normal">f2(A)</highlight></codeline><codeline><highlight class="normal">f1(B)</highlight></codeline><codeline><highlight class="normal">f2(B)</highlight></codeline><codeline><highlight class="normal">f3(A)</highlight></codeline><codeline><highlight class="normal">f1(C)</highlight></codeline><codeline><highlight class="normal">f2(C)</highlight></codeline><codeline><highlight class="normal">f3(B)</highlight></codeline><codeline><highlight class="normal">f3(C)</highlight></codeline><codeline><highlight class="normal">stopped</highlight></codeline><codeline></codeline><codeline><highlight class="normal">#<sp/>possible<sp/>output<sp/>2</highlight></codeline><codeline><highlight class="normal">f1(A)</highlight></codeline><codeline><highlight class="normal">f2(A)</highlight></codeline><codeline><highlight class="normal">f3(A)</highlight></codeline><codeline><highlight class="normal">f1(B)</highlight></codeline><codeline><highlight class="normal">f2(B)</highlight></codeline><codeline><highlight class="normal">f3(B)</highlight></codeline><codeline><highlight class="normal">f1(C)</highlight></codeline><codeline><highlight class="normal">f2(C)</highlight></codeline><codeline><highlight class="normal">f3(C)</highlight></codeline><codeline><highlight class="normal">stopped</highlight></codeline><codeline></codeline><codeline><highlight class="normal">#<sp/>possible<sp/>output<sp/>3</highlight></codeline><codeline><highlight class="normal">ready</highlight></codeline><codeline><highlight class="normal">f1(A)</highlight></codeline><codeline><highlight class="normal">f2(A)</highlight></codeline><codeline><highlight class="normal">f3(A)</highlight></codeline><codeline><highlight class="normal">f1(B)</highlight></codeline><codeline><highlight class="normal">f2(B)</highlight></codeline><codeline><highlight class="normal">f1(C)</highlight></codeline><codeline><highlight class="normal">f2(C)</highlight></codeline><codeline><highlight class="normal">f3(B)</highlight></codeline><codeline><highlight class="normal">f3(C)</highlight></codeline><codeline><highlight class="normal">stopped</highlight></codeline></programlisting></para></sect2></sect1><sect1 id="GraphProcessingPipeline_1GraphPipelineReference"><title>Reference</title><para>We have applied the graph processing pipeline technique to speed up a circuit analysis problem. Details can be referred to our publication below:</para><para><itemizedlist><listitem><para>Cheng-Hsiang Chiu and Tsung-Wei Huang, "<ulink url="https://tsung-wei-huang.github.io/papers/dac2022.pdf">Efficient Timing Propagation with Simultaneous Structural and Pipeline Parallelisms</ulink>," <emphasis>ACM/IEEE Design Automation Conference (DAC)</emphasis>, San Francisco, CA, 2022 </para></listitem></itemizedlist></para></sect1></detaileddescription><location file="doxygen/examples/graph_pipeline.dox"/></compounddef></doxygen>
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。