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 2022 solution with examples is on GitHub along with the Parallel Merge implementation. Parallel Merge Sort has also been developed. Another resource is a recently published Parallel Algorithms in C++ and […]
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 2022 solution with examples is on GitHub along with Parallel Merge Sort implementation. Another resource is a recently published Parallel Algorithms in C++ and C# Book which describes Parallel Merge Sort […]
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"In this blog I’ll gather introductory material that is useful when you’re starting out with OpenCL, including links to videos, introductory source code for first projects, and information on how to get VisualStudio setup for OpenCL on Windows. Video introduction to OpenCL is a nice introduction to OpenCL terminology and the overall concepts. It’s an hour […]
Read more "OpenCL Introduction"In my previous blogs, pseudo random number generators (PRNGs) running on a multi-core processor (CPU) or graphics processor (GPU) were shown to have vastly superior performance to those in the standard C++ libraries. Using several CPU cores, utilizing parallel instructions within each core paid off for CPU-based generators. Using hundreds of GPU cores took performance […]
Read more "Faster Random Number Generator"So far we’ve been sorting arrays of unsigned integers in JavaScript. This is very useful at times. Sorting objects based on an embedded unsigned integer field is useful in many more cases. For instance, you have an array of objects, each holding a persons name and an id. Sorting this array by id’s using JavaScript’s […]
Read more "Faster Sorting Object Arrays in JavaScript"JavaScript 2017 specification states the following about its built-in sorting, “The elements of this array are sorted. The sort is not necessarily stable (that is, elements that compare equal do not necessarily remain in their original order).” What’s a JavaScript programmer to do if a stable sort is needed? Good examples of stable and unstable sorting […]
Read more "Stable Sorting In JavaScript"Radix Sort is a high performance linear time sorting algorithm, which does not use comparisons. Instead, Radix Sort looks at each digit of the key and processes based on those digits. Two variations of the algorithm exit: least significant digit (LSD), and most significant digit (MSD). Each of the two variations has its own attributes, […]
Read more "Radix Sort Implementations"JavaScript is taking over the world as the language of the web. When it comes to sorting, JavaScript is about 9 times slower than C++ and C#, but is slightly faster than Python 3.6, as I’ve shown in the previous post Sorting Speed of Several Languages. In this post, let’s explore the possibility of sorting faster in […]
Read more "Faster Sorting in JavaScript"The above graph compares performance of several different sorting algorithms implemented in C++. X-axis is the array size being sorted. Y-axis is the time in seconds it took to sort the array. The faster the algorithm, the less time it takes to sort. The above graph is for arrays filled with uniformly distributed random unsigned […]
Read more "C++ Sorting Algorithms"
