C# provides a powerful set of algorithms for standard containers, such as array and List, when you add “using System.Linq;” statement to your code. Arrays and List containers gain such functionality as Sort, Equal, Sum, Union, Where, Min, Max, First, Last, and so on. For instance, these make it simple to find the minimum element […]Read more "High Performance Parallel C#"
C# is a wonderful programming language, evolving quickly. Microsoft has pushed C# into parallel programming by adding the Task Parallel Library, simplifying development of efficient parallel algorithms. In this blog I’ll describe the parallel library that I’ve developed, with some excellent preliminary results. Preliminary Performance Results Parallel Sorting is running more than 2X faster than […]Read more "Parallel Algorithms in C#"
With the possibility of Amazon choosing Indianapolis for its second headquarters, many have written about the benefits of Indy’s tech scene. I ran across a wonderful article a few days ago in the Indianapolis Monthly which inspired this blog. This article talked about variety of Indianapolis legacies that have shaped and are shaping the city’s […]Read more "Indianapolis Video Heritage"
This is a reprint of my Dr. Dobb’s article from May of 2004. Yet, it is still relevant today, with memory bandwidth within the memory hierarchy being critical to reaching full performance potential. Optimization often demands diving into system memory and processor cache. Intel architecture CPUs are made of several parts working together to execute […]Read more "Memory Hierarchy Bandwidth"
This blog is a re-post of my Dr. Dobb’s Journal article in February of 2011. All of the source code, including a working VisualStudio 2015 solution with examples is on GitHub. For the next several articles in this series, we’ll explore parallel and sequential merge algorithms. We’ll utilize Intel Threading Building Blocks as well as […]Read more "Parallel Merge"
This blog is a re-post of my Dr. Dobb’s Journal article from March of 2011. All of the source code, including a working VisualStudio 2015 solution with examples is on GitHub. In last month’s article in this series, a Parallel Merge algorithm was introduced and performance was optimized to the point of being limited by system memory bandwidth. […]Read more "Parallel Merge Sort"
In late 1996 I developed a recursive hardware multiplier, and presented it at the Synopsys User Group conference in 1998. I recently ran across Karatsuba algorithm for fast multiplication, where its recursive application reminded me of my recursive multiplier. I was mainly after increasing performance for fairly small multipliers, ease of pipelining, and not in […]Read more "Recursive Multiplier in VHDL"