Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms

Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms

ID:33680400

大小:176.66 KB

页数:9页

时间:2019-02-28

Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms_第1页
Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms_第2页
Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms_第3页
Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms_第4页
Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms_第5页
资源描述:

《Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、Simple,Fast,andPracticalNon-BlockingandBlockingConcurrentQueueAlgorithmsMagedM.MichaelMichaelL.ScottDepartmentofComputerScienceUniversityofRochesterRochester,NY14627-0226fmichael,scottg@cs.rochester.eduAbstract1IntroductionConcurrentFIFOqueuesarewidelyusedinparallelap-Drawingideasfrompreviousauth

2、ors,wepresentanewplicationsandoperatingsystems.Toensurecorrectness,non-blockingconcurrentqueuealgorithmandanewtwo-concurrentaccesstosharedqueueshastobesynchronized.lockqueuealgorithminwhichoneenqueueandonede-Generally,algorithmsforconcurrentdatastructures,in-queuecanproceedconcurrently.Bothalgorit

3、hmsaresim-cludingFIFOqueues,fallintotwocategories:blockingple,fast,andpractical;weweresurprisednottofindthemandnon-blocking.Blockingalgorithmsallowasloworde-intheliterature.Experimentsona12-nodeSGIChallengelayedprocesstopreventfasterprocessesfromcompletingmultiprocessorindicatethatthenewnon-blockin

4、gqueueoperationsontheshareddatastructureindefinitely.Non-consistentlyoutperformsthebestknownalternatives;itisblockingalgorithmsguaranteethatifthereareoneormoretheclearalgorithmofchoiceformachinesthatprovideaactiveprocessestryingtoperformoperationsonashareduniversalatomicprimitive(e.g.compareandswap

5、ordatastructure,someoperationwillcompletewithinafiniteloadlinked/storeconditional).Thetwo-locknumberoftimesteps.Onasynchronous(especiallymulti-concurrentqueueoutperformsasinglelockwhenseveralprogrammed)multiprocessorsystems,blockingalgorithmsprocessesarecompetingsimultaneouslyforaccess;itap-suffers

6、ignificantperformancedegradationwhenaprocesspearstobethealgorithmofchoiceforbusyqueuesonma-ishaltedordelayedataninopportunemoment.Possiblechineswithnon-universalatomicprimitives(e.g.testsourcesofdelayincludeprocessorschedulingpreemption,andset).Sincemuchofthemotivationfornon-blockingpagefaults,andc

7、achemisses.Non-blockingalgorithmsalgorithmsisrootedintheirimmunitytolarge,unpre-aremorerobustinthefaceoftheseevents.dictabledelaysinprocessexecution,wereportexperimentalManyresearchershaveproposedlock-freealgorit

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。