This is the Yada benchmark, an adapted version of the Yada benchmark of the STAMP benchmark suite [Minh2008] ported to Clojure.
This application does not use transactional futures and was not used for our evaluation [Swalens2016].
You can run the program using Leiningen.
Run the benchmark as follows (all parameters are optional):
$ lein run -- -i inputs/spiral.2
Parameters:
-a: minimal angle constraint.-i: input name prefix.-t: number of threads.-p: enable profiling.
(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).