| Summary: | 碩士 === 國立交通大學 === 資訊工程系 === 87 === Binary search tree is often used in operating system, database system and graph algorithm. Nonblocking algorithm guarantees that some process will complete its operation within a finite number of steps in the system. The nonblocking algorithm, in contrast to the traditional lock-based algorithm, enjoys higher concurrency and fault-tolerance. In this thesis, we propose a nonblocking concurrent binary search tree algorithm. In order to maintain the data integrity in the course of concurrent insert and delete, we use the auxiliary node in the tree structure. The algorithm maintains binary search tree property without locking. Finally, we prove the correctness of our algorithms.
|
|---|
