GitHub - Rinum/Concurrent-Binary-Search-Tree: Parallelized using Boost Threads in C++

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
README		README
ctree.cpp		ctree.cpp
ctree.h		ctree.h
main.cpp		main.cpp
makefile		makefile
tree.cpp		tree.cpp
tree.h		tree.h

Repository files navigation

===========================================================
 *README* | A Concurrent Binary Search Tree Data Structure
===========================================================

--------
|Author|
--------
Mohammed Ahmed - m@rinum.com
University of Illinois at Chicago
Student - Spring 2012

-------------
|Information|
-------------
Running make creates the executable file run.

This is meant for comparison purposes with the SimpleBST
and ParallelizedBST with different data and operation sizes.

Queues are used as a method of communication between 
threads.