.png){kind=icon}
返回
An adaptive causal ordering algorithm suited to mobile computing environments
.png){kind=icon}
OA
AI
DOI：10.1006/jpdc.1996.1300.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Causal message ordering is required for several distributed applications, In order to preserve causal ordering, only direct dependency information between messages, with respect to the destination process(es), need be sent with each message. By eliminating other kinds of control information from the messages, the communication overheads can be significantly reduced, In this paper we present an algorithm that uses this knowledge to efficiently enforce causal ordering of messages, The proposed algorithm does not require any prior knowledge of the network topology or communication pattern, As computation proceeds, it acquires knowledge of the communication pattern and is capable of handling dynamically changing multicast communication groups, and minimizing the communication overheads, With regard to communication overheads, the algorithm is optimal for the broadcast communication case, Extensive simulation experiments demonstrate that the algorithm imposes lower communication overheads than previous causal ordering algorithms, The algorithm can be employed in a variety of distributed computing environments, Its energy efficiency and low bandwidth requirement make it especially suitable for mobile computing systems, We show how to employ the algorithm for causally ordered multicasting of messages in mobile computing environments. (C) 1997 Academic Press.
Keyword:
COMMUNICATION
MULTICAST
IMPLEMENT
SYSTEMS
TIME
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏 没有更多内容
没有更多内容