iframe-proxy | Sunbelt Computer Software

History

1292 lines (1283 loc) · 143 KB

Raw

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

171

172

173

174

175

176

177

178

179

180

181

182

183

184

185

186

187

188

189

190

191

192

193

194

195

196

197

198

199

200

201

202

203

204

205

206

207

208

209

210

211

212

213

214

215

216

217

218

219

220

221

222

223

224

225

226

227

228

229

230

231

232

233

234

235

236

237

238

239

240

241

242

243

244

245

246

247

248

249

250

251

252

253

254

255

256

257

258

259

260

261

262

263

264

265

266

267

268

269

270

271

272

273

274

275

276

277

278

279

280

281

282

283

284

285

286

287

288

289

290

291

292

293

294

295

296

297

298

299

300

301

302

303

304

305

306

307

308

309

310

311

312

313

314

315

316

317

318

319

320

321

322

323

324

325

326

327

328

329

330

331

332

333

334

335

336

337

338

339

340

341

342

343

344

345

346

347

348

349

350

351

352

353

354

355

356

357

358

359

360

361

362

363

364

365

366

367

368

369

370

371

372

373

374

375

376

377

378

379

380

381

382

383

384

385

386

387

388

389

390

391

392

393

394

395

396

397

398

399

400

401

402

403

404

405

406

407

408

409

410

411

412

413

414

415

416

417

418

419

420

421

422

423

424

425

426

427

428

429

430

431

432

433

434

435

436

437

438

439

440

441

442

443

444

445

446

447

448

449

450

451

452

453

454

455

456

457

458

459

460

461

462

463

464

465

466

467

468

469

470

471

472

473

474

475

476

477

478

479

480

481

482

483

484

485

486

487

488

489

490

491

492

493

494

495

496

497

498

499

500

501

502

503

504

505

506

507

508

509

510

511

512

513

514

515

516

517

518

519

520

521

522

523

524

525

526

527

528

529

530

531

532

533

534

535

536

537

538

539

540

541

542

543

544

545

546

547

548

549

550

551

552

553

554

555

556

557

558

559

560

561

562

563

564

565

566

567

568

569

570

571

572

573

574

575

576

577

578

579

580

581

582

583

584

585

586

587

588

589

590

591

592

593

594

595

596

597

598

599

600

601

602

603

604

605

606

607

608

609

610

611

612

613

614

615

616

617

618

619

620

621

622

623

624

625

626

627

628

629

630

631

632

633

634

635

636

637

638

639

640

641

642

643

644

645

646

647

648

649

650

651

652

653

654

655

656

657

658

659

660

661

662

663

664

665

666

667

668

669

670

671

672

673

674

675

676

677

678

679

680

681

682

683

684

685

686

687

688

689

690

691

692

693

694

695

696

697

698

699

700

701

702

703

704

705

706

707

708

709

710

711

712

713

714

715

716

717

718

719

720

721

722

723

724

725

726

727

728

729

730

731

732

733

734

735

736

737

738

739

740

741

742

743

744

745

746

747

748

749

750

751

752

753

754

755

756

757

758

759

760

761

762

763

764

765

766

767

768

769

770

771

772

773

774

775

776

777

778

779

780

781

782

783

784

785

786

787

788

789

790

791

792

793

794

795

796

797

798

799

800

801

802

803

804

805

806

807

808

809

810

811

812

813

814

815

816

817

818

819

820

821

822

823

824

825

826

827

828

829

830

831

832

833

834

835

836

837

838

839

840

841

842

843

844

845

846

847

848

849

850

851

852

853

854

855

856

857

858

859

860

861

862

863

864

865

866

867

868

869

870

871

872

873

874

875

876

877

878

879

880

881

882

883

884

885

886

887

888

889

890

891

892

893

894

895

896

897

898

899

900

901

902

903

904

905

906

907

908

909

910

911

912

913

914

915

916

917

918

919

920

921

922

923

924

925

926

927

928

929

930

931

932

933

934

935

936

937

938

939

940

941

942

943

944

945

946

947

948

949

950

951

952

953

954

955

956

957

958

959

960

961

962

963

964

965

966

967

968

969

970

971

972

973

974

975

976

977

978

979

980

981

982

983

984

985

986

987

988

989

990

991

992

993

994

995

996

997

998

999

1000

<!DOCTYPE html>

<head>

<title>Taskflow Algorithms » Parallel Pipeline | Taskflow QuickStart</title>

</head>

<body>

<a href="https://taskflow.github.io"><img src="taskflow_logo.png" alt="" />Taskflow</a> | <a href="index.html" class="m-thin">QuickStart</a>

</svg></a>

</div>

<li><a href="pages.html">Handbook</a></li>

<li><a href="namespaces.html">Namespaces</a></li>

</ol>

<li><a href="annotated.html">Classes</a></li>

<li><a href="files.html">Files</a></li>

</svg></a></li>

</ol>

</div>

</nav></header>

<h1>

<a href="Algorithms.html">Taskflow Algorithms</a> »

Parallel Pipeline

</h1>

<h3>Contents</h3>

<ul>

<li><a href="#ParallelPipelineIncludeHeaderFile">Include the Header</a></li>

<li><a href="#UnderstandPipelineScheduling">Understand the Pipeline Scheduling Framework</a></li>

<li><a href="#CreatePipeline">Create a Pipeline Module Task</a></li>

<li>

<a href="#ConnectWithTasks">Connect Pipeline with Other Tasks</a>

<ul>

<li><a href="#IterateAPipeline">Example 1: Iterate a Pipeline</a></li>

<li><a href="#ConcatenateTwoPipelines">Example 2: Concatenate Two Pipelines</a></li>

<li><a href="#DefineMultipleParallelPipelines">Example 3: Define Multiple Parallel Pipelines</a></li>

</ul>

</li>

<li><a href="#ResetPipeline">Reset a Pipeline</a></li>

<li><a href="#ParallelPipelineLearnMore">Learn More about Taskflow Pipeline</a></li>

</ul>

</div>

Taskflow provides a task-parallel pipeline programming framework for you to create a pipeline scheduling framework. Pipeline parallelism refers to a parallel execution of multiple data tokens through a linear chain of pipes or stages. Each stage processes the data token sent from the previous stage, applies the given callable to that data token, and then sends the result to the next stage. Multiple data tokens can be processed simultaneously across different stages.<section id="ParallelPipelineIncludeHeaderFile"><h2><a href="#ParallelPipelineIncludeHeaderFile">Include the Header</a></h2>You need to include the header file, <code>taskflow/algorithm/pipeline.hpp</code>, for creating a pipeline scheduling framework.<pre class="m-code">#include <taskflow/algorithm/pipeline.hpp></pre></section><section id="UnderstandPipelineScheduling"><h2><a href="#UnderstandPipelineScheduling">Understand the Pipeline Scheduling Framework</a></h2>A <a href="classtf_1_1Pipeline.html" class="m-doc">tf::Pipeline</a> object is a composable graph to create a pipeline scheduling framework through a module task in a taskflow (see <a href="ComposableTasking.html" class="m-doc">Composable Tasking</a>). Unlike the conventional pipeline programming frameworks (e.g., Intel TBB Parallel <a href="classtf_1_1Pipeline.html" class="m-doc">Pipeline</a>), Taskflow's pipeline algorithm does not provide any data abstraction, which often restricts users from optimizing data layouts in their applications, but a flexible framework for users to customize their application data atop an efficient pipeline scheduling framework.<div class="m-graph"><svg style="width: 22.250rem; height: 22.688rem;" viewBox="0.00 0.00 356.00 363.08">

<title>Taskflow</title>

<title>cluster0</title>

</g>

<title>cluster1</title>

</g>

<title>cluster2</title>

</g>

<title>cluster3</title>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</svg>

</div>The figure above gives an example of our pipeline scheduling framework. The framework consists of three pipes (serial-parallel-serial stages) and four lines (maximum parallelism), where each line processes at most one data token. A pipeline of three pipes and four lines will propagate each data token through a sequential chain of three pipes and can simultaneously process up to four data tokens at the four lines. Each edge represents a task dependency. For example, the edge from <code>pipe-0</code> to <code>pipe-1</code> in line <code>0</code> represents the task dependency between the first and the second pipes in the first line; the edge from <code>pipe-0</code> in line <code>0</code> to <code>pipe-0</code> in line <code>1</code> represents the task dependency between two adjacent lines when processing two data tokens at the same pipe. Each pipe can be either a serial type or a parallel type, where a serial pipe processes data tokens sequentially and a parallel pipe processes different data tokens simultaneously.<aside class="m-note m-info"><h4>Note</h4>Due to the nature of pipeline, Taskflow requires the first pipe to be a serial type. The pipeline scheduling algorithm operates in a circular fashion with a factor of line count.</aside></section><section id="CreatePipeline"><h2><a href="#CreatePipeline">Create a Pipeline Module Task</a></h2>Taskflow leverages modern C++ and template techniques to strike a balance between the expressiveness and generality in designing the pipeline programming model. In general, there are three steps to create a pipeline application:<ol><li>Define the pipeline structure (e.g., pipe type, pipe callable, stopping rule, line count)</li><li>Define the data storage and layout, if needed for the application</li><li>Define the pipeline taskflow graph using composition</li></ol>The following code creates a pipeline scheduling framework using the example from the previous section. The framework schedules a total of five scheduling tokens labeled from 0 to 4. The first pipe stores the token identifier in a custom data storage, <code>buffer</code>, and each of the rest pipes adds one to the input data from the result of the previous pipe and stores the result into the corresponding line entry in the buffer.<pre class="m-code"> 1: tf::Taskflow taskflow;

2: tf::Executor executor;

3:

4: // maximum parallelism - each line processes one token at a time

5: const size_t num_lines = 4;

6:

7: // custom data storage

8: std::array<int, num_lines> buffer;

9:

10: // the pipeline consists of three pipes (serial-parallel-serial)

11: // and up to four concurrent scheduling tokens

12: tf::Pipeline pl(num_lines,

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

14: // generate only 5 scheduling tokens

15: if(pf.token() == 5) {

16: pf.stop();

17: }

18: // save the result of this pipe into the buffer

19: else {

20: printf("pipe 0: input token = %zu\n", pf.token());

21: buffer[pf.line()] = pf.token();

22: }

23: }},

24:

25: tf::Pipe{tf::PipeType::PARALLEL, [&buffer](tf::Pipeflow& pf) {

26: printf(

27: "pipe 1: input buffer[%zu] = %d\n",

28: pf.line(), buffer[pf.line()]

29: );

30: // propagate the previous result to this pipe by adding one

31: buffer[pf.line()] = buffer[pf.line()] + 1;

32: }},

33:

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

35: printf(

36: "pipe 2: input buffer[%zu] = %d\n",

37: pf.line(), buffer[pf.line()]

38: );

39: // propagate the previous result to this pipe by adding one

40: buffer[pf.line()] = buffer[pf.line()] + 1;

41: }}

42: );

43:

44: // build the pipeline graph using composition

45: tf::Task pipeline = taskflow.composed_of(pl).name("pipeline");

46:

47: // execute the taskflow

48: executor.run(taskflow).wait();</pre>Debrief:<ul><li>Lines 4-5 define the structure of the pipeline scheduling framework</li><li>Line 8 defines the data storage as an one-dimensional array of <code>num_lines</code> integers</li><li>Line 12 defines the number of lines in the pipeline</li><li>Lines 13-23 define the first serial pipe, which will stop the pipeline scheduling at the fifth token</li><li>Lines 25-32 define the second parallel pipe</li><li>Lines 34-41 define the third serial pipe</li><li>Line 45 defines the pipeline taskflow graph using composition</li><li>Line 48 executes the taskflow</li></ul>Taskflow leverages <a href="RuntimeTasking.html" class="m-doc">Runtime Tasking</a> and <a href="ComposableTasking.html" class="m-doc">Composable Tasking</a> to implement the pipeline scheduling framework. The taskflow graph of this pipeline example is shown as follows, where 1) one condition task is used to decide which runtime task to run and 2) four runtime tasks is used to schedule tokens at four parallel lines, respectively.<div class="m-graph"><svg style="width: 28.500rem; height: 15.375rem;" viewBox="0.00 0.00 456.00 246.00">

<title>Taskflow</title>

<title>cluster_p0x7ffc47e53358</title>

<text text-anchor="middle" x="77" y="-205.2">Taskflow</text>

</g>

<title>cluster_p0x7ffc47e53220</title>

</g>

<text text-anchor="middle" x="77" y="-166.2">pipeline [m1]</text>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</svg>

</div>In this example, we customize the data storage, <code>buffer</code>, as an one-dimensional array of 4 integers, since the pipeline structure defines only four parallel lines. Each entry of <code>buffer</code> stores stores the data being processed in the corresponding line. For example, <code>buffer[1]</code> stores the processed data at line <code>1</code>. The following figure shows the data layout of <code>buffer</code>.<div class="m-graph"><svg style="width: 19.250rem; height: 7.062rem;" viewBox="0.00 0.00 308.00 113.00">

<title>structs</title>

<title>struct1</title>

<text text-anchor="middle" x="150" y="-87.7">buffer[0] (processes token at line 0)</text>

<text text-anchor="middle" x="150" y="-61.7">buffer[1] (processes token at line 1)</text>

<text text-anchor="middle" x="150" y="-35.7">buffer[2] (processes token at line 2)</text>

<text text-anchor="middle" x="150" y="-9.7">buffer[3] (processes token at line 3)</text>

</g>

</svg>

</div><aside class="m-note m-info"><h4>Note</h4>In practice, you may need to add padding to the data type of the buffer or align it with the cacheline size to avoid false sharing. If the data type varies at different pipes, you can use <a href="https://en.cppreference.com/w/cpp/utility/variant">std::variant</a> to store the data types in a uniform storage.</aside>For each scheduling token, you can use <a href="classtf_1_1Pipeflow.html#afee054e6a99965d4b3e36ff903227e6c" class="m-doc">tf::Pipeflow::line()</a> to get its line identifier and <a href="classtf_1_1Pipeflow.html#a4914c1f381a3016e98285b019cf60d6d" class="m-doc">tf::Pipeflow::pipe()</a> to get its pipe identifier. For example, if a scheduling token is at the third pipe of the forth line, <a href="classtf_1_1Pipeflow.html#afee054e6a99965d4b3e36ff903227e6c" class="m-doc">tf::Pipeflow::line()</a> will return <code>3</code> and <a href="classtf_1_1Pipeflow.html#a4914c1f381a3016e98285b019cf60d6d" class="m-doc">tf::Pipeflow::pipe()</a> will return <code>2</code> (index starts from 0). To stop the execution of the pipeline, you need to call <a href="classtf_1_1Pipeflow.html#a830b7f204cb87fff17e8d424918d9453" class="m-doc">tf::Pipeflow::stop()</a> at the first pipe. Once the stop signal has been triggered, the pipeline will stop scheduling any new tokens after the callable. As we can see from this example, <a href="classtf_1_1Pipeline.html" class="m-doc">tf::Pipeline</a> gives you the full control to customize your application data on top of a pipeline scheduling framework.<aside class="m-note m-info"><h4>Note</h4><ol><li>Calling <a href="classtf_1_1Pipeflow.html#a830b7f204cb87fff17e8d424918d9453" class="m-doc">tf::Pipeflow::stop()</a> not at the first pipe has no effect on the pipeline scheduling.</li><li>In most cases, <a href="http://en.cppreference.com/w/cpp/thread/thread/hardware_concurrency.html" class="m-doc-external">std::thread::hardware_concurrency</a> is a good number for line count.</li></ol></aside>Our pipeline algorithm schedules tokens in a circular manner, with a factor of <code>num_lines</code>. That is, token <code>t</code> will be processed at line <code>t % num_lines</code>. The following snippet shows one of the possible outputs of this pipeline program:<pre class="m-code">pipe 0: input token = 0

pipe 1: input buffer[0] = 0

pipe 2: input buffer[0] = 1

pipe 0: input token = 1

pipe 1: input buffer[1] = 1

pipe 2: input buffer[1] = 2

pipe 0: input token = 2

pipe 1: input buffer[2] = 2

pipe 2: input buffer[2] = 3

pipe 0: input token = 3

pipe 1: input buffer[3] = 3

pipe 2: input buffer[3] = 4

pipe 0: input token = 4

pipe 1: input buffer[0] = 4

pipe 2: input buffer[0] = 5</pre>There are a total of five tokens running through three pipes. Each pipes prints its input data value, except the first pipe that prints its token identifier. Since the second pipe is a parallel pipe, the output can interleave.</section><section id="ConnectWithTasks"><h2><a href="#ConnectWithTasks">Connect Pipeline with Other Tasks</a></h2>You can connect the pipeline module task with other tasks to create a taskflow application that embeds one or multiple pipeline algorithms. We describe three common examples below:<ul><li><a href="ParallelPipeline.html#IterateAPipeline" class="m-doc">Example 1: Iterate a Pipeline</a></li><li><a href="ParallelPipeline.html#ConcatenateTwoPipelines" class="m-doc">Example 2: Concatenate Two Pipelines</a></li><li><a href="ParallelPipeline.html#DefineMultipleParallelPipelines" class="m-doc">Example 3: Define Multiple Parallel Pipelines</a></li></ul><section id="IterateAPipeline"><h3><a href="#IterateAPipeline">Example 1: Iterate a Pipeline</a></h3>This example emulates a data streaming application that iteratively runs a stream of data through a pipeline using conditional tasking. The taskflow graph consists of one pipeline module task and one condition task. The pipeline module task processes a stream of data. The condition task decides the availability of data and reruns the pipeline when the next stream of data becomes available. <pre class="m-code"> 1: tf::Taskflow taskflow;

2: tf::Executor executor;

3:

4: const size_t num_lines = 4; // maximum parallelism of the pipeline

5:

6: int i = 0, N = 0;

7: // custom data storage

9:

10: // the pipeline consists of three pipes (serial-parallel-serial)

11: // and up to four concurrent scheduling tokens

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

14: // only 5 scheduling tokens are processed

15: if(i++ == 5) {

16: pf.stop();

17: }

18: // save the result of this pipe into the buffer

19: else {

20: printf("stage 0: input token = %zu\n", pf.token());

22: }

23: }},

24:

26: printf(

27: "stage 1: input buffer[%zu] = %d\n",

29: );

30: // propagate the previous result to this pipe by adding one

32: }},

33:

35: printf(

36: "stage 2: input buffer[%zu] = %d\n",

38: );

39: // propagate the previous result to this pipe by adding one

41: }}

42: );

43:

44: tf::Task conditional = taskflow.emplace([&N, &i](){

45: i = 0;

46: if (++N < 2) {

47: std::cout << "Rerun the pipeline\n";

48: return 0;

49: }

50: else {

51: return 1;

52: }

53: }).name("conditional");

54:

55: // build the pipeline graph using composition

56: tf::Task pipeline = taskflow.composed_of(pl)

57: .name("pipeline");

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

59: .name("initial");

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

61: .name("stop");

62:

63: // specify the graph dependency

64: initial.precede(pipeline);

65: pipeline.precede(conditional);

66: conditional.precede(pipeline, stop);

67:

68: // execute the taskflow

69: executor.run(taskflow).wait();</pre>Debrief:<ul><li>Lines 4-5 define the structure of the pipeline scheduling framework</li><li>Line 8 defines the data storage as an one-dimensional array (<code>num_lines</code> integers)</li><li>Line 12 defines the number of lines in the pipeline</li><li>Lines 13-23 define the first serial pipe, which will stop the pipeline scheduling when <code>i</code> is <code>5</code> </li><li>Lines 25-32 define the second parallel pipe</li><li>Lines 34-41 define the third serial pipe</li><li>Lines 44-53 define a condition task which returns 0 when <code>N</code> is less than <code>2</code>, otherwise returns <code>1</code></li><li>Line 45 resets variable <code>i</code></li><li>Lines 56-57 define the pipeline graph using composition</li><li>Lines 58-61 define two static tasks</li><li>Line 64-66 define the task dependency</li><li>Line 69 executes the taskflow</li></ul>The taskflow graph of this pipeline example is illustrated as follows:<div class="m-graph"><svg style="width: 33.875rem; height: 32.438rem;" viewBox="0.00 0.00 542.00 518.77">

<title>Taskflow</title>

<title>cluster_p0x7fff4f1276d8</title>

<text text-anchor="middle" x="120" y="-478.3543">Taskflow</text>

</g>

<title>cluster_p0x7fff4f127590</title>

</g>

<text text-anchor="middle" x="119" y="-438.9696">initial</text>

</g>

<text text-anchor="middle" x="119" y="-302.9696">pipeline [m1]</text>

</g>

</g>

<text text-anchor="middle" x="120" y="-166.9696">conditional</text>

</g>

</g>

</g>

<text text-anchor="middle" x="120" y="-30.5848">terminal</text>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</svg>

</div>The following snippet shows one of the possible outputs:<pre class="m-code">initial

stage 0: input token = 0

stage 1: input buffer[0] = 0

stage 2: input buffer[0] = 1

stage 0: input token = 1

stage 1: input buffer[1] = 1

stage 2: input buffer[1] = 2

stage 0: input token = 2

stage 1: input buffer[2] = 2

stage 2: input buffer[2] = 3

stage 0: input token = 3

stage 1: input buffer[3] = 3

stage 2: input buffer[3] = 4

stage 0: input token = 4

stage 1: input buffer[0] = 4

stage 2: input buffer[0] = 5

Rerun the pipeline

stage 0: input token = 5

stage 1: input buffer[1] = 5

stage 2: input buffer[1] = 6

stage 0: input token = 6

stage 1: input buffer[2] = 6

stage 2: input buffer[2] = 7

stage 0: input token = 7

stage 1: input buffer[3] = 7

stage 2: input buffer[3] = 8

stage 0: input token = 8

stage 1: input buffer[0] = 8

stage 2: input buffer[0] = 9

stage 0: input token = 9

stage 1: input buffer[1] = 9

stage 2: input buffer[1] = 10

stop</pre>The pipeline runs twice as controlled by the condition task <code>conditional</code>. The starting token in the second run of the pipeline is <code>5</code> rather than <code>0</code> because the pipeline keeps a stateful number of tokens. The last token is <code>9</code>, which means the pipeline processes in total <code>10</code> scheduling tokens. The first five tokens (token <code>0</code> to <code>4</code>) are processed in the first run, and the remaining five tokens (token <code>5</code> to <code>9</code>) are processed in the second run. In the condition task, we use <code>N</code> as a decision-making counter to process the next stream of data.</section><section id="ConcatenateTwoPipelines"><h3><a href="#ConcatenateTwoPipelines">Example 2: Concatenate Two Pipelines</a></h3>This example demonstrates two concatenated pipelines where a sequence of data tokens run synchronously from one pipeline to another pipeline. The first pipeline task precedes the second pipeline task.<pre class="m-code"> 1: tf::Taskflow taskflow("pipeline");

2: tf::Executor executor;

3:

4: // define the maximum parallelism of the pipeline

6:

7: // custom data storage

9: std::array<int, num_lines> buffer_2;

10:

11: // the pipeline_1 consists of three pipes (serial-parallel-serial)

12: // and up to four concurrent scheduling tokens

13: tf::Pipeline pl_1(num_lines,

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

15: // generate only 4 scheduling tokens

16: if(pf.token() == 4) {

17: pf.stop();

18: }

19: // save the result of this pipe into the buffer

20: else {

21: printf("pipeline 1, pipe 0: input token = %zu\n", pf.token());

22: buffer_1[pf.line()] = pf.token();

23: }

24: }},

25:

26: tf::Pipe{tf::PipeType::PARALLEL, [&buffer_1](tf::Pipeflow& pf) {

27: printf(

28: "pipeline 1, pipe 1: input buffer_1[%zu] = %d\n",

29: pf.line(), buffer_1[pf.line()]

30: );

31: // propagate the previous result to this pipe by adding one

32: buffer_1[pf.line()] = buffer_1[pf.line()] + 1;

33: }},

34:

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

36: printf(

37: "pipeline 1, pipe 2: input buffer_1[%zu] = %d\n",

38: pf.line(), buffer_1[pf.line()]

39: );

40: // propagate the previous result to this pipe by adding one

41: buffer_1[pf.line()] = buffer_1[pf.line()] + 1;

42: }}

43: );

44:

45: // the pipeline_2 consists of three pipes (serial-parallel-serial)

46: // and up to four concurrent scheduling tokens

47: tf::Pipeline pl_2(num_lines,

49: [&buffer_2, &buffer_1](tf::Pipeflow& pf) mutable{

50: // generate only 4 scheduling tokens

51: if(pf.token() == 4) {

52: pf.stop();

53: }

54: // save the result of this pipe into the buffer

55: else {

56: printf("pipeline 2, pipe 0: input value = %d\n", buffer_1[pf.line()]);

57: buffer_2[pf.line()] = buffer_1[pf.line()];

58: }

59: }},

60:

61: tf::Pipe{tf::PipeType::PARALLEL, [&buffer_2](tf::Pipeflow& pf) {

62: printf(

63: "pipeline 2, pipe 1: input buffer_2[%zu] = %d\n",

64: pf.line(), buffer_2[pf.line()]

65: );

66: // propagate the previous result to this pipe by adding 1

67: buffer_2[pf.line()] = buffer_2[pf.line()] + 1;

68: }},

69:

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

71: printf(

72: "pipeline 2, pipe 2: input buffer_2[%zu] = %d\n",

73: pf.line(), buffer_2[pf.line()]

74: );

75: // propagate the previous result to this pipe by adding 1

76: buffer_2[pf.line()] = buffer_2[pf.line()] + 1;

77: }}

78: );

79:

80: // build the pipeline graph using composition

81: tf::Task pipeline_1 = taskflow.composed_of(pl_1).name("pipeline_1");

82: tf::Task pipeline_2 = taskflow.composed_of(pl_2).name("pipeline_2");

83:

84: // specify the graph dependency

85: pipeline_1.precede(pipeline_2);

86:

87: // execute the taskflow

88: executor.run(taskflow).wait();</pre> Debrief:<ul><li>Line 8 defines the data storage (<code>num_lines</code> integers) for pipeline <code>pl_1</code></li><li>Line 9 defines the data storage (<code>num_lines</code> integers) for pipeline <code>pl_2</code></li><li>Lines 14-24 define the first serial pipe in <code>pl_1</code></li><li>Lines 26-33 define the second parallel pipe in <code>pl_1</code></li><li>Lines 35-42 define the third serial pipe in <code>pl_1</code></li><li>Lines 48-59 define the first serial pipe in <code>pl_2</code> that takes the results of <code>pl_1</code> as inputs</li><li>Lines 61-68 define the second parallel pipe in <code>pl_2</code></li><li>Lines 70-77 define the third serial pipe in <code>pl_2</code></li><li>Lines 81-82 define the pipeline graphs using composition</li><li>Line 85 defines the task dependency</li><li>Line 88 runs the taskflow</li></ul>The taskflow graph of this pipeline example is illustrated as follows:<div class="m-graph"><svg style="width: 48.000rem; height: 15.375rem;" viewBox="0.00 0.00 768.00 246.00">

<title>Taskflow</title>

<title>cluster_p0x7ffeaf4d98d8</title>

<text text-anchor="middle" x="86" y="-205.2">Taskflow</text>

</g>

<title>cluster_p0x7ffeaf4d9510</title>

</g>

<title>cluster_p0x7ffeaf4d95b0</title>

</g>

<text text-anchor="middle" x="86" y="-166.2">pipeline_1 [m1]</text>

</g>

<text text-anchor="middle" x="86" y="-30.2">pipeline_2 [m2]</text>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</g>

</svg>

</div>The following snippet shows one of the possible outputs:<pre class="m-code">pipeline 1, pipe 0: input token = 0

pipeline 1, pipe 1: input buffer_1[0] = 0

pipeline 1, pipe 2: input buffer_1[0] = 1

pipeline 1, pipe 0: input token = 1

pipeline 1, pipe 1: input buffer_1[1] = 1

pipeline 1, pipe 2: input buffer_1[1] = 2

pipeline 1, pipe 0: input token = 2

pipeline 1, pipe 1: input buffer_1[2] = 2

pipeline 1, pipe 2: input buffer_1[2] = 3

pipeline 1, pipe 0: input token = 3

pipeline 1, pipe 1: input buffer_1[3] = 3

pipeline 1, pipe 2: input buffer_1[3] = 4

pipeline 2, pipe 1: input value = 2

pipeline 2, pipe 2: input buffer_2[0] = 2

pipeline 2, pipe 3: input buffer_2[0] = 3

pipeline 2, pipe 1: input value = 3

pipeline 2, pipe 2: input buffer_2[1] = 3

pipeline 2, pipe 3: input buffer_2[1] = 4

pipeline 2, pipe 1: input value = 4

pipeline 2, pipe 2: input buffer_2[2] = 4

pipeline 2, pipe 3: input buffer_2[2] = 5

pipeline 2, pipe 1: input value = 5

pipeline 2, pipe 2: input buffer_2[3] = 5

pipeline 2, pipe 3: input buffer_2[3] = 6</pre>The output of pipelines <code>pl_1</code> and <code>pl_2</code> can be different from run to run because their second pipes are both parallel types. Due to the task dependency between <code>pipeline_1</code> and <code>pipeline_2</code>, the output of <code>pl_1</code> precedes the output of <code>pl_2</code>.</section><section id="DefineMultipleParallelPipelines"><h3><a href="#DefineMultipleParallelPipelines">Example 3: Define Multiple Parallel Pipelines</a></h3>This example creates two independent pipelines that run in parallel on different data sets.<pre class="m-code"> 1: tf::Taskflow taskflow("pipeline");

2: tf::Executor executor;

3:

4: // define the maximum parallelism of the pipeline

6:

7: // custom data storage

10:

11: // the pipeline_1 consists of three pipes (serial-parallel-serial)

12: // and up to four concurrent scheduling tokens

15: // generate only 5 scheduling tokens

16: if(pf.token() == 5) {

17: pf.stop();

18: }

19: // save the result of this pipe into the buffer

20: else {

23: }

24: }},

25:

27: printf(

28: "pipeline 1, pipe 1: input buffer_1[%zu] = %d\n",

30: );

31: // propagate the previous result to this pipe by adding one

33: }},

34:

36: printf(

37: "pipeline 1, pipe 2: input buffer_1[%zu] = %d\n",

39: );

40: // propagate the previous result to this pipe by adding one

42: }}

43: );

44:

45: // the pipeline_2 consists of three pipes (serial-parallel-serial)

46: // and up to four concurrent scheduling tokens

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

49: // generate only 2 scheduling tokens

50: if(pf.token() == 5) {

51: pf.stop();

52: }

53: // save the result of this pipe into the buffer

54: else {

55: printf("pipeline 2, pipe 0: input token = %zu\n", pf.token());

56: buffer_2[pf.line()] = "pipeline";

57: }

58: }},

59:

60: tf::Pipe{tf::PipeType::PARALLEL, [&buffer_2](tf::Pipeflow& pf) {

61: printf(

62: "pipeline 2, pipe 1: input buffer_2[%zu] = %d\n",

63: pf.line(), buffer_2[pf.line()]

64: );

65: // propagate the previous result to this pipe by concatenating "_"

66: buffer_2[pf.line()] = buffer_2[pf.line()];

67: }},

68:

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

70: printf(

71: "pipeline 2, pipe 2: input buffer_2[%zu] = %d\n",

72: pf.line(), buffer_2[pf.line()]

73: );

74: // propagate the previous result to this pipe by concatenating "2"

75: buffer_2[pf.line()] = buffer_2[pf.line()];

76: }}

77: );

78:

79: tf::Task pipeline_1 = taskflow.composed_of(pl_1)

80: .name("pipeline_1");

81: tf::Task pipeline_2 = taskflow.composed_of(pl_2)

82: .name("pipeline_2");

83: tf::Task initial = taskflow.emplace([](){ std::cout << "initial"; })

84: .name("initial");

85:

86: initial.precede(pipeline_1, pipeline_2);

87:

88: executor.run(taskflow).wait();</pre>Debrief:<ul><li>Line 8 defines the data storage (<code>num_lines</code> integers) for pipeline <code>pl_1</code></li><li>Line 9 defines the data storage (<code>num_lines</code> integers) for pipeline <code>pl_2</code></li><li>Lines 14-24 define the first serial pipe in <code>pl_1</code></li><li>Lines 26-33 define the second parallel pipe in <code>pl_1</code></li><li>Lines 35-42 define the third serial pipe in <code>pl_1</code></li><li>Lines 48-58 define the first serial pipe in <code>pl_2</code></li><li>Lines 60-67 define the second parallel pipe in <code>pl_2</code></li><li>Lines 69-76 define the third serial pipe in <code>pl_2</code></li><li>Lines 79-82 define the pipeline graphs using composition</li><li>Lines 83-84 define a static task.</li><li>Line 86 defines the task dependency</li><li>Line 88 runs the taskflow</li></ul>The taskflow graph of this pipeline example is illustrated as follows:<div class="m-graph"><svg style="width: 57.812rem; height: 15.375rem;" viewBox="0.00 0.00 925.00 246.00">

<title>Taskflow</title>

<title>cluster_p0x7ffe35bde158</title>

<text text-anchor="middle" x="164.5" y="-205.5848">Taskflow</text>

</g>

<title>cluster_p0x7ffe35bddd80</title>

</g>

<title>cluster_p0x7ffe35bdde20</title>

</g>

<text text-anchor="middle" x="86" y="-30.2">pipeline_1 [m1]</text>

</g>

<text text-anchor="middle" x="243" y="-30.2">pipeline_2 [m2]</text>

</g>

<text text-anchor="middle" x="164" y="-166.2">initial</text>

</g>

</g>

</g>

View remainder of file in raw view

Sunbelt Computer Software

PL/B Language Development and Support

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Sunbelt Computer Software

PL/B Language Development and Support

FilesExpand file tree

ParallelPipeline.html

Latest commit

History

ParallelPipeline.html

File metadata and controls