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

Performance analysis of work stealing strategies in large scale multi-threaded computing 大规模多线程计算中工作窃取策略的性能分析

IF 0.9 4区计算机科学

ACM Transactions on Modeling and Computer Simulation Pub Date : 2023-02-16 DOI: 10.1145/3584186

Grzegorz Kielanski, B. V. Houdt

引用次数: 1

Introduction to the Special Section on PADS 2021 关于PADS 2021的特别部分介绍

IF 0.9 4区计算机科学

ACM Transactions on Modeling and Computer Simulation Pub Date : 2023-02-16 DOI: https://dl.acm.org/doi/10.1145/3579840

Saikou Y. Diallo, Andreas Tolk

引用次数: 0

SEH: Size Estimate Hedging Scheduling of Queues SEH：队列的大小估计套期调度

IF 0.9 4区计算机科学

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

Maryam Akbari-Moghaddam, D. Down

引用次数: 2

SEH: Size Estimate Hedging Scheduling of Queues SEH:队列的大小估计对冲调度

IF 0.9 4区计算机科学

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

Maryam Akbari-Moghaddam, Douglas G. Down

引用次数: 0

Towards Differentiable Agent-Based Simulation 基于可微主体的仿真研究

IF 0.9 4区计算机科学

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

Philipp Andelfinger

{"title":"Towards Differentiable Agent-Based Simulation","authors":"Philipp Andelfinger","doi":"https://dl.acm.org/doi/10.1145/3565810","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3565810","url":null,"abstract":"Simulation-based optimization using agent-based models is typically carried out under the assumption that the gradient describing the sensitivity of the simulation output to the input cannot be evaluated directly. To still apply gradient-based optimization methods, which efficiently steer the optimization towards a local optimum, gradient estimation methods can be employed. However, many simulation runs are needed to obtain accurate estimates if the input dimension is large. Automatic differentiation (AD) is a family of techniques to compute gradients of general programs directly. Here, we explore the use of AD in the context of time-driven agent-based simulations. By substituting common discrete model elements such as conditional branching with smooth approximations, we obtain gradient information across discontinuities in the model logic. On the examples of a synthetic grid-based model, an epidemics model, and a microscopic traffic model, we study the fidelity and overhead of the differentiable simulations as well as the convergence speed and solution quality achieved by gradient-based optimization compared with gradient-free methods. In traffic signal timing optimization problems with high input dimension, the gradient-based methods exhibit substantially superior performance. A further increase in optimization progress is achieved by combining gradient-free and gradient-based methods. We demonstrate that the approach enables gradient-based training of neural network-controlled simulation entities embedded in the model logic. Finally, we show that the performance overhead of differentiable agent-based simulations can be reduced substantially by exploiting sparsity in the model logic.","PeriodicalId":50943,"journal":{"name":"ACM Transactions on Modeling and Computer Simulation","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2023-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138523744","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

Virtual Time III, Part 1: Unified Virtual Time Synchronization for Parallel Discrete Event Simulation 虚拟时间3，第1部分:并行离散事件仿真的统一虚拟时间同步

IF 0.9 4区计算机科学

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

David R. Jefferson, Peter Barnes

{"title":"Virtual Time III, Part 1: Unified Virtual Time Synchronization for Parallel Discrete Event Simulation","authors":"David R. Jefferson, Peter Barnes","doi":"https://dl.acm.org/doi/10.1145/3505248","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3505248","url":null,"abstract":"Algorithms for synchronization of parallel discrete event simulation have historically been divided between conservative methods that require lookahead but not rollback, and optimistic methods that require rollback but not lookahead. In this paper we present a new approach in the form of a framework called Unified Virtual Time (UVT) that unifies the two approaches, combining the advantages of both within a single synchronization theory. Whenever timely lookahead information is available, a logical process (LP) executes conservatively using an irreversible event handler. When lookahead information is not available the LP does not block, as it would in a classical conservative execution, but instead executes optimistically using a reversible event handler. The switch from conservative to optimistic synchronization and back is decided on an event-by-event basis by the simulator, transparently to the model code. UVT treats conservative synchronization algorithms as optional accelerators for an underlying optimistic synchronization algorithm, enabling the speed of conservative execution whenever it is applicable, but otherwise falling back on the generality of optimistic execution.We describe UVT in a novel way, based on fundamental invariants, monotonicity requirements, and synchronization rules. UVT permits zero-delay messages and pays careful attention to tie-handling using superposition. We prove that under fairly general conditions a UVT simulation always makes progress in virtual time.This is Part 1 of a trio of papers describing the UVT framework for PDES, mixing conservative and optimistic synchronization and integrating throttling control.","PeriodicalId":50943,"journal":{"name":"ACM Transactions on Modeling and Computer Simulation","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2023-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138523749","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

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":null,"pages":null},"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":null,"pages":null},"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