June 2011 | .NET Parallel Programming

Quick microbenchmarks in Visual Studio with Code Snippets

Stephen Toub - MSFTJune 29, 2011Jun 29, 201106/29/11

Parallelism is all about performance. After all, in the majority of cases, introducing parallelism into code adds some level of complexity, and the primary reason we’re ok with that additional complexity is because we get great performance enhancements as a result. As such, as we develop our parallel runtimes and libraries to

Using Tasks to implement the APM Pattern

Stephen Toub - MSFTJune 27, 2011Jun 27, 201106/27/11

Several times recently, folks have asked how to use tasks to implement the APM pattern, otherwise known as the Asynchronous Programming Model pattern, or the IAsyncResult pattern, or the Begin/End pattern. While moving forward we encourage folks to use a Task-based pattern for exposing asynchronous operation, the APM pattern has been the

Parallel Merge Sort using Barrier

Emad OmaraJune 6, 2011Jun 6, 201106/6/11

Sorting is one of the most fundamental problems in software algorithms; there are many sequential sorting algorithms with different time and memory complexities, but when it comes to parallel sort, things get more complicated. I will explain a simple and scalable algorithm to write a parallel sort using the .NET 4.0 System.Threading.Barrier sy

.NET Parallel Programming

June 2011 | .NET Parallel Programming

Quick microbenchmarks in Visual Studio with Code Snippets

Using Tasks to implement the APM Pattern

Parallel Merge Sort using Barrier

Relevant Links

Top Bloggers

Archive