Benchmarking Code and Tests Relaterad to "A contention adapting approach to concurrent ordered sets"

This archive contains code that can be used to reproduce the results included in the following publication:

• Konstantinos Sagonas and Kjell Winblad. A contention adapting approach to concurrent ordered sets. Journal of Parallel and Distributed Computing, 2018 (submitted 2016). (publisher's version, preprint)

More information about how to use the benchmark code can be found in the included README.md file.

The above publication is an extended combination of two conferance pubblications. You may also be intrested in the pages for these publications (here and here) as they contain additional experimental results.

This page contains even more information about CA trees.

Please, contact Kjell Winblad (kjell.winblad@it.uu.se) if you have any questions.

Java Path Finder Tests for Pseudocode

The pseudocde included in the CA tree papers have been extracted from runnable Java code that have been tested with the help of the JavaPathFinder state space explorer. The Java code and the tests can be found in this archive. Please see the readme file inside the archive for information on how to run the tests.