Book Review: Data Structures & Program Design

1985 ◽  
Vol 22 (1) ◽  
pp. 94-95
Author(s):  
A. C. Davies
2017 ◽  
Vol 8 (2) ◽  
pp. 44-58
Author(s):  
Yang Zhang ◽  
Xin Yu ◽  
Dongwen Zhang ◽  
Mengmeng Wei ◽  
Yanan Liang

Binary search tree is one of the most important data structures in program design. This article proposes a novel lock-free algorithm, which can implement the lock-free operations, such as search, insert and delete, using compare and swap (CAS). Unlike the previous studies of handling the inside node in a tree, the authors' algorithm handles the insert and delete operations by considering of the subtree. This article presents the details of the lock-free algorithm, which can effectively reduce the contention between the update operations. The experiment compares the algorithm with other two lock-free algorithms by throughput. Evaluation results show that the throughput of the algorithm outperforms that of the other two concurrent BSTs when the number of threads is more than 4. The authors' algorithm will be competitive when the concurrency is high.


2020 ◽  
Vol 64 (3) ◽  
pp. 139
Author(s):  
Daniel Lincoln Nolting

This small book is a concise guide to understanding something that may not be a profound part of libraries in the future. This book explains the basics of blockchain that library personnel will need to know in the event something like it replaces the current data structures of information management. As stated in the introduction, it is “not a guide or manual, but a conversation starter,” and the grant-subsidized research by the co-editors spearheads the complimentary chapters in an orderly manner (xi). Blockchain, with its time-stamped transactions residing in “safe” locations, is a concept that seems the be here to stay.


Sign in / Sign up

Export Citation Format

Share Document