C++ benchmark – std::vector VS std::list VS std::deque

Charts

Last week, I wrote a benchmark comparing the performance of std::vector and std::list on different workloads. This previous article received a lot of comments and several suggestions to improve it. The present article is an improvement over the previous article. In this article, I will compare the performance of std::vector, std::list and std::deque on several [...]



C++ benchmark – std::vector VS std::list

C++ Logo

A updated version of this article is available: C++ benchmark – std::vector VS std::list VS std::deque In C++, the two most used data structures are the std::vector and the std::list. In this article, we will compare the performance in practice of these two data structures on several different workloads. In this article, when I talk [...]



GCC 4.7 vs CLang 3.1 on eddic

eddic Logo

Now that eddic can be compiled with CLang, I wanted to compare the differences in compilation time and in performance of the generated executable between those two compilers. The tests are done using GCC 4.7.2 and CLang 3.1 on Gentoo. Compilation Time The first thing that I tested has been the compilation time of the [...]



Integer Linear Time Sorting Algorithms

C++ Logo

Update: The code is now more C++ Most of the sorting algorithms that are used are generally comparison sort. It means that each element of the collection being sorted will be compared to see which one is the first one. A comparison must have a lower bound of Ω(n log n) comparisons. That is why [...]



C++11 Synchronization Benchmark

C++ Logo
This entry is part 5 of 5 in the series C++11 Concurrency Tutorial

This entry is part 5 of 5 in the series C++11 Concurrency TutorialIn the previous parts of this serie, we saw some C++11 Synchronization techniques: locks, lock guards and atomic references. In this small post, I will present the results of a little benchmark I did run to compare the different techniques. In this benchmark, [...]



My Java Benchmarks on GitHub

Duke Cowboy Java

Hi, I’ve created a new github repository for my Java Benchmarks : java-benchmarks From now all my benchmarks will be pushed to this repository. This is more simple for me to manage and more secure also. At this time, there is seven benchmarks on the repository : Closest Pair Search Benchmark : A benchmark to [...]



Java Synchronization (Mutual Exclusion) Benchmark

Duke Cowboy Java

I’ve created another benchmark. This time, I’ve benchmarked the different ways of synchronizing a little code using mutual exclusion on this code. The code to protect will be very simple. It’s a simple counter : The critical section, if not protected with synchronization system, will not function properly due to possible interleavings (read the article [...]



Java File Copy Benchmark Updates (once again)

Duke Java Logo

I’ve made another updates to my file copy benchmark. First of all, I used my little utility class to automatically create the graphs. The graph are a little less clean, but I spare a lot of time not creating them myself. Then, I’ve also made some corrections on the code : I”ve used a buffer [...]



Generate graphs benchmarks easily

Duke Java Logo

After launching a lot of benchmarks for file copy benchmark and always generating the graphs from the results in Excel, I realized that I was loosing a lot of time to do that. So like any Java developer, I decided to create a little tool that do the work automatically for me. For creating benchmarks, [...]



Java File Copy Benchmarks Update

Duke Java Logo

I’ve made an update of my benchmark about file copy methods in Java. I’ve been asked for new informations about this benchmark and for new test, so I’ve included more results and informations. This new version include two new complete benchmarks : Benchmark on the same disk (Ext4) Benchmark between two disks (Ext4 -> Ext4) [...]