This is the Labyrinth benchmark, an adapted version of the Labyrinth benchmark of the STAMP benchmark suite [Minh2008] ported to Clojure and extended with the use of transactional futures [Swalens2016].
There are two variants on this benchmark:
- original: a translation of the original benchmark that does not use transactional futures.
- pbfs: a version that implements a parallel breadth-first search algorithm using transactional futures.
In the current version, you can switch between these two variants using the command line argument -v.
Previously, these two variants were separate code bases in different branches. The latest version of these was llcc-2.5 for the original variant and pbcc-3.2 for the pbfs variant. In [Swalens2016], we used llcc-2.3 and pbcc-3.
You can run the program using Leiningen.
Run the benchmark as follows (all parameters are optional):
$ lein run -- -v pbfs -i inputs/random-x64-y64-z3-n48.txt -t 8
Parameters:
-v: variant to use (original or pbfs, default is pbfs).-i: name of input file.-t: number of worker threads to use.-a: number of partitions to create in each transaction (only for pbfs variant).-x,-y,-z: costs for moving in the x, y, and z direction.-b: cost for going round bends.-p: print result.
(Run lein run -- -h to get this description and more.)
Running the program prints the given options and the total execution time to the screen.
Licensed under the MIT license, included in the file LICENSE.
[Swalens2016] J. Swalens, J. De Koster, and W. De Meuter. 2016. "Transactional Tasks: Parallelism in Software Transactions". In Proceedings of the 30th European Conference on Object-Oriented Programming (ECOOP'16).
[Minh2008] C. C. Minh, J. Chung, C. Kozyrakis, and K. Olukotun. 2008. "STAMP: Stanford Transactional Applications for Multi-Processing". In Proceedings of the IEEE International Symposium on Workload Characterization (IISWC'08).