事件驱动仿真同步的双表方法

J. Blackstone, G. Hogg, D. T. Phillips
{"title":"事件驱动仿真同步的双表方法","authors":"J. Blackstone, G. Hogg, D. T. Phillips","doi":"10.5555/800077.802500","DOIUrl":null,"url":null,"abstract":"The traditional mechanism for maintaining a list of pending events in a discrete event simulation is the simple linked list. However, in large scale simulations this list often becomes cumbersome to maintain since the number of pending events may become quite large. As a result, the execution time required by the simple linked list is often a significant portion of total simulation time. Several articles have been published suggesting improved synchronization procedures. The most efficient procedures reported are the time indexed procedure and the two level procedure. Both methodologies are designed for use in languages such as PASCAL or Pl/l, and as a result neither algorithm translates well into FORTRAN. Further, both procedures require external parameter definition, which is a major handicap to their adoption by a general purpose language. This paper introduces a new synchronization procedure, the two list procedure, which is much faster than simple linked lists for large pending event files. This procedure was designed for implementation in FORTRAN, and properly implemented it is transparent to the user; thus it is ideal for adoption by general purpose simulation languages.","PeriodicalId":186490,"journal":{"name":"Annual Simulation Symposium","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1981-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A Two-list method for synchronization of event driven simulation\",\"authors\":\"J. Blackstone, G. Hogg, D. T. Phillips\",\"doi\":\"10.5555/800077.802500\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The traditional mechanism for maintaining a list of pending events in a discrete event simulation is the simple linked list. However, in large scale simulations this list often becomes cumbersome to maintain since the number of pending events may become quite large. As a result, the execution time required by the simple linked list is often a significant portion of total simulation time. Several articles have been published suggesting improved synchronization procedures. The most efficient procedures reported are the time indexed procedure and the two level procedure. Both methodologies are designed for use in languages such as PASCAL or Pl/l, and as a result neither algorithm translates well into FORTRAN. Further, both procedures require external parameter definition, which is a major handicap to their adoption by a general purpose language. This paper introduces a new synchronization procedure, the two list procedure, which is much faster than simple linked lists for large pending event files. This procedure was designed for implementation in FORTRAN, and properly implemented it is transparent to the user; thus it is ideal for adoption by general purpose simulation languages.\",\"PeriodicalId\":186490,\"journal\":{\"name\":\"Annual Simulation Symposium\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1981-03-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Annual Simulation Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5555/800077.802500\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annual Simulation Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5555/800077.802500","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

在离散事件模拟中维护挂起事件列表的传统机制是简单的链表。然而,在大规模模拟中,由于待处理事件的数量可能会变得相当大,因此该列表通常变得难以维护。因此,简单链表所需的执行时间通常占整个模拟时间的很大一部分。已经发表了几篇文章,建议改进同步过程。报告中效率最高的程序是时间索引程序和二级程序。这两种方法都是为PASCAL或Pl/l等语言设计的,因此两种算法都不能很好地转换为FORTRAN。此外,这两个过程都需要外部参数定义,这是通用语言采用它们的主要障碍。本文介绍了一种新的同步过程,即双链表同步过程,它比简单链表同步过程要快得多。本程序的设计是为了在FORTRAN中实现,并且正确的实现对用户是透明的;因此,它是通用仿真语言的理想选择。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Two-list method for synchronization of event driven simulation
The traditional mechanism for maintaining a list of pending events in a discrete event simulation is the simple linked list. However, in large scale simulations this list often becomes cumbersome to maintain since the number of pending events may become quite large. As a result, the execution time required by the simple linked list is often a significant portion of total simulation time. Several articles have been published suggesting improved synchronization procedures. The most efficient procedures reported are the time indexed procedure and the two level procedure. Both methodologies are designed for use in languages such as PASCAL or Pl/l, and as a result neither algorithm translates well into FORTRAN. Further, both procedures require external parameter definition, which is a major handicap to their adoption by a general purpose language. This paper introduces a new synchronization procedure, the two list procedure, which is much faster than simple linked lists for large pending event files. This procedure was designed for implementation in FORTRAN, and properly implemented it is transparent to the user; thus it is ideal for adoption by general purpose simulation languages.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信