))
.NET 4 , Parallel Patterns , Geometric Decomposition, How to parallelise the processing of an array
Archived series ("Inactive feed" status)
When?
This feed was archived on September 16, 2022 01:29 (
Why? Inactive feed status. Our servers were unable to retrieve a valid podcast feed for a sustained period.
What now? You might be able to find a more up-to-date version using the search function. This series will no longer be checked for updates. If you believe this to be in error, please check if the publisher's feed link below is valid and contact support to request the feed be restored or if you have any other concerns about this.
Manage episode 155003196 series 1142843
Content provided by Rock Solid Knowledge. All podcast content including episodes, graphics, and podcast descriptions are uploaded and provided directly by Rock Solid Knowledge or their podcast platform partner. If you believe someone is using your copyrighted work without your permission, you can follow the process outlined here https://player.fm/legal.
Andy introduces a Parallel Pattern called Geometric Decomposition utilising .NET 4 parallel framework. In this screen cast he will show how an array can be broken down into a series of smaller data pieces having many identical tasks running in parallel work on their own specific piece of the data. Whilst there are scenarios were each task can run in isolation its often found that these various tasks need to co-operate around the edges of their specific pieces. Andy will demonstrate two ways of solving this problem. One utilising pure Parallel.ForEach and another utilising the new Barrier type.
…
continue reading
18 episodes
Share
