A conservative parallel simulation algorithm for entity-oriented modeling

Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238) Pub Date : 1998-12-17 DOI:10.1109/HIPC.1998.738018

C. Lim, M. Low, Boon-Ping Gan

{"title":"A conservative parallel simulation algorithm for entity-oriented modeling","authors":"C. Lim, M. Low, Boon-Ping Gan","doi":"10.1109/HIPC.1998.738018","DOIUrl":null,"url":null,"abstract":"Conservative parallel simulation protocols are such that each logical process (LP) in the simulation execute events only when it is certain that there will not be any time-order causality violation. In these conservative protocols, time-bound information for an LP is computed from the other LPs. We propose a variant form of conservative parallel simulation protocol in which the time-bound for an LP is computed from the existing events in the system. In a conservative protocol such as the Chandy-Misra-Bryant (CMB) protocol, it can be difficult for LP/sub i/ to guarantee different time-bounds to its next LPs. The time-bounds to some LPs may be more restrictive than necessary. If the time-bounds are provided by the entities (events) going through the system (as in our proposed algorithm), an event E at LP/sub i/ can independently supply different time-bounds only to those LPs which may receive events generated by E. We describe the algorithm, outline a proof of its correctness and discuss its possible strengths and weaknesses.","PeriodicalId":175528,"journal":{"name":"Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HIPC.1998.738018","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

Abstract

Conservative parallel simulation protocols are such that each logical process (LP) in the simulation execute events only when it is certain that there will not be any time-order causality violation. In these conservative protocols, time-bound information for an LP is computed from the other LPs. We propose a variant form of conservative parallel simulation protocol in which the time-bound for an LP is computed from the existing events in the system. In a conservative protocol such as the Chandy-Misra-Bryant (CMB) protocol, it can be difficult for LP/sub i/ to guarantee different time-bounds to its next LPs. The time-bounds to some LPs may be more restrictive than necessary. If the time-bounds are provided by the entities (events) going through the system (as in our proposed algorithm), an event E at LP/sub i/ can independently supply different time-bounds only to those LPs which may receive events generated by E. We describe the algorithm, outline a proof of its correctness and discuss its possible strengths and weaknesses.

查看原文本刊更多论文

面向实体建模的保守并行仿真算法

保守并行仿真协议使得仿真中的每个逻辑进程(LP)只有在确定不存在任何时间顺序因果关系违反时才执行事件。在这些保守协议中，一个LP的时限信息是从其他LP中计算出来的。我们提出了一种保守并行仿真协议的变体形式，其中LP的时间限制是根据系统中存在的事件计算的。在像Chandy-Misra-Bryant (CMB)协议这样的保守协议中，LP/sub /很难保证下一个LP的不同时限。一些有限合伙人的时限可能比必要时更严格。如果时间界限是由通过系统的实体(事件)提供的(如我们提出的算法)，则LP/sub i/处的事件E可以独立地为可能接收E生成的事件的LP提供不同的时间界限。我们描述了该算法，概述了其正确性的证明，并讨论了其可能的优点和缺点。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238)

自引率

0.00%

发文量