期刊文献+

基于时间复杂度优化的分布式互斥请求集生成算法

A Distributed Mutual Exclusion Quorum Generation Algorithm Based on Optimization of Time Complexity
下载PDF
导出
摘要 基于LUK算法和LI的一步逼近算法的优缺点,本文提出了一种时间优化的分布式互斥最优长度请求集生成算法。该算法通过牺牲一定时间复杂度和增设最大松弛度的变量来限制将要纳入请求集的节点的方式,使算法生成的请求集长度保持为,但算法的时间度有很大的降低。 Based on the advantages and disadvantages of LUK’s and LI’s algorithm, a symmetric distributed mutual exclusion quorum generation algorithm with optimal length has been presented in this paper. it ensures that the quorum length is the shortest through expensing some time complexity to limit modes of the nods included in the quorum. It can reduce the time complexity of the quorum generation algorithm obviously.
出处 《微计算机信息》 2010年第27期205-207,共3页 Control & Automation
关键词 分布式 互斥 请求集 最大松弛度 distributed mutual quorum algorithms time complexity
  • 相关文献

参考文献10

  • 1Wai-Shing Luk,Two new quorum based algorithms for distributed mutual exclusion[C],Distributed Computing Systems, 1997 Proceedings of the 17th International Conference on , 1997:100 - 106.
  • 2W K Ng, C V Ravishankar, Coterie templates- a new quorum construction method[C], Distributed Computing Systems,1995, Proceedings of the 15th International Conference,1995,92 - 99.
  • 3LI Meian,LIU Xinsong,WANG Zheng,HE Chuan.A Symmetric Quorum Algorithm for Distributed Mutual Exclusion Based on the Properties of Cyclic Quorum[J].Chinese Journal of Electronics,2006,15(1):17-20. 被引量:9
  • 4李美安,刘心松,王征.一种基于循环编码的高性能分布式互斥算法[J].电子学报,2005,33(8):1397-1402. 被引量:14
  • 5李美安,刘心松,王征.一种基于松弛循环差集的高性能分布式互斥算法[J].电子学报,2007,35(1):58-63. 被引量:11
  • 6K Raymond.Tree-based algorithm for distributed mutual exclusion[J]. ACM Trans Computing Systems,1989, (2) :61-77.
  • 7A Kumar.Hierarchical quorum consensus:a new algorithm for managing replicated data [J].IEEE Trans Computers,1991,(9):996- 1004.
  • 8Y CKuo,S T Huang.A geometric approach for constructing coteries and k-coteries[J].IEEE Trans.Parallel and Distributed Systems, 1997,8(4): 402-411.
  • 9K Ogata,K Futatsugi.Formally modeling and verifying Ricart&Agrawala distributed mutual exclusion algorithm[A].Quality Software, 2001. Proceedings.Second Asia-Pacific Conference on [C].IEEE, 2001.357-366.
  • 10R Baldoni,A Virgillito.A distributed mutual exclusion algorithm for mobile ad-hoc networks [A].Computers and Communications, Proceedings. ISCC 2002.Seventh International Symposium on[C]. IEEE, 2002.539-544.

二级参考文献35

  • 1W K Ng, C V Ravishankar. Coterie templates- a new quorum construction method[A]. Distributed Computing Systems, 1995, Proceedings of the 15th International Conference[C]. IEEE, 1995.92 - 99.
  • 2L Lamport. Time, clocks and ordering of events in distributed systems[J]. Comm ACM, 1978,21(7) :558 - 565.
  • 3G Ricart, A K Agrawala. An optimal algorithm for mutual exclusion in computer networks[J]. Communications of the ACM, 1981,24(1) :9 -17.
  • 4M Maekawa . A √N algorithm for mutual exclusion in decentralized systems[J]. ACM Trans Computer Systems, 1985,3(2) : 145 - 159.
  • 5J Helary. A general scheme for token and tree-based distributed mutual exclusion algorithms[J].IEEE Trans Parallel and Distributed Systems,1994,5(11) : 1185 - 1196.
  • 6M Naimi.An improvenaont of the Log(n) distributed algorithm for mutual exclusion [ A]. Proc. Seventh Int'l Conf. Distributed Computing System[ C].IEEE, 1987. 371 - 375.
  • 7K Raymond. Tree-based algorithm for distributed mutual exclusion[J].ACM Trans Computing Systems, 1989, (2) :61 - 77.
  • 8A Kumar. Hierarchical quorum consensus : a new algorithm for managing replicated data[J]. IEEE Trans Computers, 1991, (9) :996 - 1004.
  • 9Y C Kuo, S T Huang. A geometric approach for constructing coteries and k-coteries [ J ]. IEEE Trans. Parallel and Distributed Systems,1997,8(4):402-411.
  • 10K Ogata, K Futatsugi. Formally modeling and verifying Ricart&Agrawala distributed mutual exclusion algorithm[A]. Quali-ty Software, 2001.Proceedings. Second Asia-Pacific Conference on[C]. IEEE, 2001. 357-366.

共引文献21

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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