求助PDF
{"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
引用
批量引用
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