检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《计算机仿真》2004年第4期19-21,24,共4页Computer Simulation
摘 要:该文从算法思想、算法流程和算法分析三方面介绍了一种用于分布式交互作战模拟的时间同步算法。通过综合考虑所有模拟节点的请求推进时间和TSO消息的时间邮戳 ,该算法可以计算出最大的共同推进时间。所有节点都自主处理时间早于该时间的事件和TSO消息 ,不受其它节点影响。该算法并发处理事件和TSO消息 ,时间推进效率较高 ,解决了分布式交互作战模拟的时空一致性问题 ,加快了模拟速度 ,在一定程度上保证了模拟结果的正确性。This paper has introduced a conservative and synchronous algorithm for distributed interaction simulation, which can maintain synchronization between simulating nodes and right order of messages processing. Through consideration of request advancing time and time stamp of TSO message for all the simulating nodes, it is easy to find out the maximal common advancing time. Each node processes its events and TSO messages by itself before the advancing time and isn't affected by other nodes. The algorithm parallelly processes events and TSO messages with relatively high time advancing efficiency, and it can resolve the problem of time and space consistency for Distributed Interaction Simulation, speed up the simulation, and guarantee the rightness of simulation results to some extent.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.166