ACM Transactions on Modeling and Computer Simulation最新文献_第7页

Virtual Time III, Part 2: Combining Conservative and Optimistic Synchronization 虚拟时间III，第2部分:结合保守和乐观同步

IF 0.9 4区计算机科学

ACM Transactions on Modeling and Computer Simulation Pub Date : 2023-01-11 DOI: https://dl.acm.org/doi/10.1145/3505249

David R. Jefferson, Peter D. Barnes

引用次数: 0

Replication of Computational Results Report for "Automatic Reuse, Adaption, and Execution of Simulation Experiments via Provenance Patterns" “通过来源模式自动重用、适应和执行模拟实验”计算结果报告的复制

IF 0.9 4区计算机科学

ACM Transactions on Modeling and Computer Simulation Pub Date : 2023-01-01 DOI: 10.1145/3577007

P. D. Sanzo

引用次数: 0

A Personality-based Model of Emotional Contagion and Control in Crowd Queuing Simulations 人群排队模拟中基于个性的情绪传染与控制模型

IF 0.9 4区计算机科学

ACM Transactions on Modeling and Computer Simulation Pub Date : 2022-12-20 DOI: 10.1145/3577589

Junxiao Xue, Mingchuan Zhang, Hui Yin

{"title":"A Personality-based Model of Emotional Contagion and Control in Crowd Queuing Simulations","authors":"Junxiao Xue, Mingchuan Zhang, Hui Yin","doi":"10.1145/3577589","DOIUrl":"https://doi.org/10.1145/3577589","url":null,"abstract":"Queuing is a frequent daily activity. However, long waiting lines equate to frustration and potential safety hazards. We present a novel, personality-based model of emotional contagion and control for simulating crowd queuing. Our model integrates the influence of individual personalities and interpersonal relationships. Through the interaction between the agents and the external environment parameters, the emotional contagion model based on well-known theories in psychology is used to complete the agents’ behavior planning and path planning function. We combine the epidemiological SIR model with the cellular automaton model to capture various emotional modelling for multi-agent simulations. The overall formulation involves different emotional parameters, such as patience, urgency, and friendliness, closely related to crowd queuing. In addition, to manage the order of the queue, governing agents are added to prevent the emotional outbreak. We perform qualitative and quantitative comparisons between our simulation results and real-world observations on various scenarios. Numerous experiments show that reasonably increasing the queue channel and adding governing agents can effectively improve the quality of queues.","PeriodicalId":50943,"journal":{"name":"ACM Transactions on Modeling and Computer Simulation","volume":"33 1","pages":"1 - 23"},"PeriodicalIF":0.9,"publicationDate":"2022-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49172197","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Batching Adaptive Variance Reduction 批处理自适应方差减少

IF 0.9 4区计算机科学

ACM Transactions on Modeling and Computer Simulation Pub Date : 2022-12-01 DOI: 10.1145/3573386

Chenxiao Song, Ray Kawai

{"title":"Batching Adaptive Variance Reduction","authors":"Chenxiao Song, Ray Kawai","doi":"10.1145/3573386","DOIUrl":"https://doi.org/10.1145/3573386","url":null,"abstract":"Adaptive Monte Carlo variance reduction is an effective framework for running a Monte Carlo simulation along with a parameter search algorithm for variance reduction, whereas an initialization step is required for preparing problem parameters in some instances. In spite of the effectiveness of adaptive variance reduction in various fields of application, the length of the preliminary phase has often been left unspecified for the user to determine on a case-by-case basis, much like in typical sequential frameworks. This uncertain element may possibly be even fatal in realistic finite-budget situations, since the pilot run may take most of the budget, or possibly use up all of it. To unnecessitate such an ad hoc initialization step, we develop a batching procedure in adaptive variance reduction, and provide an implementable formula of the learning rate in the parameter search which minimizes an upper bound of the theoretical variance of the empirical batch mean. We analyze decay rates of the minimized upper bound towards the minimal estimator variance with respect to the predetermined computing budget, and provide convergence results as the computing budget increases progressively when the batch size is fixed. Numerical examples are provided to support theoretical findings and illustrate the effectiveness of the proposed batching procedure.","PeriodicalId":50943,"journal":{"name":"ACM Transactions on Modeling and Computer Simulation","volume":"33 1","pages":"1 - 24"},"PeriodicalIF":0.9,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46935685","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Efficient Simulation of Sparse Graphs of Point Processes 点过程稀疏图的有效模拟

IF 0.9 4区计算机科学

ACM Transactions on Modeling and Computer Simulation Pub Date : 2022-11-15 DOI: 10.1145/3565809

Cyrille Loïc Mascart, David, Hill, A. Muzy, P. Reynaud-Bouret

引用次数: 2

Estimating Multiclass Service Demand Distributions Using Markovian Arrival Processes 利用马尔可夫到达过程估计多类服务需求分布

IF 0.9 4区计算机科学

ACM Transactions on Modeling and Computer Simulation Pub Date : 2022-11-08 DOI: 10.1145/3570924

Runan Wang, G. Casale, Antonio Filieri

{"title":"Estimating Multiclass Service Demand Distributions Using Markovian Arrival Processes","authors":"Runan Wang, G. Casale, Antonio Filieri","doi":"10.1145/3570924","DOIUrl":"https://doi.org/10.1145/3570924","url":null,"abstract":"Building performance models for software services in DevOps is costly and error-prone. Accurate service demand distribution estimation is critical to precisely modeling queueing behaviors and performance prediction. However, current estimation methods focus on capturing the mean service demand, disregarding higher-order moments of the distribution that still can largely affect prediction accuracy. To address this limitation, we propose to estimate higher moments of the service demand distribution for a microservice from monitoring traces. We first generate a closed queueing model to abstract software performance and use it to model the departure process of requests completed by the software service as a Markovian arrival process (MAP). This allows formulating the estimation of service demand into an optimization problem, which aims to find the first multiple moments of the service demand distribution that maximize the likelihood of the MAP using generated the measured inter-departure times. We then estimate the service demand distribution for different classes of service with a maximum likelihood algorithm and novel heuristics to mitigate the computational cost of the optimization process for scalability. We apply our method to real traces from a microservice-based application and demonstrate that its estimations lead to greater prediction accuracy than exponential distributions assumed in traditional service demand estimation approaches for software services.","PeriodicalId":50943,"journal":{"name":"ACM Transactions on Modeling and Computer Simulation","volume":"33 1","pages":"1 - 26"},"PeriodicalIF":0.9,"publicationDate":"2022-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49487716","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Dynamic Data-driven Microscopic Traffic Simulation using Jointly Trained Physics-guided Long Short-Term Memory 基于联合训练物理引导的长短期记忆的动态数据驱动微观交通模拟

IF 0.9 4区计算机科学

ACM Transactions on Modeling and Computer Simulation Pub Date : 2022-11-05 DOI: https://dl.acm.org/doi/10.1145/3558555

Htet Naing, Wentong Cai, Hu Nan, Wu Tiantian, Yu Liang

{"title":"Dynamic Data-driven Microscopic Traffic Simulation using Jointly Trained Physics-guided Long Short-Term Memory","authors":"Htet Naing, Wentong Cai, Hu Nan, Wu Tiantian, Yu Liang","doi":"https://dl.acm.org/doi/10.1145/3558555","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3558555","url":null,"abstract":"Symbiotic simulation systems that incorporate data-driven methods (such as machine/deep learning) are effective and efficient tools for just-in-time (JIT) operational decision making. With the growing interest on Digital Twin City, such systems are ideal for real-time microscopic traffic simulation. However, learning-based models are heavily biased towards the training data and could produce physically inconsistent outputs. In terms of microscopic traffic simulation, this could lead to unsafe driving behaviours causing vehicle collisions in the simulation. As for symbiotic simulation, this could severely affect the performance of real-time base simulation models resulting in inaccurate or unrealistic forecasts, which could, in turn, mislead JIT what-if analyses. To overcome this issue, a physics-guided data-driven modelling paradigm should be adopted so that the resulting model could capture both accurate and safe driving behaviours. However, very few works exist in the development of such a car-following model that can balance between simulation accuracy and physical consistency. Therefore, in this paper, a new “jointly-trained physics-guided Long Short-Term Memory (JTPG-LSTM)” neural network, is proposed and integrated to a dynamic data-driven simulation system to capture dynamic car-following behaviours. An extensive set of experiments was conducted to demonstrate the advantages of the proposed model from both modelling and simulation perspectives.","PeriodicalId":50943,"journal":{"name":"ACM Transactions on Modeling and Computer Simulation","volume":"10 1","pages":""},"PeriodicalIF":0.9,"publicationDate":"2022-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138523778","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Performance Analysis of Speculative Parallel Adaptive Local Timestepping for Conservation Laws 守恒律推测并行自适应局部时间步进的性能分析

IF 0.9 4区计算机科学

ACM Transactions on Modeling and Computer Simulation Pub Date : 2022-11-05 DOI: https://dl.acm.org/doi/10.1145/3545996

Maximilian Bremer, John Bachan, Cy Chan, Clint Dawson

{"title":"Performance Analysis of Speculative Parallel Adaptive Local Timestepping for Conservation Laws","authors":"Maximilian Bremer, John Bachan, Cy Chan, Clint Dawson","doi":"https://dl.acm.org/doi/10.1145/3545996","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3545996","url":null,"abstract":"Stable simulation of conservation laws, such as those used to model fluid dynamics and plasma physics applications, requires the satisfaction of the so-called Courant-Friedrichs-Lewy condition. By allowing regions of the mesh to advance with different timesteps that locally satisfy this stability constraint, significant work reduction can be attained when compared to a time integration scheme using a single timestep size. However, parallelizing this algorithm presents considerable difficulty. Since the stability condition depends on the state of the system, dependencies become dynamic and potentially non-local. In this article, we present an adaptive local timestepping algorithm using an optimistic (Timewarp-based) parallel discrete event simulation. We introduce waiting heuristics to limit misspeculation and a semi-static load balancing scheme to eliminate load imbalance as parts of the mesh require finer or coarser timesteps. Last, we outline an interface for separating the physics of the specific conservation law from the temporal integration allowing for productive adoption of our proposed algorithm. We present a misspeculation study for three conservation laws, demonstrating both the productivity of the local timestepping API, for which 74% of the lines of code are reused across different conservation laws, and the robustness of the waiting heuristics—at most 1.5% of element updates are rolled back. Our performance studies demonstrate up to a 2.8× speedup versus a baseline unoptimized local timestepping approach, a 4x improvement in per-node throughput compared to an MPI parallelization of synchronous timestepping, and scalability up to 3,072 cores on NERSC’s Cori Haswell partition.","PeriodicalId":50943,"journal":{"name":"ACM Transactions on Modeling and Computer Simulation","volume":"1 1","pages":""},"PeriodicalIF":0.9,"publicationDate":"2022-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138523756","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A General Framework to Simulate Diffusions with Discontinuous Coefficients and Local Times 具有不连续系数和局部时间的扩散模拟的一般框架

IF 0.9 4区计算机科学

ACM Transactions on Modeling and Computer Simulation Pub Date : 2022-11-05 DOI: https://dl.acm.org/doi/10.1145/3559541

Kailin Ding, Zhenyu Cui

引用次数: 0

Introduction to the Special Section on PADS 2021 PADS 2021专题介绍

IF 0.9 4区计算机科学

ACM Transactions on Modeling and Computer Simulation Pub Date : 2022-10-31 DOI: 10.1145/3579840

S. Diallo, A. Tolk

引用次数: 0