检索结果-内蒙古大学图书馆

International Conference on Telecommunications and Networking (TeNe)/International Conference on Industrial Electronics, Technology and Automation (IETA)

作者： Rizvi, Syed S. Elleitby, K. M. Riasat, Aasia Univ Bridgeport Dept Comp Sci & Engn Bridgeport CT 06605 USA Old Dominion Univ Dept Comp Sci Norfolk VA 23529 USA

ISBN: (纸本)9781402062650

The performance of a conservative time management algorithm in a distributed simulation system degrade s significantly if a large number of null messages are exchanged across the logical processes in order to avoid deadlock. This situation gets more severe when the exchange of null messages is increased due to the poor selection of key parameters such as lookahead values. However, with a mathematical model that can approximate the optimal values of parameters that are directly involved in the performance of a time management algorithm, we can limit the exchange of null messages. The reduction in the exchange of null messages greatly improves the performance of the time management algorithm by both minimizing the transmission overhead and maintaining a consistent parallelization. This paper presents a generic mathematical model that can be effectively used to evaluate the performance of a conservative distributed simulation system that uses null messages to avoid deadlock. Since the proposed mathematical model is generic, the performance of any conservative synchronization algorithm can be approximated. In addition, we develop a performance model that demonstrates that how a conservative distributed simulation system performs with the null message algorithm (NMA). The simulation results show that the performance of a conservative distributed system degrades if the NMA generates an excessive number of null messages due to the improper selection of parameters. In addition, the proposed mathematical model presents the critical role of lookahead which may increase or decrease the amount of null messages across the logical processes. Furthermore, the proposed mathematical model is not limited to NMA. It can also be used with any conservative synchronization algorithm to approximate the optimal values of parameters.

关键词： conservative distributed simulation Logical processes null messages Lookahead Null message algorithm

来源：评论

学校读者我要写书评

暂无评论

Reducing Null Message Traffic in Large Parallel and distributed Systems

Reducing Null Message Traffic in Large Parallel and Distribu...

引用

13th IEEE Symposium on Computers and Communications

作者： Rizvi, Syed S. Elleithy, Khaled M. Riasat, Aasia Univ Bridgeport Dept Comp Sci & Engn Bridgeport CT 06601 USA Inst Business Management Dept Comp Sci Karachi Pakistan

ISBN: (纸本)9781424427024

Null message algorithm (NMA) is one of the efficient conservative time management algorithms that use null messages to provide synchronization between the logical processes (LPs) in a parallel discrete event simulation (PDES) system. However, the performance of a PDES system could be severely degraded if a large number of null messages need to be generated by LPs to avoid deadlock. In this paper, we present a mathematical model based on the quantitative criteria specified in [12] to optimize the performance of NMA by reducing the null message traffic. Moreover, the proposed mathematical model can be used to approximate the optimal values of some critical parameters such as frequency of transmission, Lookahead (L) values, and the variance of null message elimination. In addition, the performance analysis of the proposed mathematical model incorporates both uniform and non-uniform distribution of L values across multiple output lines of an LP. Our simulation and numerical analysis suggest that an optimal NMA offers better scalability in PDES system if it is used with the proper selection of critical parameters.

关键词： conservative distributed simulation discrete event null messages parallel and distributed systems

来源：评论

学校读者我要写书评

暂无评论

Analysis and Performance Evaluation of Coloured Petri Nets by Means of distributed simulation

引用

IFAC Proceedings Volumes 1995年第23期28卷 287-291页

作者： A. Nketsa Laboratoire d’Analyse et d’Architecture des Systèmes du CNRS. 7 Avenue du Colonel Roche - 31077 TOULOUSE Cedex - France E-mail :

This paper presents an approach to build a distributed simulator of coloured Petri nets. The main idea is to combine in the simulator formal analysis of Petri nets and their simulation experiments. One of the problems to solve in distributed simulation is the partitionning of simulation among the processors. In our paper we show that this distribution of coloured Petri nets can be used to speed up simulation and to carry on performance evaluation and analysis based on net transformations.

关键词： Coloured Petri Nets conservative distributed simulation Petri nets properties

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：