首页 > 最新文献

Proceedings of the 2020 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation最新文献

英文 中文
Runtime Abstraction-Level Conversion of Discrete-Event Wafer-fabrication Models for Simulation Acceleration 面向仿真加速的离散事件晶圆制造模型的运行时抽象级转换
Moon Gi Seok, Chew Wye Chan, Wentong Cai, H. Sarjoughian, Daejin Park
Speeding up the simulation of discrete-event wafer fab models is essential because optimizing the scheduling and dispatching policies under various circumstances requires repeated evaluation of the decision candidates during parameter-space exploration. In this paper, we present a runtime abstraction-level conversion approach for discrete-event wafer-fabrication (wafer-fab) models to gain simulation speedup. During the simulation, if a machine group of the wafer fab models reaches a steady state, then the proposed approach attempts to substitute this group model with a mean-delay model (MDM) as a high abstraction level model. The MDM abstracts the detailed operations of the group's sub-component models into an average delay based on the queueing modeling, which can guarantee acceptable accuracy under steady state. The proposed abstraction-level converter (ALC) observes the queueing parameters of low-level groups to identify the convergence of each group's work-in-progress (WIP) level through a statistical test. When a group's WIP level is converged, the output-to-input couplings between the models are revised to change a wafer-lot process flow from the low-level group to a mean-delay model. When the ALC detects a divergence caused by a re-entrant flow or a machine-down, the high-level model is switched back to its corresponding low-level group model. The ALC then generates dummy wafer-lot events to synchronize the busyness of high-level steady state. The proposed method was applied to case studies of wafer-fab systems and achieves simulation speedup from 6.1 to 11.8 times with corresponding 2.5 to 5.9% degradation inaccuracy.
加速离散事件晶圆厂模型的仿真至关重要,因为在各种情况下优化调度策略需要在参数空间探索过程中反复评估决策候选项。在本文中,我们提出了一种离散事件晶圆制造(wafer-fab)模型的运行时抽象级转换方法,以获得仿真加速。在仿真过程中,如果某一组晶圆厂模型达到稳定状态,则该方法尝试用平均延迟模型(MDM)替代该组模型作为高抽象级别模型。MDM基于排队建模,将组子组件模型的详细操作抽象为平均延迟,可以保证稳定状态下可接受的精度。提出的抽象级转换器(ALC)通过观察低级组的排队参数,通过统计检验来识别每个组的在制品(WIP)级别的收敛性。当一个组的在制品水平收敛时,修正模型之间的输出-输入耦合,将低水平组的晶圆批工艺流程更改为平均延迟模型。当ALC检测到由可重入流或机器停机引起的偏离时,高级模型将切换回相应的低级组模型。然后,ALC生成虚拟晶片事件来同步高级稳定状态的繁忙。将该方法应用于晶圆厂系统的实例研究中,仿真速度从6.1倍提高到11.8倍,退化误差为2.5 ~ 5.9%。
{"title":"Runtime Abstraction-Level Conversion of Discrete-Event Wafer-fabrication Models for Simulation Acceleration","authors":"Moon Gi Seok, Chew Wye Chan, Wentong Cai, H. Sarjoughian, Daejin Park","doi":"10.1145/3384441.3395982","DOIUrl":"https://doi.org/10.1145/3384441.3395982","url":null,"abstract":"Speeding up the simulation of discrete-event wafer fab models is essential because optimizing the scheduling and dispatching policies under various circumstances requires repeated evaluation of the decision candidates during parameter-space exploration. In this paper, we present a runtime abstraction-level conversion approach for discrete-event wafer-fabrication (wafer-fab) models to gain simulation speedup. During the simulation, if a machine group of the wafer fab models reaches a steady state, then the proposed approach attempts to substitute this group model with a mean-delay model (MDM) as a high abstraction level model. The MDM abstracts the detailed operations of the group's sub-component models into an average delay based on the queueing modeling, which can guarantee acceptable accuracy under steady state. The proposed abstraction-level converter (ALC) observes the queueing parameters of low-level groups to identify the convergence of each group's work-in-progress (WIP) level through a statistical test. When a group's WIP level is converged, the output-to-input couplings between the models are revised to change a wafer-lot process flow from the low-level group to a mean-delay model. When the ALC detects a divergence caused by a re-entrant flow or a machine-down, the high-level model is switched back to its corresponding low-level group model. The ALC then generates dummy wafer-lot events to synchronize the busyness of high-level steady state. The proposed method was applied to case studies of wafer-fab systems and achieves simulation speedup from 6.1 to 11.8 times with corresponding 2.5 to 5.9% degradation inaccuracy.","PeriodicalId":422248,"journal":{"name":"Proceedings of the 2020 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"139 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114431433","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Evaluation of Link Failure Resilience in Multirail Dragonfly-Class Networks through Simulation 基于仿真的多轨蜻蜓级网络链路故障恢复能力评估
Neil McGlohon, R. Ross, C. Carothers
During long-term operation of a high-performance computing (HPC) system with thousands of components, many components will inevitably fail. The current trend in HPC interconnect router linkage is moving away from passive copper and toward active optical-based cables. Optical links offer greater bandwidth maximums in a smaller wire gauge, less signal loss, and lower latency over long distances and have no risk of electromagnetic interference from other nearby cables. The benefits of active optical links, however, come with a cost: an increased risk of component failure compared with that of passive copper cables. One way to increase the resilience of a network is to add redundant links; if one of a multiplicity of links between any two routers fails, a single hop path will still exist between them. But adding redundant links comes at the cost of using more router ports for router-router linkage, reducing the maximum size of the network with a fixed router radix. Alternatively, a secondary plane of routers can be added to the interconnect, keeping the number of compute node endpoints the same but where each node has multiple rails of packet injection, at least one per router plane. This multirail-multiplanar type of network interconnect allows the overall size of the network to be unchanged but results in a large performance benefit, even with lower-specification hardware, while also increasing the resilience of the network to link failure. We extend the CODES framework to enable multirail-multiplanar 1D-Dragonfly and Megafly networks and to allow for arbitrary link failure patterns with added dynamic failure-aware routing so that topology resilience can be measured. We use this extension to evaluate two similarly sized 1D-Dragonfly and Megafly networks with and without secondary router planes, and we compare their application communication performance with increasing levels of link failure.
在由数千个部件组成的高性能计算系统的长期运行中,许多部件不可避免地会出现故障。当前HPC互连路由器连接的趋势是从无源铜缆转向基于有源光缆。光链路在更小的线规下提供更大的最大带宽,更少的信号损失和更低的长距离延迟,并且没有来自附近其他电缆的电磁干扰的风险。然而,有源光链路的好处是有代价的:与无源铜电缆相比,组件故障的风险增加了。增加网络弹性的一种方法是增加冗余链路;如果任意两台路由器之间的多条链路中的一条发生故障,它们之间仍然存在一条单跳路径。但是,增加冗余链路的代价是使用更多的路由器端口进行路由器-路由器连接,减少了使用固定路由器基数的网络的最大规模。或者,可以在互连中添加路由器的辅助平面,保持计算节点端点的数量相同,但每个节点有多个数据包注入轨道,每个路由器平面至少有一个。这种多轨道-多平面类型的网络互连允许网络的总体大小保持不变,但即使使用较低规格的硬件,也会带来很大的性能优势,同时还增加了网络对链路故障的恢复能力。我们扩展了CODES框架,以支持多轨道多平面1D-Dragonfly和Megafly网络,并允许添加动态故障感知路由的任意链路故障模式,以便可以测量拓扑弹性。我们使用这个扩展来评估两个类似大小的1D-Dragonfly和Megafly网络,有和没有辅助路由器平面,我们比较它们的应用程序通信性能与不断增加的链路故障水平。
{"title":"Evaluation of Link Failure Resilience in Multirail Dragonfly-Class Networks through Simulation","authors":"Neil McGlohon, R. Ross, C. Carothers","doi":"10.1145/3384441.3395989","DOIUrl":"https://doi.org/10.1145/3384441.3395989","url":null,"abstract":"During long-term operation of a high-performance computing (HPC) system with thousands of components, many components will inevitably fail. The current trend in HPC interconnect router linkage is moving away from passive copper and toward active optical-based cables. Optical links offer greater bandwidth maximums in a smaller wire gauge, less signal loss, and lower latency over long distances and have no risk of electromagnetic interference from other nearby cables. The benefits of active optical links, however, come with a cost: an increased risk of component failure compared with that of passive copper cables. One way to increase the resilience of a network is to add redundant links; if one of a multiplicity of links between any two routers fails, a single hop path will still exist between them. But adding redundant links comes at the cost of using more router ports for router-router linkage, reducing the maximum size of the network with a fixed router radix. Alternatively, a secondary plane of routers can be added to the interconnect, keeping the number of compute node endpoints the same but where each node has multiple rails of packet injection, at least one per router plane. This multirail-multiplanar type of network interconnect allows the overall size of the network to be unchanged but results in a large performance benefit, even with lower-specification hardware, while also increasing the resilience of the network to link failure. We extend the CODES framework to enable multirail-multiplanar 1D-Dragonfly and Megafly networks and to allow for arbitrary link failure patterns with added dynamic failure-aware routing so that topology resilience can be measured. We use this extension to evaluate two similarly sized 1D-Dragonfly and Megafly networks with and without secondary router planes, and we compare their application communication performance with increasing levels of link failure.","PeriodicalId":422248,"journal":{"name":"Proceedings of the 2020 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128147796","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Precise Virtual Time Advancement for Network Emulation 网络仿真的精确虚拟时间推进
Vignesh Babu, D. Nicol
Network emulators enable rapid prototyping and testing of applications. In a typical emulation the execution order and process execution burst lengths are managed by the host platform's operating system, largely independent of the emulator. Timer based mechanisms are typically used, but the imprecision of timer firings introduces imprecision in the advancement of time. This leads to statistical variation in behavior which is not due to the model. We describe Kronos, a small set of modifications to the Linux kernel that use precise instruction level tracking of process execution and control over execution order of containers, and so improve the mapping of executed behavior to advancement in time. This, and control of execution and placement of emulated processes in virtual time make the behavior of the emulation independent of the CPU resources of the platform which hosts the emulation. Under Kronos each process has its own virtual clock which is advanced based on a count of the number of x86 assembly instructions executed by its children. We experimentally show that Kronos is scalable, in the sense that the system behavior is accurately captured even as the size of the emulated system increases relative to fixed emulation resources. We demonstrate the impact of Kronos' time advancement precision by comparing it against emulations which like Kronos are embedded in virtual time, but unlike Kronos rely on Linux timers to control virtual machines and measure their progress in virtual time. We also present two useful applications where Kronos aids in generating high fidelity emulation results at low hardware costs: (1) analysing protocol performance and (2) enabling analysis of cyber physical control systems.
网络仿真器使应用程序的快速原型和测试成为可能。在典型的仿真中,执行顺序和进程执行突发长度由主机平台的操作系统管理,在很大程度上独立于仿真器。通常使用基于计时器的机制,但是计时器触发的不精确会在时间的推进中引入不精确。这导致了与模型无关的行为的统计变化。我们将描述Kronos,这是对Linux内核的一小部分修改,它使用精确的指令级进程执行跟踪和对容器执行顺序的控制,从而改进了执行行为与时间进度的映射。这一点,以及在虚拟时间内对仿真进程的执行和放置的控制,使得仿真的行为独立于承载仿真的平台的CPU资源。在Kronos下,每个进程都有自己的虚拟时钟,这个时钟是基于其子进程执行的x86汇编指令的数量来计算的。我们通过实验证明了Kronos是可扩展的,从某种意义上说,即使模拟系统的大小相对于固定的模拟资源增加,系统行为也能被准确地捕获。我们通过将Kronos与嵌入虚拟时间的仿真进行比较来展示Kronos的时间推进精度的影响,但与Kronos不同的是,Kronos依赖Linux计时器来控制虚拟机并测量虚拟时间中的进度。我们还介绍了两个有用的应用,其中Kronos有助于以低硬件成本生成高保真仿真结果:(1)分析协议性能和(2)启用网络物理控制系统分析。
{"title":"Precise Virtual Time Advancement for Network Emulation","authors":"Vignesh Babu, D. Nicol","doi":"10.1145/3384441.3395978","DOIUrl":"https://doi.org/10.1145/3384441.3395978","url":null,"abstract":"Network emulators enable rapid prototyping and testing of applications. In a typical emulation the execution order and process execution burst lengths are managed by the host platform's operating system, largely independent of the emulator. Timer based mechanisms are typically used, but the imprecision of timer firings introduces imprecision in the advancement of time. This leads to statistical variation in behavior which is not due to the model. We describe Kronos, a small set of modifications to the Linux kernel that use precise instruction level tracking of process execution and control over execution order of containers, and so improve the mapping of executed behavior to advancement in time. This, and control of execution and placement of emulated processes in virtual time make the behavior of the emulation independent of the CPU resources of the platform which hosts the emulation. Under Kronos each process has its own virtual clock which is advanced based on a count of the number of x86 assembly instructions executed by its children. We experimentally show that Kronos is scalable, in the sense that the system behavior is accurately captured even as the size of the emulated system increases relative to fixed emulation resources. We demonstrate the impact of Kronos' time advancement precision by comparing it against emulations which like Kronos are embedded in virtual time, but unlike Kronos rely on Linux timers to control virtual machines and measure their progress in virtual time. We also present two useful applications where Kronos aids in generating high fidelity emulation results at low hardware costs: (1) analysing protocol performance and (2) enabling analysis of cyber physical control systems.","PeriodicalId":422248,"journal":{"name":"Proceedings of the 2020 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115872206","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
A Method for Robustness Optimization Using Generative Adversarial Networks 基于生成对抗网络的鲁棒性优化方法
S. Bergmann, N. Feldkamp, Florian Conrad, S. Strassburger
This paper presents an approach for optimizing the robustness of production and logistic systems based on deep generative models, a special method of deep learning. Robustness here refers to setting controllable factors of a system in such a way that variance in the uncontrollable factors (noise) has a minimal effect on given output parameters. In a case study, the proposed method is tested and compared to a traditional method for robustness analysis. The basic idea is to use deep neural networks to generate data for experiment plans and rate them by use of a simulation model of the production system. We propose to use two Generative Adversarial Networks (GANs) to generate optimized experiment plans for the decision factors and the noise factors, respectively, in a competitive, turn-based game. In one turn, the controllable factors are optimized and the noise remains constant, and vice versa in the next turn. For the calculations of the robustness, the planned experiments are conducted and rated using a simulation model in each learning step.
本文提出了一种基于深度生成模型的生产和物流系统鲁棒性优化方法,这是一种特殊的深度学习方法。这里的鲁棒性是指设置系统的可控因素,使不可控因素(噪声)的方差对给定输出参数的影响最小。在一个案例研究中,对所提出的方法进行了测试,并与传统的鲁棒性分析方法进行了比较。其基本思想是使用深度神经网络为实验计划生成数据,并通过使用生产系统的仿真模型对其进行评级。我们建议使用两个生成对抗网络(GANs)分别为竞争性回合制博弈中的决策因素和噪声因素生成优化的实验计划。在一圈内,可控因素得到优化,噪声保持不变;在下一圈中,反之亦然。对于鲁棒性的计算,在每个学习步骤中使用仿真模型进行计划实验并进行评级。
{"title":"A Method for Robustness Optimization Using Generative Adversarial Networks","authors":"S. Bergmann, N. Feldkamp, Florian Conrad, S. Strassburger","doi":"10.1145/3384441.3395981","DOIUrl":"https://doi.org/10.1145/3384441.3395981","url":null,"abstract":"This paper presents an approach for optimizing the robustness of production and logistic systems based on deep generative models, a special method of deep learning. Robustness here refers to setting controllable factors of a system in such a way that variance in the uncontrollable factors (noise) has a minimal effect on given output parameters. In a case study, the proposed method is tested and compared to a traditional method for robustness analysis. The basic idea is to use deep neural networks to generate data for experiment plans and rate them by use of a simulation model of the production system. We propose to use two Generative Adversarial Networks (GANs) to generate optimized experiment plans for the decision factors and the noise factors, respectively, in a competitive, turn-based game. In one turn, the controllable factors are optimized and the noise remains constant, and vice versa in the next turn. For the calculations of the robustness, the planned experiments are conducted and rated using a simulation model in each learning step.","PeriodicalId":422248,"journal":{"name":"Proceedings of the 2020 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131929919","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Parallel Simulation of Quantum Key Distribution Networks 量子密钥分配网络的并行仿真
Xiaoliang Wu, B. Zhang, Dong Jin
With the significantly growing investment in quantum communi-cations, quantum key distribution (QKD), as a key application toshare a security key between two remote parties, has been deployedin urban areas and even at a continental scale. To meet the designrequirements of QKD on a quantum communication network, todayresearchers extensively conduct simulation-based evaluations in ad-dition to physical experiments for cost efficiency. A practical QKDsystem must be implemented on a large scale via a network, notjust between a few pairs of users. Existing discrete-event simulatorsoffer models for QKD hardware and protocols based on sequentialexecution. In this work, we investigate the parallel simulation ofQKD networks for scalability enhancement. Our contributions layin the exploration of QKD network characteristics to be leveragedfor parallel simulation. We also develop a parallel simulator forQKD networks with an optimized scheme for network partition.Experimental results show that to simulate a 64-node QKD net-work, our parallel simulator can complete the experiment 9 timesfaster than a sequential simulator running on the same machine.Our linear-regression-based network partition scheme can furtheraccelerate the simulation experiments up to two times than using arandomized network partition scheme.
随着量子通信投资的显著增长,量子密钥分发(QKD)作为在两个远程方之间共享安全密钥的关键应用,已在城市地区甚至大陆范围内部署。为了满足量子通信网络上QKD的设计要求,目前研究人员除了进行物理实验外,还广泛地进行基于仿真的评估,以提高成本效率。一个实际的qkd系统必须通过网络大规模地实现,而不仅仅是在几对用户之间实现。现有的离散事件模拟器提供了基于顺序执行的QKD硬件和协议的模型。在这项工作中,我们研究了qkd网络的并行仿真以增强可扩展性。我们的贡献在于探索可用于并行仿真的QKD网络特性。我们还开发了一个qkd网络并行模拟器,并对网络分区进行了优化。实验结果表明,在模拟64节点的QKD网络时,我们的并行模拟器完成实验的速度比在同一台机器上运行的顺序模拟器快9倍。基于线性回归的网络划分方案比随机网络划分方案能将仿真实验的速度提高两倍以上。
{"title":"Parallel Simulation of Quantum Key Distribution Networks","authors":"Xiaoliang Wu, B. Zhang, Dong Jin","doi":"10.1145/3384441.3395988","DOIUrl":"https://doi.org/10.1145/3384441.3395988","url":null,"abstract":"With the significantly growing investment in quantum communi-cations, quantum key distribution (QKD), as a key application toshare a security key between two remote parties, has been deployedin urban areas and even at a continental scale. To meet the designrequirements of QKD on a quantum communication network, todayresearchers extensively conduct simulation-based evaluations in ad-dition to physical experiments for cost efficiency. A practical QKDsystem must be implemented on a large scale via a network, notjust between a few pairs of users. Existing discrete-event simulatorsoffer models for QKD hardware and protocols based on sequentialexecution. In this work, we investigate the parallel simulation ofQKD networks for scalability enhancement. Our contributions layin the exploration of QKD network characteristics to be leveragedfor parallel simulation. We also develop a parallel simulator forQKD networks with an optimized scheme for network partition.Experimental results show that to simulate a 64-node QKD net-work, our parallel simulator can complete the experiment 9 timesfaster than a sequential simulator running on the same machine.Our linear-regression-based network partition scheme can furtheraccelerate the simulation experiments up to two times than using arandomized network partition scheme.","PeriodicalId":422248,"journal":{"name":"Proceedings of the 2020 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121955818","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
An Agent-Based Model of Crowd Evacuation: Combining Individual, Social and Technological Aspects 基于个体的人群疏散模型:结合个体、社会和技术方面
K. Zia, A. Ferscha
Development of crowd evacuation systems is a challenge due to involvement of complex interrelated aspects, diversity of involved individuals and/or environment, and lack of direct evidence. Evacuation modeling and simulation is used to analyze various possible outcomes as different scenarios unfold, typically when the complexity of scenario is high. However, incorporation of different aspect categories in a unified modeling space is a challenge. In this paper, we addressed this challenge by combining individual, social and technological models of people during evacuation, while pivoting all these aspects on a common agent-based modeling framework and a grid-based hypothetical environment. By simulating these models, an insight into the effectiveness of several interesting evacuation scenarios is provided. Based on the simulation results, a couple of useful recommendations are also given. The most important recommendation is not to use potential field indicating the exits dynamics as an exit strategy particularly for a spatial complexity environment.
由于涉及复杂的相互关联的方面,涉及的个人和/或环境的多样性,以及缺乏直接证据,人群疏散系统的开发是一项挑战。疏散建模和仿真用于分析不同场景下可能出现的各种结果,特别是在场景复杂性较高的情况下。然而,在统一的建模空间中合并不同的方面类别是一个挑战。在本文中,我们通过结合疏散过程中人员的个人、社会和技术模型来解决这一挑战,同时将所有这些方面都集中在一个基于智能体的通用建模框架和基于网格的假设环境上。通过模拟这些模型,可以深入了解几个有趣的疏散场景的有效性。根据仿真结果,给出了一些有用的建议。最重要的建议是不要使用指示退出动态的势场作为退出策略,特别是对于空间复杂性环境。
{"title":"An Agent-Based Model of Crowd Evacuation: Combining Individual, Social and Technological Aspects","authors":"K. Zia, A. Ferscha","doi":"10.1145/3384441.3395973","DOIUrl":"https://doi.org/10.1145/3384441.3395973","url":null,"abstract":"Development of crowd evacuation systems is a challenge due to involvement of complex interrelated aspects, diversity of involved individuals and/or environment, and lack of direct evidence. Evacuation modeling and simulation is used to analyze various possible outcomes as different scenarios unfold, typically when the complexity of scenario is high. However, incorporation of different aspect categories in a unified modeling space is a challenge. In this paper, we addressed this challenge by combining individual, social and technological models of people during evacuation, while pivoting all these aspects on a common agent-based modeling framework and a grid-based hypothetical environment. By simulating these models, an insight into the effectiveness of several interesting evacuation scenarios is provided. Based on the simulation results, a couple of useful recommendations are also given. The most important recommendation is not to use potential field indicating the exits dynamics as an exit strategy particularly for a spatial complexity environment.","PeriodicalId":422248,"journal":{"name":"Proceedings of the 2020 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132795365","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
Session details: Simulations and Artificial Intelligence 会议细节:模拟和人工智能
Canada
{"title":"Session details: Simulations and Artificial Intelligence","authors":"Canada","doi":"10.1145/3406361","DOIUrl":"https://doi.org/10.1145/3406361","url":null,"abstract":"","PeriodicalId":422248,"journal":{"name":"Proceedings of the 2020 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125810698","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Fast-Forwarding of Vehicle Clusters in Microscopic Traffic Simulations 微观交通模拟中车辆群的快进研究
Philipp Andelfinger, D. Eckhoff, Wentong Cai, A. Knoll
State fast-forwarding has been proposed as a method to reduce the computational cost of microscopic traffic simulations while retaining per-vehicle trajectories. However, since fast-forwarding relies on vehicles isolated on the road, its benefits extend only to situations of sparse traffic. In this paper, we propose fast-forwarding of vehicle clusters by training artificial neural networks to capture the interactions between vehicles across multiple simulation time steps. We explore various configurations of neural networks in light of the trade-off between accuracy and performance. Measurements in road network simulations demonstrate that cluster fast-forwarding can substantially outperform both time-driven state updates and single-vehicle fast-forwarding, while introducing only a small deviation in travel times.
状态快进是一种减少微观交通模拟计算成本的方法,同时保留了每辆车的轨迹。然而,由于快进依赖于道路上孤立的车辆,它的好处只适用于交通稀少的情况。在本文中,我们提出了通过训练人工神经网络来捕获多个仿真时间步长的车辆之间的相互作用的车辆集群的快速前进。我们在准确性和性能之间权衡的基础上探索了神经网络的各种配置。道路网络模拟的测量结果表明,集群快进在性能上大大优于时间驱动的状态更新和单车辆快进,同时只引入了很小的行驶时间偏差。
{"title":"Fast-Forwarding of Vehicle Clusters in Microscopic Traffic Simulations","authors":"Philipp Andelfinger, D. Eckhoff, Wentong Cai, A. Knoll","doi":"10.1145/3384441.3395975","DOIUrl":"https://doi.org/10.1145/3384441.3395975","url":null,"abstract":"State fast-forwarding has been proposed as a method to reduce the computational cost of microscopic traffic simulations while retaining per-vehicle trajectories. However, since fast-forwarding relies on vehicles isolated on the road, its benefits extend only to situations of sparse traffic. In this paper, we propose fast-forwarding of vehicle clusters by training artificial neural networks to capture the interactions between vehicles across multiple simulation time steps. We explore various configurations of neural networks in light of the trade-off between accuracy and performance. Measurements in road network simulations demonstrate that cluster fast-forwarding can substantially outperform both time-driven state updates and single-vehicle fast-forwarding, while introducing only a small deviation in travel times.","PeriodicalId":422248,"journal":{"name":"Proceedings of the 2020 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123674317","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Reproducibility Report for the Paper: Partial Evaluation via Code Generation for Static Stochastic Reaction Network Models 论文的再现性报告:静态随机反应网络模型的代码生成部分评价
Stefano Carnà
The authors request for this paper the following badges: (1)Artifacts Available(2)Artifacts Evaluated ? Functional(3)Artifacts Evaluated? Reusable(4)Results Replicated. After the review process, all of them were assigned, as the artifact met all the requirements.
作者对本文的要求如下:(1)可用的工件(2)评估的工件?功能(3)工件评估?可重用(4)复制的结果。在评审过程之后,由于工件满足了所有的需求,所有的工件都被分配了。
{"title":"Reproducibility Report for the Paper: Partial Evaluation via Code Generation for Static Stochastic Reaction Network Models","authors":"Stefano Carnà","doi":"10.1145/3384441.3396228","DOIUrl":"https://doi.org/10.1145/3384441.3396228","url":null,"abstract":"The authors request for this paper the following badges: (1)Artifacts Available(2)Artifacts Evaluated ? Functional(3)Artifacts Evaluated? Reusable(4)Results Replicated. After the review process, all of them were assigned, as the artifact met all the requirements.","PeriodicalId":422248,"journal":{"name":"Proceedings of the 2020 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115740531","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Reproducibility Report for the Paper: Approximated Rollbacks 论文的可重复性报告:近似回滚
Jiajian Xiao
The paper introduced a novel state-rollback mechanism named approximated rollbacks for speculative parallel discrete event simulators. The artifact of the paper is available online and is properly documented. It contains a simulation framework comprising of a parallel discrete event simulator called ROOT-Sim and a set of Application Programming Interfaces (APIs) for approximated rollbacks. This simulation framework can be employed in a wide range of discrete-event-based simulation scenarios. The experiment results were successfully replicated. Therefore, I assign all the functional, reusable, available, and results replicated badges to this paper.
针对推测并行离散事件模拟器,提出了一种新的状态回滚机制——近似回滚。论文的工件可以在线获得,并且有适当的文档记录。它包含一个模拟框架,由一个称为ROOT-Sim的并行离散事件模拟器和一组用于近似回滚的应用程序编程接口(api)组成。该仿真框架可广泛应用于基于离散事件的仿真场景。实验结果被成功地重复了。因此,我将所有功能性的、可重用的、可用的和结果复制的徽章分配给本文。
{"title":"Reproducibility Report for the Paper: Approximated Rollbacks","authors":"Jiajian Xiao","doi":"10.1145/3384441.3396229","DOIUrl":"https://doi.org/10.1145/3384441.3396229","url":null,"abstract":"The paper introduced a novel state-rollback mechanism named approximated rollbacks for speculative parallel discrete event simulators. The artifact of the paper is available online and is properly documented. It contains a simulation framework comprising of a parallel discrete event simulator called ROOT-Sim and a set of Application Programming Interfaces (APIs) for approximated rollbacks. This simulation framework can be employed in a wide range of discrete-event-based simulation scenarios. The experiment results were successfully replicated. Therefore, I assign all the functional, reusable, available, and results replicated badges to this paper.","PeriodicalId":422248,"journal":{"name":"Proceedings of the 2020 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"285 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133975070","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Proceedings of the 2020 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1