{"title":"The Digital Patient and the Digital Neighborhood: Implications for Modeling and Simulation in Healthcare","authors":"C. D. Combs","doi":"10.1145/3437959.3459247","DOIUrl":"https://doi.org/10.1145/3437959.3459247","url":null,"abstract":"Healthcare is the largest industry in the United States and in most of the developed world. This fact has not escaped recognition by the modeling and simulation community. During the past 15 years the number and variety of simulations and simulators have grown exponentially. That said, future growth will dwarf past growth. The development of human physiological models will expand to include foci ranging from the molecular to the community context. The accessibility to huge databases, the increasingly sophisticated use of machine learning and the compelling market incentives to develop healthcare applications that are both useable and useful. This keynote will explore the implications for modeling and simulation by describing two current healthcare modeling and simulation initiatives, the Digital Patient and the Digital Neighborhood, and identifying some of the central issues that must be addressed. Additionally, the implications for healthcare modeling and simulation that have arisen during the COVID pandemic will be discussed as well as the importance of novelty in planning and executing healthcare simulations.","PeriodicalId":169025,"journal":{"name":"Proceedings of the 2021 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129287866","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}
Wen Jun Tan, Philipp Andelfinger, D. Eckhoff, Wentong Cai, Alois Knoll
{"title":"Causality and Consistency of State Update Schemes in Synchronous Agent-based Simulations","authors":"Wen Jun Tan, Philipp Andelfinger, D. Eckhoff, Wentong Cai, Alois Knoll","doi":"10.1145/3437959.3459262","DOIUrl":"https://doi.org/10.1145/3437959.3459262","url":null,"abstract":"In an agent-based simulation (ABS), a state update scheme carries out the transitions of agents from one state to the next. To produce correct simulation results, the update scheme must respect the cause-and-effect relationships defined by the agent-based model and ensure that the resulting overall simulation state is internally consistent. At the same time, the update scheme should be efficient enough to meet a simulationist's demand for timely results. Considering the common class of synchronous time-driven ABS, a number of update schemes have been employed in the literature and simulation frameworks. In this paper, various implementations of update schemes are analyzed and contrasted with respect to their ability to maintain the simulation correctness as well as their performance characteristics. A semantic model is formulated to define the reference behavior of synchronous time-driven ABS updates and model the dependencies among agent updates using a state access graph. Relying on the formalization, conditions under which different update schemes achieve causality are shown. Further, resolution methods are categorized according to their coordination mechanisms to achieve consistency by resolving conflicts among agent state updates. Through two case studies, the empirical performance of different update schemes and resolution methods are evaluated. For sequential execution, an update scheme based on the agent's dependencies achieves the highest performance, whereas in the parallel case, the choice of update scheme involves a tradeoff between execution time and memory usage. If deterministic simulation output is required, decentralized coordination generally outperforms centralized coordination. The results can assist implementers and researchers in their selection of appropriate methods in the design and implementation of agent-based simulators.","PeriodicalId":169025,"journal":{"name":"Proceedings of the 2021 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116936941","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}
Ali Eker, Yehia Arafa, Abdel-Hameed A. Badawy, N. Santhi, S. Eidenbenz, D. Ponomarev
{"title":"Load-Aware Dynamic Time Synchronization in Parallel Discrete Event Simulation","authors":"Ali Eker, Yehia Arafa, Abdel-Hameed A. Badawy, N. Santhi, S. Eidenbenz, D. Ponomarev","doi":"10.1145/3437959.3459249","DOIUrl":"https://doi.org/10.1145/3437959.3459249","url":null,"abstract":"Traditional Parallel Discrete Event Simulation (PDES) systems employ a monolithic approach for choosing their thread synchronization protocol. They either implement a Time Window-based conservative synchronization or an optimistic event processing capability based on the Time Warp synchronization. In this paper, we show that this binary choice is suboptimal and unnecessary, particularly in the realistic situation where the load distribution across the simulation domain changes over time. We thus propose a new PDES synchronization scheme, called Hybrid PDES, that dynamically switches between conservative and optimistic synchronization protocols based on the simulation run time characteristics. The primary objective of Hybrid PDES is to exploit the optimistic event processing as long as it is beneficial for the system performance and scalability. We implement Hybrid PDES in Python- and Lua-based Simian PDES engines and demonstrate up to 3X performance improvements on Intel Knights Landing and AMD EPYC processors based on the Phold, La-pdes and PPT-GPU simulation applications.","PeriodicalId":169025,"journal":{"name":"Proceedings of the 2021 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125277031","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}
{"title":"Reproducibility Report for the Paper: \"Differentiable Agent-Based Simulation for Gradient-Guided Simulation-Based Optimization\"","authors":"Emilio Incerto, Matteo Principe","doi":"10.1145/3437959.3459265","DOIUrl":"https://doi.org/10.1145/3437959.3459265","url":null,"abstract":"The author claimed for the artifact associated with his paper the following ACM Reproducibility badges:(1) Artifact Available,(2) Artifact Evaluated-Functional,(3) Results Reproduced. After an in-depth review process, we agree to assign all the requested badges as we found it to meet the following requirements:i) it is uploaded on a persistent repository, accessible via a DOI; ii) it is well documented, consistent with the presented data, complete of all the necessary software sources and packages, and exercisable; iii) it is exhaustive in the reproduction of all the relevant data of the paper. Some curves in some reproduced plots are truncated, due to the computational limits imposed by the short-term deadline of the review process. Nevertheless, the overall trends are respected, and the curves are supporting the paper's claims.","PeriodicalId":169025,"journal":{"name":"Proceedings of the 2021 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127250857","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}
Wenjie Tang, Yiping Yao, Feng Zhu, Bin Chen, Wentong Cai
{"title":"A Parallel Hierarchical Sort-based Interest Matching Algorithm","authors":"Wenjie Tang, Yiping Yao, Feng Zhu, Bin Chen, Wentong Cai","doi":"10.1145/3437959.3459259","DOIUrl":"https://doi.org/10.1145/3437959.3459259","url":null,"abstract":"Interest management is a filtering technique to reduce communication in simulation. It involves a process called \"interest matching\" to identify intersections between two sets of d-dimensional axis-parallel rectangles. Because of frequent demands in simulation execution, interest matching becomes a bottleneck as the problem size grows. However, classical interest matching algorithms, mainly designed for serial processing, do not take advantage of modern multicore processors' computing power. Recent parallel interest matching algorithms can fill the gap, but there is scope for improvement. In this paper, we propose a parallel hierarchical sort-based interest matching algorithm. It embeds subscription regions into an interest management tree and allows update regions compare with nodes of the tree to find results in parallel. The association between adjacent nodes and the hierarchical relation between parent-child nodes can serve to eliminate unnecessary operations. Moreover, we also provide proof to confirm the correctness and a detailed analysis of time-complexity. The experimental results demonstrate that the proposed algorithm can achieve better performance than state-of-art algorithms.","PeriodicalId":169025,"journal":{"name":"Proceedings of the 2021 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130780155","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}
{"title":"Hot Area Targeting Dead Reckoning for Distributed Virtual Environments","authors":"Youfu Chen, Wentong Cai, Elvis S. Liu","doi":"10.1145/3437959.3459260","DOIUrl":"https://doi.org/10.1145/3437959.3459260","url":null,"abstract":"Dead reckoning (DR) is a key technique to increase scalability in Distributed Virtual Environments (DVE). Replacing data transmission with prediction, DR relies on its prediction capability to reduce the bandwidth consumption in the cost of inconsistency among participants. We propose a hot area targeting DR (HATDR) approach to increase the prediction capability by the hot area targeting pattern discovered with a noise-resistant clustering approach. This approach is shown to be robust against hyperparameters. Experiments carried out with a real-life MMOG dataset show that HATDR is comparable to the state-of-the-art DR approaches.","PeriodicalId":169025,"journal":{"name":"Proceedings of the 2021 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126501422","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}
{"title":"High-Performance PDES on Manycore Clusters","authors":"B. Williams, Ali Eker, K. Chiu, D. Ponomarev","doi":"10.1145/3437959.3459252","DOIUrl":"https://doi.org/10.1145/3437959.3459252","url":null,"abstract":"Performance and scalability of Parallel Discrete Event Simulation (PDES) is often limited by fine-grain communication, especially in execution environments with high communication cost. Low latencies of on-chip communication in emerging manycore processors promise to substantially alleviate conventional PDES bottlenecks. However, scaling to manycore clusters requires balancing faster on chip communication with slower traditional network communication between cluster nodes. In this work, we investigate performance of PDES on a cluster of Intel's Knights Landing (KNL) processors, identify performance bottlenecks, and propose techniques to address them. Specifically, we propose three performance optimizations: (1) a new design of the communication buffer centered around the use of atomic compare-and-swap operations to reduce synchronization overhead between a dedicated communication thread and computation threads; (2) careful selection of the number of computation threads per communication thread to limit the pressure on each communication thread; and (3) balancing the timing of communication and computation threads to ensure their synchronized forward progress. Combined, these optimizations result in a 2X - 16X speedup over baseline implementations in ROSS simulator.","PeriodicalId":169025,"journal":{"name":"Proceedings of the 2021 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130348613","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}
{"title":"Session details: Keynote Speech I","authors":"S. Diallo","doi":"10.1145/3467665","DOIUrl":"https://doi.org/10.1145/3467665","url":null,"abstract":"","PeriodicalId":169025,"journal":{"name":"Proceedings of the 2021 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126880916","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}
Christina Obermaier, R. Riebl, Christian Facchi, A. Al-Bayatti, Sarmadullah Khan
{"title":"COSIDIA: An Approach for Real-Time Parallel Discrete Event Simulations Tailored for Wireless Networks","authors":"Christina Obermaier, R. Riebl, Christian Facchi, A. Al-Bayatti, Sarmadullah Khan","doi":"10.1145/3437959.3459250","DOIUrl":"https://doi.org/10.1145/3437959.3459250","url":null,"abstract":"Hardware in the Loop (HIL) simulation is the de facto standard for system tests in the automotive industry. However, when it comes to Vehicular Ad Hoc Network (VANET) based applications, current simulators are not able to simulate sufficiently large test scenarios in real time. Thus, this paper introduces \"Concurrent Simulation of Discrete Actions\" (COSIDIA), a parallel simulation framework tailored for, but not limited to, wireless networks with many highly mobile nodes. COSIDIA is a Discrete Action Simulation (DAS) framework which extends the Discrete Event Simulation (DES) principle by assigning a duration to every event. This enables parallel execution of events by design, without the need for complex synchronisation algorithms. COSIDIA combines this concept with fibers, lightweight threads handled entirely in userspace. Preliminary results show that COSIDIA performs significantly better than a comparable singlecore DES simulation in terms of real-time execution.","PeriodicalId":169025,"journal":{"name":"Proceedings of the 2021 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"244 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115000788","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}