非阻塞二叉搜索树

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI:10.1145/1835698.1835736

Faith Ellen, P. Fatourou, E. Ruppert, F. Breugel

{"title":"非阻塞二叉搜索树","authors":"Faith Ellen, P. Fatourou, E. Ruppert, F. Breugel","doi":"10.1145/1835698.1835736","DOIUrl":null,"url":null,"abstract":"This paper describes the first complete implementation of a non-blocking binary search tree in an asynchronous shared-memory system using single-word compare-and-swap operations. The implementation is linearizable and tolerates any number of crash failures. Insert and Delete operations that modify different parts of the tree do not interfere with one another, so they can run completely concurrently. Find operations only perform reads of shared memory.","PeriodicalId":447863,"journal":{"name":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"200","resultStr":"{\"title\":\"Non-blocking binary search trees\",\"authors\":\"Faith Ellen, P. Fatourou, E. Ruppert, F. Breugel\",\"doi\":\"10.1145/1835698.1835736\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper describes the first complete implementation of a non-blocking binary search tree in an asynchronous shared-memory system using single-word compare-and-swap operations. The implementation is linearizable and tolerates any number of crash failures. Insert and Delete operations that modify different parts of the tree do not interfere with one another, so they can run completely concurrently. Find operations only perform reads of shared memory.\",\"PeriodicalId\":447863,\"journal\":{\"name\":\"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-07-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"200\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1835698.1835736\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1835698.1835736","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 200

摘要

本文描述了异步共享内存系统中使用单字比较交换操作的非阻塞二叉搜索树的第一个完整实现。该实现是线性化的，可以容忍任何数量的崩溃失败。修改树的不同部分的Insert和Delete操作不会相互干扰，因此它们可以完全并发地运行。查找操作只执行对共享内存的读取。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Non-blocking binary search trees

This paper describes the first complete implementation of a non-blocking binary search tree in an asynchronous shared-memory system using single-word compare-and-swap operations. The implementation is linearizable and tolerates any number of crash failures. Insert and Delete operations that modify different parts of the tree do not interfere with one another, so they can run completely concurrently. Find operations only perform reads of shared memory.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing

自引率

0.00%

发文量