.png){kind=icon}
返回
Hierarchical partitioning algorithm for optimistic distributed simulation of DEVS models
.png){kind=icon}
PRE
AI
DOI：10.1016/S1383-7621(97)00057-X.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The partitioning problem of models is one of the most important issues which may affect the performance of distributed simulation. This paper presents a novel partitioning algorithm for the optimistic distributed simulation of hierarchical, modular Discrete Event System Specification (DEVS) models. The proposed algorithm pursues the following three goals to achieve the overall objective of the minimum simulation time: (1) to balance the computational loads of partitions, (2) to maximize the parallel execution of independent models, and (3) to minimize inter-processor communication. To maximize parallel execution of independent models, the proposed algorithm utilizes the hierarchical structural information of models available from the hierarchical model design methodology of the DEVS formalism. Through benchmark simulation experiments, we show that the proposed algorithm achieves good performance.
Keyword:
partitioning/mapping
DEVS formalism
time warp
hierarchical simulation
parallel/distributed discrete event simulation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.1
论文数:
3.0K
被引数:
4.2K
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏 没有更多内容
没有更多内容