同步操作将从 Gitee 极速下载/cpp-taskflow 强制同步,此操作会覆盖自 Fork 仓库以来所做的任何修改,且无法恢复!!!
确定后同步将在后台操作,完成时将刷新页面,请耐心等待。
<!DOCTYPE html><html lang="en"><head><meta charset="UTF-8" /><title>syclFlow Algorithms » Parallel Transforms | Taskflow QuickStart</title><link rel="stylesheet" href="https://fonts.googleapis.com/css?family=Source+Sans+Pro:400,400i,600,600i%7CSource+Code+Pro:400,400i,600" /><link rel="stylesheet" href="m-dark+documentation.compiled.css" /><link rel="icon" href="favicon.ico" type="image/vnd.microsoft.icon" /><meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="theme-color" content="#22272e" /></head><body><header><nav id="navigation"><div class="m-container"><div class="m-row"><span id="m-navbar-brand" class="m-col-t-8 m-col-m-none m-left-m"><a href="https://taskflow.github.io"><img src="taskflow_logo.png" alt="" />Taskflow</a> <span class="m-breadcrumb">|</span> <a href="index.html" class="m-thin">QuickStart</a></span><div class="m-col-t-4 m-hide-m m-text-right m-nopadr"><a href="#search" class="m-doc-search-icon" title="Search" onclick="return showSearch()"><svg style="height: 0.9rem;" viewBox="0 0 16 16"><path id="m-doc-search-icon-path" d="m6 0c-3.31 0-6 2.69-6 6 0 3.31 2.69 6 6 6 1.49 0 2.85-0.541 3.89-1.44-0.0164 0.338 0.147 0.759 0.5 1.15l3.22 3.79c0.552 0.614 1.45 0.665 2 0.115 0.55-0.55 0.499-1.45-0.115-2l-3.79-3.22c-0.392-0.353-0.812-0.515-1.15-0.5 0.895-1.05 1.44-2.41 1.44-3.89 0-3.31-2.69-6-6-6zm0 1.56a4.44 4.44 0 0 1 4.44 4.44 4.44 4.44 0 0 1-4.44 4.44 4.44 4.44 0 0 1-4.44-4.44 4.44 4.44 0 0 1 4.44-4.44z"/></svg></a><a id="m-navbar-show" href="#navigation" title="Show navigation"></a><a id="m-navbar-hide" href="#" title="Hide navigation"></a></div><div id="m-navbar-collapse" class="m-col-t-12 m-show-m m-col-m-none m-right-m"><div class="m-row"><ol class="m-col-t-6 m-col-m-none"><li><a href="pages.html">Handbook</a></li><li><a href="namespaces.html">Namespaces</a></li></ol><ol class="m-col-t-6 m-col-m-none" start="3"><li><a href="annotated.html">Classes</a></li><li><a href="files.html">Files</a></li><li class="m-show-m"><a href="#search" class="m-doc-search-icon" title="Search" onclick="return showSearch()"><svg style="height: 0.9rem;" viewBox="0 0 16 16"><use href="#m-doc-search-icon-path" /></svg></a></li></ol></div></div></div></div></nav></header><main><article><div class="m-container m-container-inflatable"><div class="m-row"><div class="m-col-l-10 m-push-l-1"><h1><span class="m-breadcrumb"><a href="syclFlowAlgorithms.html">syclFlow Algorithms</a> »</span>Parallel Transforms</h1><nav class="m-block m-default"><h3>Contents</h3><ul><li><a href="#IteratorBasedParallelTransformSYCL">Iterator-based Parallel Transforms</a></li></ul></nav><p><a href="classtf_1_1syclFlow.html" class="m-doc">tf::<wbr />syclFlow</a> provides a template method, <a href="classtf_1_1syclFlow.html#ae278939334a90b6d58d8771e87b2e793" class="m-doc">tf::<wbr />syclFlow::<wbr />transform</a>, for creating a task to perform parallel transforms by applying the given function to a range of item and stores the transformed result in another range.</p><section id="IteratorBasedParallelTransformSYCL"><h2><a href="#IteratorBasedParallelTransformSYCL">Iterator-based Parallel Transforms</a></h2><p>Iterator-based parallel-transform applies the given transform function to a range of items and store the result in another range specified by two iterators, <code>first</code> and <code>last</code>. The two iterators are typically two raw pointers to the first element and the next to the last element in the range in GPU memory space. The task created by <a href="classtf_1_1syclFlow.html#ae278939334a90b6d58d8771e87b2e793" class="m-doc">tf::<wbr />syclFlow::<wbr />transform</a>(I first, I last, C&& callable, S... srcs) represents a kernel of parallel execution for the following loop:</p><pre class="m-code"><span class="k">while</span><span class="w"> </span><span class="p">(</span><span class="n">first</span><span class="w"> </span><span class="o">!=</span><span class="w"> </span><span class="n">last</span><span class="p">)</span><span class="w"> </span><span class="p">{</span><span class="w"></span><span class="w"> </span><span class="o">*</span><span class="n">first</span><span class="o">++</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">callable</span><span class="p">(</span><span class="o">*</span><span class="n">src1</span><span class="o">++</span><span class="p">,</span><span class="w"> </span><span class="o">*</span><span class="n">src2</span><span class="o">++</span><span class="p">,</span><span class="w"> </span><span class="o">*</span><span class="n">src3</span><span class="o">++</span><span class="p">,</span><span class="w"> </span><span class="p">...);</span><span class="w"></span><span class="p">}</span><span class="w"></span></pre><p>The two iterators, <code>first</code> and <code>last</code>, are typically two raw pointers to the first element and the next to the last element in the range. The following example creates a <code>transform</code> kernel that assigns each element, starting from <code>gpu_data</code> to <code>gpu_data + 1000</code>, to the sum of the corresponding elements at <code>gpu_data_x</code>, <code>gpu_data_y</code>, and <code>gpu_data_z</code>.</p><pre class="m-code"><span class="n">taskflow</span><span class="p">.</span><span class="n">emplace_on</span><span class="p">([](</span><span class="n">tf</span><span class="o">::</span><span class="n">syclFlow</span><span class="o">&</span><span class="w"> </span><span class="n">sf</span><span class="p">){</span><span class="w"></span><span class="w"> </span><span class="c1">// gpu_data[i] = gpu_data_x[i] + gpu_data_y[i] + gpu_data_z[i]</span><span class="w"> </span><span class="n">tf</span><span class="o">::</span><span class="n">syclTask</span><span class="w"> </span><span class="n">task</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">sf</span><span class="p">.</span><span class="n">transform</span><span class="p">(</span><span class="w"></span><span class="w"> </span><span class="n">gpu_data</span><span class="p">,</span><span class="w"> </span><span class="n">gpu_data</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1000</span><span class="p">,</span><span class="w"> </span><span class="w"> </span><span class="p">[]</span><span class="w"> </span><span class="p">(</span><span class="kt">int</span><span class="w"> </span><span class="n">xi</span><span class="p">,</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">yi</span><span class="p">,</span><span class="w"> </span><span class="kt">int</span><span class="w"> </span><span class="n">zi</span><span class="p">)</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="k">return</span><span class="w"> </span><span class="n">xi</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">yi</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">zi</span><span class="p">;</span><span class="w"> </span><span class="p">},</span><span class="w"></span><span class="w"> </span><span class="n">gpu_data_x</span><span class="p">,</span><span class="w"> </span><span class="n">gpu_data_y</span><span class="p">,</span><span class="w"> </span><span class="n">gpu_data_z</span><span class="w"></span><span class="w"> </span><span class="p">);</span><span class="w"> </span><span class="p">},</span><span class="w"> </span><span class="n">sycl_queue</span><span class="p">);</span><span class="w"></span></pre><p>Each iteration is independent of each other and is assigned one kernel thread to run the callable.</p></section></div></div></div></article></main><div class="m-doc-search" id="search"><a href="#!" onclick="return hideSearch()"></a><div class="m-container"><div class="m-row"><div class="m-col-m-8 m-push-m-2"><div class="m-doc-search-header m-text m-small"><div><span class="m-label m-default">Tab</span> / <span class="m-label m-default">T</span> to search, <span class="m-label m-default">Esc</span> to close</div><div id="search-symbolcount">…</div></div><div class="m-doc-search-content"><form><input type="search" name="q" id="search-input" placeholder="Loading …" disabled="disabled" autofocus="autofocus" autocomplete="off" spellcheck="false" /></form><noscript class="m-text m-danger m-text-center">Unlike everything else in the docs, the search functionality <em>requires</em> JavaScript.</noscript><div id="search-help" class="m-text m-dim m-text-center"><p class="m-noindent">Search for symbols, directories, files, pages ormodules. You can omit any prefix from the symbol or file path; adding a<code>:</code> or <code>/</code> suffix lists all members of given symbol ordirectory.</p><p class="m-noindent">Use <span class="m-label m-dim">↓</span>/ <span class="m-label m-dim">↑</span> to navigate through the list,<span class="m-label m-dim">Enter</span> to go.<span class="m-label m-dim">Tab</span> autocompletes common prefix, you cancopy a link to the result using <span class="m-label m-dim">⌘</span><span class="m-label m-dim">L</span> while <span class="m-label m-dim">⌘</span><span class="m-label m-dim">M</span> produces a Markdown link.</p></div><div id="search-notfound" class="m-text m-warning m-text-center">Sorry, nothing was found.</div><ul id="search-results"></ul></div></div></div></div></div><script src="search-v2.js"></script><script src="searchdata-v2.js" async="async"></script><footer><nav><div class="m-container"><div class="m-row"><div class="m-col-l-10 m-push-l-1"><p>Taskflow handbook is part of the <a href="https://taskflow.github.io">Taskflow project</a>, copyright © <a href="https://tsung-wei-huang.github.io/">Dr. Tsung-Wei Huang</a>, 2018–2022.<br />Generated by <a href="https://doxygen.org/">Doxygen</a> 1.8.14 and <a href="https://mcss.mosra.cz/">m.css</a>.</p></div></div></div></nav></footer></body></html>
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。