GitHub - moraxu/Lock-free-Static-Tree-Barrier: Lock-free Static Tree Barrier data structure implemented in C++11 with optimized memory orderings during the course Advanced Concurrency (CompSci 295).

moraxu / Lock-free-Static-Tree-Barrier Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

Lock-free Static Tree Barrier data structure implemented in C++11 with optimized memory orderings during the course Advanced Concurrency (CompSci 295).

0 stars 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 8 Commits
.gitignore		.gitignore
CMakeLists.txt		CMakeLists.txt
Implementation details.pdf		Implementation details.pdf
Makefile		Makefile
README.txt		README.txt
STBarrier.h		STBarrier.h
test1.cpp		test1.cpp
test2.cpp		test2.cpp

Repository files navigation

CDSChecker is a model checker for C11/C++11 which exhaustively explores the behaviors of code under the C/C++ memory model - http://plrg.ics.uci.edu/software_page/42-2/

In order to run the test cases:

    1. Place 'CS295' directory in 'model-checker' (git://plrg.ics.uci.edu/model-checker.git) directory,
    2. 'cd' to that 'CS295' directory,
    3. Issue 'make test1' and 'make test2',
    4. 'cd ..',
    5. Issue './run.sh CS295/test1 -m 2 -y -x 10000' to run test case 1,
    6. Issue './run.sh CS295/test2 -m 2 -y -x 10000' to run test case 2.

Without the '-x 10000' flag the test cases were running for over two hours so I decided to limit the number of
executions to 10000.

About

Lock-free Static Tree Barrier data structure implemented in C++11 with optimized memory orderings during the course Advanced Concurrency (CompSci 295).

Readme

Activity

0 stars

1 watching

0 forks

Report repository