期刊文献+

层次式体系结构下一种似然时标系统

A Plausible Timestamp System in Hierarchical Architecture
下载PDF
导出
摘要 当前,分布式系统具有越来越大的规模,而且可能层次地分布在广域网上,这些属性增加了保证分布式系统中时序关系的难度.向量时钟可以准确地探测事件间的时序关系,但是向量时钟的维度与节点数相同,就引起了效率和可扩展性问题.该文提出了层次体系结构下确定分布式系统时序关系的一种优化解决方案.首先给出了分布式系统的一种层次式体系结构,其中独立的子组通过代理进程互连,组成集群完成特定目标;在这种结构中,采用"分而治之"的策略,提出了一种似然时标系统,其特点是消息传输时的时间标签仅仅是系统时标的一部分.该时标系统能够探测大规模分布式系统中消息间的因果关系,而且具有较好的效率和可扩展性. Currently, in distributed systems there are more and more processes which are hierarchically distributed in the wide area network, which make it hard to realize the causality in the distributed systems. In a distributed system with N sites, the precise detection of causal relationships between events can only be done with vector clocks of size N. This gives rise to scalability and efficiency problems for vector clocks. In this paper, a kind of hierarchical architecture is described in which proxy process is used to exchange messages between the subgroups and global group can be composed to achieve some objectives. A plausible timestamp system is presented using divide-and-conquer approach, in which only a part of the timestamp is attached to the message as the tag whenever the message is transmitted. The timestamp system allows to detecting causality between events in a large distributed system with high degree of accuracy, enhancing the scalability of the system and minimizing the affection because of adding or reducing federates.
出处 《计算机学报》 EI CSCD 北大核心 2008年第3期456-466,共11页 Chinese Journal of Computers
基金 国家自然科学基金(60773019) 国家“八六三”高技术研究发展计划项目基金(2006AA02Z330)资助
关键词 似然时标系统 层次式结构 代理进程 分而治之 仿真 plausible clock hierarchical architecture proxy process divide-and-conquer simulation
  • 相关文献

参考文献22

  • 1Lamport L. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 1978, 21 (7) :558-565
  • 2Defense Modeling and Simulation Office. HLA Time Management: Design Document, 1996
  • 3Fidge Colin J. Timestamps in message-passing systems that preserve the partial ordering//Proceedings of the 11th Australian Computer Science Conference. University of Queensland, Brisbane, Australia, 1988:56-66
  • 4Mattern Friedemann. Virtual time and alobal states of distributed systems//Cosnard M et al eds. Proceedings of the International Workshop on Parallel and Distributed Algorithms. Amsterdam: Elsevier Science Publishers, 1989: 215- 226
  • 5Charron-Bost Bernadette. Concerning the size of logical clocks in distributed systems. Information Processing Letters, 1991, 39: 11-16
  • 6Torres-Rojas F, Ahamad M. Plausible TSSs: Constant size logical clocks for distributed systems//Proceedings of the 10th International Workshop on Distributed Algorithms (WDAG 96). Bologna, Italy, 1996
  • 7Mohamed EI-Darieby, Dorina Petriu, Jerry Rolia. A hierarchical distributed protocol for MPLS path creation//Proceedings of the 7th International Symposium on Computers and Communications(ISCC'02). Taormina, Italy, 2002: 920-926
  • 8Taguchi Kojiro, Tomoya Enokido, Takizawa Makoto. Causality in hierarchical group communication//Proceedings of the 23rd International Conference on Distributed Computing Systems Workshops (ICDCSW'03). Rhode, Island, USA, 2003: 568-573
  • 9Kawanami Satoshi, Tomoya Enokido, Takizawa Makoto. A group communication protocol for scalable causal ordering// Proceedings of the 18th International Conference on Advanced Information Networking and Application (AINA'04). Fukuoka, Japan, 2004:296-302
  • 10Khotimsky Denis A, Zhuklinets Igor A. Hierarchical vector clock: Scalable plausible clock for detecting causality in large distributed systems//Proceedings of the 2nd International Conference on ATM (ICATM'99). University of Haute AIsace, Mulhouse, Frace, 1999: 156-163

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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