期刊文献+

基于帮助机制的无界无等待通用构造算法

Unbounded Wait-free Universal Construction Algorithm Based on Help Mechanism
下载PDF
导出
摘要 已有的无等待通用构造算法大多只考虑有界无等待的情况,并不适用于无界无等待并发模型。为此,提出一种新的无等待通用构造算法——UWUC。该算法使用Fetch&Add对象和列地址选通脉冲对象,给出新的排队方法,利用任意一段时间内到达的线程数有限的特性,实现无界无等待的通用构造。实验结果证明了该算法的无等待特性。 Existing wait-free universal construction algorithm only considers the bounded wait-free situation and can not be adapted to unbounded wait-free model. This paper presents a novel solution: Unbounded Wait-free Universal Construction( UWUC for short) algorithm which uses Column Address Strobe( CAS) object and FetchAdd object. The number of processes arrived during a time interval is finite,thus using a special queuing technical and helping mechanism implementing the unbounded wait-free universal construction. Experimental results show wait-free characteristics of UWUC algorithm.
出处 《计算机工程》 CAS CSCD 北大核心 2017年第11期22-26,共5页 Computer Engineering
基金 国家自然科学基金(61303021) 水利部公益性行业科研专项基金(201401033)
关键词 并发数据结构 无等待 通用构造 无界无等待 非阻塞 列地址选通脉冲 concurrent data structure wait-free universal construction unbounded wait-free non-blocking Column Address Strobe( CAS )
  • 相关文献

参考文献2

二级参考文献31

  • 1Herlihy M,Shavit N.多处理器编程的艺术[M].金海,胡侃,译.北京:机械工业出版社,2009:141-145.
  • 2Susanne A,Jeffery W.Self-organizing Data Structure[M]//Fiat A,Woeginger G.Online Algorithms:The State of the Art.Berlin,Germany:Springer-Verlag,1998:13-51.
  • 3Valois J D.Lock-free Linked Lists Using Compare-and-swap[C]//Proceedings of the 14th Annual ACM Symposiumon Principles of Distributed Computing.New York,USA:ACM Press,1995.
  • 4Harris T L.A Pragmatic Implementation of Non-blockingLinked-lists[C]//Proceedings of the 15th International Con-ference on Distributed Computing.London,UK:[s.n.],2001.
  • 5Michael M M.High Performance Dynamic Lock-free HashTables and List-based Sets[C]//Proceedings of the 14th AnnualACM Symposium on Parallel Algorithms and Architectures.New York,USA:ACM Press,2002.
  • 6IBM.IBM System/370 Extended Architecture——Principlesof Operation:USA,SA22-7085[P].1983-03-20.
  • 7Treiber R K.Systems Programming:Coping with Parallelism[R].IBM Almaden Research Center,Tech.Rep.:RJ 5118,1986.
  • 8Michael M M.Safe Memory Reclamation for Dynamic Lock-free Objects Using Atomic Reads and Writes[C]//Proceedingsof the 21st Annual Symposium on Principles of DistributedComputing.New York,USA:[s.n.],2002.
  • 9Michael M M.Hazard Pointers:Safe Memory Reclamation forLock-free Objects[J].IEEE Transactions on Parallel andDistributed Systems,2004,15(8):491-504.
  • 10Michael M M.Scalable Lock-free Dynamic Memory Alloca-tion[C]//Proceedings of Special Interest Group onProgramming Languages Notices.Verona,Italy:[s.n.],2004.

共引文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部