2 papers
cs.DS2016
Quadboost: A Scalable Concurrent Quadtree
Keren Zhou, Guangming Tan, Wei Zhou
Building concurrent spatial trees is more complicated than binary search trees since a space hierarchy should be preserved during modifications. We present a non-blocking quadtree-…
cs.DC2015
Parse Concurrent Data Structures: BST as an Example
Keren Zhou, Guocheng Niu, Wuzhao Zhang +2
Designing concurrent data structures should follow some basic rules. By separating the algorithms into two phases, we present guidelines for scalable data structures, with a analys…