申请试用
HOT
登录
注册
 
Concurrent Maintenance of Skip Lists

Concurrent Maintenance of Skip Lists

陈傲天
/
发布于
/
1732
人观看
This paper describes a new approach to providing efficient concurrent access to a dynamic search structure. Previous approaches have attempted to solve this problem using search trees (either balanced or unbalanced). We describe methods for performing concurrent access and updates using skip lists. Skip lists are a probabilistic alternative to balanced trees that provide much of the simplicity of unbalanced trees, together with good worst-case expected performance.
0 点赞
0 收藏
0下载
确认
3秒后跳转登录页面
去登陆