Hi,I've created a new github repository for my Java Benchmarks : java-benchmarksFrom 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 … [Read more...]
Java Synchronization (Mutual Exclusion) Benchmark
September 1, 2010 By 13 Comments
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 … [Read more...]
Java File Copy Benchmark Updates (once again)
August 25, 2010 By Leave a Comment
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 … [Read more...]
Generate graphs benchmarks easily
August 11, 2010 By Leave a Comment
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 … [Read more...]
Java File Copy Benchmarks Update
August 4, 2010 By Leave a Comment
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 … [Read more...]
File copy in Java – Benchmark
August 2, 2010 By 45 Comments
Find closest pair of point with Plane Sweep Algorithm in O(n ln n)
April 27, 2010 By 10 Comments
Finding the closest pair of Point in a given collection of points is a standard problem in computational geometry. In this article I'll explain an efficient algorithm using plane sweep, compare it to the naive implementation and discuss its … [Read more...]
How to write correct benchmarks
April 26, 2010 By 6 Comments
Several months ago, I wrote an article to compare the performances of short indexes for loops. I wrote that code to achieve my goal :And i found as a result that short was two times slower than int and I was convinced of these results until a … [Read more...]
Tip : Don’t use shorts for loop indexes !
January 10, 2010 By 5 Comments
After a post I read on a french forum, i asked myself of the performances using shorts as loop indexes for loop with few iterations (less than 32768).At first view, it can be tempting because we save 2 octets, so why use an int instead a short … [Read more...]
