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

筛选
英文 中文
Round-based Super-Individuals - Balancing Speed and Accuracy 基于轮的超级个体-平衡速度和准确性
Pia Wilsdorf, M. Pierce, J. Hillston, A. Uhrmacher
{"title":"Round-based Super-Individuals - Balancing Speed and Accuracy","authors":"Pia Wilsdorf, M. Pierce, J. Hillston, A. Uhrmacher","doi":"10.1145/3316480.3322894","DOIUrl":"https://doi.org/10.1145/3316480.3322894","url":null,"abstract":"Agent- or individual-based models which are based on a continuous-time Markov chain semantics are increasingly receiving attention in simulation. To reduce computational cost, model aggregation techniques based on Markov chain lumping can be leveraged. However, for models with nested, attributed agents, and arbitrary functions determining their dynamics it is not trivial to find a partition that satisfies the lumpability conditions. Thus, we exploit the potential of the so-called super-individual approaches where sub-populations of agents are approximated by representatives based on some criteria for similarity, and propose a round-based execution scheme to balance speed and accuracy of the simulations. For realization we use an expressive rule-based modeling and simulation framework, evaluate the performance using a fish habitat model, and discuss open questions for future research.","PeriodicalId":398793,"journal":{"name":"Proceedings of the 2019 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126380617","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}
引用次数: 2
Analyzing Cost-Performance Tradeoffs of HPC Network Designs under Different Constraints using Simulations 基于仿真的不同约束条件下高性能计算网络设计的性价比分析
A. Bhatele, Nikhil Jain, M. Mubarak, T. Gamblin
{"title":"Analyzing Cost-Performance Tradeoffs of HPC Network Designs under Different Constraints using Simulations","authors":"A. Bhatele, Nikhil Jain, M. Mubarak, T. Gamblin","doi":"10.1145/3316480.3325516","DOIUrl":"https://doi.org/10.1145/3316480.3325516","url":null,"abstract":"Identifying a suitable network topology and deciding its optimal configuration parameters are critical aspects of the overall HPC system design, procurement and installation process. Typically, multiple network topology choices are compared under the balanced injection-to-global bandwidth criterion to identify the best candidate. However, deviating from this balanced criterion may not impact application performance adversely and is often done in practice due to other considerations such as monetary cost. In this paper, we identify different practical constraints that determine the number of nodes, routers, and links, and in turn, influence dollar costs and impact network design. We design network topologies under one or more such constraints which represent different design points (iso-{*} analysis). We then perform a comprehensive, comparative evaluation of three scalable network topologies -- dragonfly, express mesh, and fat-tree -- enabled by parallel discrete-event simulations (PDES) of relevant HPC workloads. We identify network topologies that perform best under different iso-{*} configurations and compare their performance per dollar based on market data.","PeriodicalId":398793,"journal":{"name":"Proceedings of the 2019 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127663512","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}
引用次数: 8
Virtual Time Machine for Reproducible Network Emulation 用于可复制网络仿真的虚拟时间机
Jin Chen, Jiang Liu, Tao Huang, Jason Liu
{"title":"Virtual Time Machine for Reproducible Network Emulation","authors":"Jin Chen, Jiang Liu, Tao Huang, Jason Liu","doi":"10.1145/3316480.3322897","DOIUrl":"https://doi.org/10.1145/3316480.3322897","url":null,"abstract":"Reproducing network emulation experiments on diverse physical platforms with varying computation and communication resources is non-trivial. Many state-of-the-art network emulation testbeds do not guarantee timing fidelity. Consequently, results obtained from these testbeds can be misleading, especially when insufficient physical resources are provided to run the experiments. Reproducibility is far from being the norm. In this paper, we present a novel approach that can guarantee reproducible results for network emulation. Our system, called the Virtual Time Machine (VTM), takes advantage of both time dilation and carefully controlled scheduling of the virtual machines. Time dilation allows sufficiently scaled resources to run the experiments in virtual time, and controlled VM scheduling prescribes the precise timing of message passing for distributed applications---independent of the resource provisioning of the underlying physical testbed. Preliminary experiments show that VTM can guarantee reproducible results with varying time dilation, resource subscription, and VM scheduling scenarios.","PeriodicalId":398793,"journal":{"name":"Proceedings of the 2019 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125135356","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
An Adaptive Non-Blocking GVT Algorithm 一种自适应无阻塞GVT算法
Eric Mikida, L. Kalé
{"title":"An Adaptive Non-Blocking GVT Algorithm","authors":"Eric Mikida, L. Kalé","doi":"10.1145/3316480.3322896","DOIUrl":"https://doi.org/10.1145/3316480.3322896","url":null,"abstract":"In optimistic Parallel Discrete Event Simulations (PDES), the Global Virtual Time (GVT) computation is an important aspect of performance. It must be performed frequently enough to ensure simulation progress and free memory, while still incurring minimal overhead. Many algorithms have been studied for computing the GVT efficiently under a variety of simulation conditions for a variety of models. In this paper we propose a new GVT algorithm which aims to do two things. First, it incurs a very low overhead on the simulation by not requiring the simulation to block execution. Secondly, and most importantly, it has the ability to adapt to simulation conditions while it's running. This allows it to perform well for a variety of models, and helps remove some burden from developers by not requiring intensive tuning.","PeriodicalId":398793,"journal":{"name":"Proceedings of the 2019 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128865428","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}
引用次数: 5
Capturing and Reporting Provenance Information of Simulation Studies Based on an Artifact-Based Workflow Approach 基于工件工作流方法的仿真研究溯源信息捕获与报告
Andreas Ruscheinski, Pia Wilsdorf, Marcus Dombrowsky, A. Uhrmacher
{"title":"Capturing and Reporting Provenance Information of Simulation Studies Based on an Artifact-Based Workflow Approach","authors":"Andreas Ruscheinski, Pia Wilsdorf, Marcus Dombrowsky, A. Uhrmacher","doi":"10.1145/3316480.3325514","DOIUrl":"https://doi.org/10.1145/3316480.3325514","url":null,"abstract":"Provenance comprises information about how a product has been generated in a process. Thus, provenance information about an entire simulation study would support the interpretation and reuse of the developed simulation model and simulation experiments. However, current approaches only support to capture parts of the provenance information of a simulation study, i.e., the provenance information of the simulation data generated by individual simulation experiments. In this work, we extend a declarative, artifact-based workflow to capture provenance information about an entire simulation by observing the user in the study process. The workflow relates the building processes of central products of a simulation study, such as the conceptual model, requirements, input data, simulation model, and simulation experiments. Additionally, the workflow guides the modeler through the simulation study process while ensuring the consistency between its products. Further, we also develop different strategies to report the captured provenance information. These enable the user to respectively understand the simulation study at different levels of abstractions.","PeriodicalId":398793,"journal":{"name":"Proceedings of the 2019 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124325838","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
Modeling and Analysis of Application Interference on Dragonfly+ 蜻蜓+应用干扰建模与分析
Yao Kang, Xin Wang, Neil McGlohon, M. Mubarak, Sudheer Chunduri, Z. Lan
{"title":"Modeling and Analysis of Application Interference on Dragonfly+","authors":"Yao Kang, Xin Wang, Neil McGlohon, M. Mubarak, Sudheer Chunduri, Z. Lan","doi":"10.1145/3316480.3325517","DOIUrl":"https://doi.org/10.1145/3316480.3325517","url":null,"abstract":"Dragonfly class of networks are considered as promising interconnects for next-generation supercomputers. While Dragonfly+ networks offer more path diversity than the original Dragonfly design, they are still prone to performance variability due to their hierarchical architecture and resource sharing design. Event-driven network simulators are indispensable tools for navigating complex system design. In this study, we quantitatively evaluate a variety of application communication interactions on a 3,456-node Dragonfly+ system by using the CODES toolkit. This study looks at the impact of communication interference from a user's perspective. Specifically, for a given application submitted by a user, we examine how this application will behave with the existing workload running in the system under different job placement policies. Our simulation study considers hundreds of experiment configurations including four target applications with representative communication patterns under a variety of network traffic conditions. Our study shows that intra-job interference can cause severe performance degradation for communication-intensive applications. Inter-job interference can generally be reduced for applications with one-to-one or one-to-many communication patterns through job isolation. Application with one-to-all communication pattern is resilient to network interference.","PeriodicalId":398793,"journal":{"name":"Proceedings of the 2019 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133381970","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}
引用次数: 5
Scaffolded Training Environment for Physics Programming (STEPP): Modeling High School Physics using Concept Maps and State Machines 为物理编程搭建训练环境(STEPP):用概念图和状态机建模高中物理
Midori Kitagawa, P. Fishwick, M. Kesden, M. Urquhart, Rosanna E. Guadagno, Rong Jin, Ngoc M. Tran, Erik Omogbehin, Aditya Prakash, Priyanka Awaraddi, Baily Hale, Ken Suura, Aniket Raj, J. Stanfield, Henry Vo
{"title":"Scaffolded Training Environment for Physics Programming (STEPP): Modeling High School Physics using Concept Maps and State Machines","authors":"Midori Kitagawa, P. Fishwick, M. Kesden, M. Urquhart, Rosanna E. Guadagno, Rong Jin, Ngoc M. Tran, Erik Omogbehin, Aditya Prakash, Priyanka Awaraddi, Baily Hale, Ken Suura, Aniket Raj, J. Stanfield, Henry Vo","doi":"10.1145/3316480.3325513","DOIUrl":"https://doi.org/10.1145/3316480.3325513","url":null,"abstract":"We are a year into the development of a software tool for modeling and simulation (M&S) of 1D and 2D kinematics consistent with Newton's laws of motion. Our goal has been to introduce modeling and computational thinking into learning high-school physics. There are two main contributions from an M&S perspective: (1) the use of conceptual modeling, and (2) the application of Finite State Machines (FSMs) to model physical behavior. Both of these techniques have been used by the M&S community to model high-level \"soft systems\" and discrete events. However, they have not been used to teach physics and represent ways in which M&S can improve physics education. We introduce the NSF-sponsored STEPP project along with its hypothesis and goals. We also describe the development of the three STEPP modules, the server architecture, the assessment plan, and the expected outcomes.","PeriodicalId":398793,"journal":{"name":"Proceedings of the 2019 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124672638","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
From Effects to Causes: Reversible Simulation and Reverse Exploration of Microscopic Traffic Models 从影响到原因:微观交通模型的可逆模拟与反向探索
Philipp Andelfinger, Jordan Ivanchev, D. Eckhoff, Wentong Cai, A. Knoll
{"title":"From Effects to Causes: Reversible Simulation and Reverse Exploration of Microscopic Traffic Models","authors":"Philipp Andelfinger, Jordan Ivanchev, D. Eckhoff, Wentong Cai, A. Knoll","doi":"10.1145/3316480.3322891","DOIUrl":"https://doi.org/10.1145/3316480.3322891","url":null,"abstract":"We propose an approach for reverse-in-time exploration of the state space of microscopic traffic simulations starting from a user-specified class of outcomes. As a basis for our approach, we present a reversible execution scheme applicable to common car-following and lane-changing models from the traffic simulation literature. The execution scheme permits perfect reversal of a previous forward simulation, which to our knowledge has not been attempted previously in the context of established traffic simulation models. Further, we perform reverse state space explorations directly from user-specified simulation states, i.e., reverse-in-time model checking. By exploring all sequences of possible previous states from a final state, reachability questions can be answered more conclusively than purely through forward simulations. In a case study, reverse exploration is used to identify conditions that lead to specified accident situations, with running time reductions by factors of more than 20 compared to traditional forward exploration.","PeriodicalId":398793,"journal":{"name":"Proceedings of the 2019 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130732946","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
Scalable Performance Prediction of Codes with Memory Hierarchy and Pipelines 基于内存层次和管道的可伸缩代码性能预测
Gopinath Chennupati, N. Santhi, S. Eidenbenz
{"title":"Scalable Performance Prediction of Codes with Memory Hierarchy and Pipelines","authors":"Gopinath Chennupati, N. Santhi, S. Eidenbenz","doi":"10.1145/3316480.3325518","DOIUrl":"https://doi.org/10.1145/3316480.3325518","url":null,"abstract":"We present the Analytical Memory Model with Pipelines (AMMP) of the Performance Prediction Toolkit (PPT). PPT-AMMP takes high-level source code and hardware architecture parameters as input, predicts runtime of that code on the target hardware platform, which is defined in the input parameters. PPT-AMMP transforms the code to an (architecture-independent) intermediate representation, then (i) analyzes the basic block structure of the code, (ii) processes architecture-independent virtual memory access patterns that it uses to build memory reuse distance distribution models for each basic block, (iii) runs detailed basic-block level simulations to determine hardware pipeline usage. Further, PPT-AMMP uses machine learning and regression techniques to build the prediction models based on small instances of the input code, then integrates into a higher-order discrete-event simulation model of PPT running on Simian PDES engine. We validate PPT-AMMP on four standard computational physics benchmarks, finally present a use case of hardware parameter sensitivity analysis to identify bottleneck hardware resources on different code inputs.","PeriodicalId":398793,"journal":{"name":"Proceedings of the 2019 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128116860","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}
引用次数: 11
Simulation-based Analysis of Network Rules Matching 基于仿真的网络规则匹配分析
D. Nicol
{"title":"Simulation-based Analysis of Network Rules Matching","authors":"D. Nicol","doi":"10.1145/3316480.3325519","DOIUrl":"https://doi.org/10.1145/3316480.3325519","url":null,"abstract":"A common function in networking is to find the best match between a packet's IP header and a list of matching rules, and to take some action based on the rule which is matched. This approach determines whether a packet transits a firewall or router and which interface is chosen for egress when it does, and whether a Network Address Translation transformation is applied. Considerable past research has optimized data structures and algorithms for rules-matching, under the operating assumption that with every specific application the best match is sought for a single IP flow, with a specified protocol, and specified source and destination IP and port numbers. This paper is motivated by a different scenario, in which we seek the simultaneous determination of the best matches for a bundle of flows. The flows are closely related as the bundle is a contiguous subset of the IP header space, meaning each flow draws in each dimension from the same range as other flows do in that same dimension. This specific problem arises in the design of tools that analyze the connectivity of networks. We consider here two algorithms for approaching this problem, which share the characteristic of generalizing the simulation of how devices typically classify a given flow. We study the behavior of these algorithms empirically, and find that the amortized cost of identifying the best matching rule in an ACL is typically measured in (at most) 10's of micro-seconds on an ordinary laptop computer.","PeriodicalId":398793,"journal":{"name":"Proceedings of the 2019 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"245 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121700381","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}
引用次数: 2
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信