Search icon CANCEL
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Conferences
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Delphi High Performance

You're reading from   Delphi High Performance Build fast Delphi applications using concurrency, parallel programming and memory management

Arrow left icon
Product type Paperback
Published in Feb 2018
Publisher Packt
ISBN-13 9781788625456
Length 336 pages
Edition 1st Edition
Languages
Arrow right icon
Author (1):
Arrow left icon
Primož Gabrijelčič Primož Gabrijelčič
Author Profile Icon Primož Gabrijelčič
Primož Gabrijelčič
Arrow right icon
View More author details
Toc

Table of Contents (11) Chapters Close

Preface 1. About Performance 2. Fixing the Algorithm FREE CHAPTER 3. Fine-Tuning the Code 4. Memory Management 5. Getting Started with the Parallel World 6. Working with Parallel Tools 7. Exploring Parallel Practices 8. Using External Libraries 9. Best Practices 10. Other Books You May Enjoy

Join


The next pattern I want to present is Join. This is a very simple pattern that starts multiple tasks in parallel. In the Parallel Programming Library, Join is implemented as a class method of the TParallel class. To execute three methods,  Task1, Task2, and Task3, in parallel, you simply call TParallel.Join with parameters collected in an array:

TParallel.Join([Task1, Task2, Task3]);

This is equivalent to the following implementation, which uses tasks:

var
  tasks: array [1..3] of ITask;

tasks[1] := TTask.Run(Task1);
tasks[2] := TTask.Run(Task2);
tasks[3] := TTask.Run(Task3);

Note

Although the approaches work the same, that doesn't mean that Join is implemented in this way. Rather than that, it uses a pattern that I haven't yet covered, a parallel for to run tasks in parallel.

The Join starts tasks but doesn't wait for them to complete. It returns an ITask interface representing a new, composite task, which only exits when all of its subtasks finish execution. You can do with this task anything...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $19.99/month. Cancel anytime