基于叶搜索的无锁二叉搜索树

Q4 Computer Science

International Journal of Open Source Software and Processes Pub Date : 2017-04-01 DOI:10.4018/IJOSSP.2017040103

Yang Zhang, Xin Yu, Dongwen Zhang, Mengmeng Wei, Yanan Liang

{"title":"基于叶搜索的无锁二叉搜索树","authors":"Yang Zhang, Xin Yu, Dongwen Zhang, Mengmeng Wei, Yanan Liang","doi":"10.4018/IJOSSP.2017040103","DOIUrl":null,"url":null,"abstract":"Binary search tree is one of the most important data structures in program design. This article proposesanovellock-freealgorithm,whichcanimplementthelock-freeoperations,suchassearch, insertanddelete,usingcompareandswap(CAS).Unlikethepreviousstudiesofhandlingtheinside nodeinatree,theauthors’algorithmhandlestheinsertanddeleteoperationsbyconsideringofthe subtree.Thisarticlepresentsthedetailsofthelock-freealgorithm,whichcaneffectivelyreducethe contentionbetweentheupdateoperations.Theexperimentcomparesthealgorithmwithothertwo lock-freealgorithmsbythroughput.Evaluationresultsshowthatthethroughputofthealgorithm outperformsthatoftheothertwoconcurrentBSTswhenthenumberofthreadsismorethan4.The authors’algorithmwillbecompetitivewhentheconcurrencyishigh. KeywORdS Binary Search Tree, CAS, Concurrent Data Structure, Lock-Free","PeriodicalId":53605,"journal":{"name":"International Journal of Open Source Software and Processes","volume":"33 1","pages":"44-58"},"PeriodicalIF":0.0000,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Lock-Free Binary Search Tree Based on Leaf Search\",\"authors\":\"Yang Zhang, Xin Yu, Dongwen Zhang, Mengmeng Wei, Yanan Liang\",\"doi\":\"10.4018/IJOSSP.2017040103\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Binary search tree is one of the most important data structures in program design. This article proposesanovellock-freealgorithm,whichcanimplementthelock-freeoperations,suchassearch, insertanddelete,usingcompareandswap(CAS).Unlikethepreviousstudiesofhandlingtheinside nodeinatree,theauthors’algorithmhandlestheinsertanddeleteoperationsbyconsideringofthe subtree.Thisarticlepresentsthedetailsofthelock-freealgorithm,whichcaneffectivelyreducethe contentionbetweentheupdateoperations.Theexperimentcomparesthealgorithmwithothertwo lock-freealgorithmsbythroughput.Evaluationresultsshowthatthethroughputofthealgorithm outperformsthatoftheothertwoconcurrentBSTswhenthenumberofthreadsismorethan4.The authors’algorithmwillbecompetitivewhentheconcurrencyishigh. KeywORdS Binary Search Tree, CAS, Concurrent Data Structure, Lock-Free\",\"PeriodicalId\":53605,\"journal\":{\"name\":\"International Journal of Open Source Software and Processes\",\"volume\":\"33 1\",\"pages\":\"44-58\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Open Source Software and Processes\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4018/IJOSSP.2017040103\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Computer Science\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Open Source Software and Processes","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4018/IJOSSP.2017040103","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Computer Science","Score":null,"Total":0}

引用次数: 0

摘要

二进制搜索树是程序设计中最重要的数据结构之一。这篇文章proposesanovellock-freealgorithm，whichcanimplementthelock-freeoperations，suchassearch, insertanddelete，usingcompareandswap(CAS)。Unlikethepreviousstudiesofhandlingtheinside nodeinatree，theauthors ' algorithmhandlestheinsertanddeleteoperationsbyconsideringofthe子树。Thisarticlepresentsthedetailsofthelock-freealgorithm，whichcaneffectivelyreducethe contentionbetweentheupdateoperations。Theexperimentcomparesthealgorithmwithothertwo lock-freealgorithmsbythroughput。Evaluationresultsshowthatthethroughputofthealgorithm outperformsthatoftheothertwoconcurrentBSTswhenthenumberofthreadsismorethan4。The作者algorithmwillbecompetitivewhentheconcurrencyishigh。关键词二叉搜索树，CAS，并发数据结构，无锁

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

查看原文本刊更多论文

Lock-Free Binary Search Tree Based on Leaf Search

Binary search tree is one of the most important data structures in program design. This article proposesanovellock-freealgorithm,whichcanimplementthelock-freeoperations,suchassearch, insertanddelete,usingcompareandswap(CAS).Unlikethepreviousstudiesofhandlingtheinside nodeinatree,theauthors’algorithmhandlestheinsertanddeleteoperationsbyconsideringofthe subtree.Thisarticlepresentsthedetailsofthelock-freealgorithm,whichcaneffectivelyreducethe contentionbetweentheupdateoperations.Theexperimentcomparesthealgorithmwithothertwo lock-freealgorithmsbythroughput.Evaluationresultsshowthatthethroughputofthealgorithm outperformsthatoftheothertwoconcurrentBSTswhenthenumberofthreadsismorethan4.The authors’algorithmwillbecompetitivewhentheconcurrencyishigh. KeywORdS Binary Search Tree, CAS, Concurrent Data Structure, Lock-Free

求助全文

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

来源期刊

International Journal of Open Source Software and Processes Computer Science-Software

CiteScore

1.90

自引率

0.00%

发文量

期刊介绍： The International Journal of Open Source Software and Processes (IJOSSP) publishes high-quality peer-reviewed and original research articles on the large field of open source software and processes. This wide area entails many intriguing question and facets, including the special development process performed by a large number of geographically dispersed programmers, community issues like coordination and communication, motivations of the participants, and also economic and legal issues. Beyond this topic, open source software is an example of a highly distributed innovation process led by the users. Therefore, many aspects have relevance beyond the realm of software and its development. In this tradition, IJOSSP also publishes papers on these topics. IJOSSP is a multi-disciplinary outlet, and welcomes submissions from all relevant fields of research and applying a multitude of research approaches.