Search code examples
javabenchmarkingperformance-testinglock-free

Performance testing for lock free data structures

I am working on a lock-free self-organizing list and I was looking for some benchmarks too which I could compare my results or some program with which i could test the performance of my algorithms.

The code is written in Java and i will need to run multiple scenarios :

  1. Heavy Read: 90% search, 9% add, 1% remove
  2. Mixed: 60% search, 15% add, 15% remove
  3. Heavy modifying: 33% search, 33% add, 33% remove

Just to be clear my question is:

If anyone knows some benchmarks or performance measurement tools where I could compare my results?

Solution

  • You can try benchmarking against other lock-free list implementations in the benchmark suites such as

    https://github.com/gramoli/synchrobench

    https://github.com/LPD-EPFL/ASCYLIB

    Among others