To develop antisubmarine searching decision-making system, discrete event system simulation is researched with applications. Based on force turning event generation, the search progress is divided into sequential linear spaces, and analytic equations are established for find event generation. Simulation experiment for large number of specimens is implemented with parallel computing, and efficiency analysis for experiment data is implemented.
{"title":"Discrete Event Simulation for Antisubmarine Searching","authors":"Jinshu Wang, Bin Xiao","doi":"10.1109/PADS.2012.14","DOIUrl":"https://doi.org/10.1109/PADS.2012.14","url":null,"abstract":"To develop antisubmarine searching decision-making system, discrete event system simulation is researched with applications. Based on force turning event generation, the search progress is divided into sequential linear spaces, and analytic equations are established for find event generation. Simulation experiment for large number of specimens is implemented with parallel computing, and efficiency analysis for experiment data is implemented.","PeriodicalId":299627,"journal":{"name":"2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125872111","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}
The performance of fine-grained applications such as Parallel Discrete Event Simulation (PDES) is limited by communication overheads. Multi-core architectures with tightly integrated cores on a single chip can substantially reduce the communication cost. The number of cores available on such machines remains low. To scale the simulation, it is important to be able to effectively use Clusters of Multicores (CMs). However, the high communication overheads between remote machines can significantly limit scalability. It is unclear if, in the presence of relatively slow links, there is a benefit of having the low latency between the cores on the same machine. In this paper, we first extended a multithreaded PDES simulator to support CMs. In addition, we show that remote communication forms a primary challenge to scalability due to both latency and message processing software overheads.
{"title":"Performance Analysis of a Multithreaded PDES Simulator on Multicore Clusters","authors":"Jingjing Wang, D. Ponomarev, N. Abu-Ghazaleh","doi":"10.1109/PADS.2012.33","DOIUrl":"https://doi.org/10.1109/PADS.2012.33","url":null,"abstract":"The performance of fine-grained applications such as Parallel Discrete Event Simulation (PDES) is limited by communication overheads. Multi-core architectures with tightly integrated cores on a single chip can substantially reduce the communication cost. The number of cores available on such machines remains low. To scale the simulation, it is important to be able to effectively use Clusters of Multicores (CMs). However, the high communication overheads between remote machines can significantly limit scalability. It is unclear if, in the presence of relatively slow links, there is a benefit of having the low latency between the cores on the same machine. In this paper, we first extended a multithreaded PDES simulator to support CMs. In addition, we show that remote communication forms a primary challenge to scalability due to both latency and message processing software overheads.","PeriodicalId":299627,"journal":{"name":"2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132112474","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}
Distributed transportation simulation is an important technology for evaluating various Intelligent Transportation Systems (ITS) applications, before they are implemented in the real-world traffic system. Offline road network partitioning is the first step towards distributed transportation simulation. However, as the most popular offline road network partitioning solution, METIS cannot naturally formalize data distribution in ITS applications, and thus cannot guarantee to minimize data exchanges between partitions. In this paper, we propose to formalize offline road network partitioning as a hyper graph partitioning, which can naturally deal with data distribution in ITS applications. Then, we propose to solve the hyper graph partitioning using hMETIS, a graph partitioning algorithm borrowed from VLSI applications. Preliminary experiments show that even in the case where there is no ITS application, hyper graph-based offline road network partitioning can reduce data exchanges between partitions by around 10% on average. Currently, we are evaluating hyper graph-based offline road network partitioning on ITS applications.
{"title":"Offline Road Network Partitioning in Distributed Transportation Simulation","authors":"Xu Yan, Gary S. H. Tan","doi":"10.1109/PADS.2012.28","DOIUrl":"https://doi.org/10.1109/PADS.2012.28","url":null,"abstract":"Distributed transportation simulation is an important technology for evaluating various Intelligent Transportation Systems (ITS) applications, before they are implemented in the real-world traffic system. Offline road network partitioning is the first step towards distributed transportation simulation. However, as the most popular offline road network partitioning solution, METIS cannot naturally formalize data distribution in ITS applications, and thus cannot guarantee to minimize data exchanges between partitions. In this paper, we propose to formalize offline road network partitioning as a hyper graph partitioning, which can naturally deal with data distribution in ITS applications. Then, we propose to solve the hyper graph partitioning using hMETIS, a graph partitioning algorithm borrowed from VLSI applications. Preliminary experiments show that even in the case where there is no ITS application, hyper graph-based offline road network partitioning can reduce data exchanges between partitions by around 10% on average. Currently, we are evaluating hyper graph-based offline road network partitioning on ITS applications.","PeriodicalId":299627,"journal":{"name":"2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128590035","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}
Component-based models have been shown to exhibit emergent properties but despite a plethora of definitions and methods to identify emergence, practical semantic validation approaches remain a key challenge. This paper proposes an objective-based approach for semantic validation of emergence in component-based simulation models. In contrast to current methods, our approach describes model components in terms of what they achieve rather than how they achieve it, and we exploit reconstruct ability analysis in the validation of emergence. This has the advantage of reducing the number of attributes used to describe each component, and thus facilitates the application of more rigorous mathematical formalisms for emergence validation. As an example, we detail how this methodology is integrated into the life-cycle of our component-based model development framework.
{"title":"An Objective-Based Approach for Semantic Validation of Emergence in Component-Based Simulation Models","authors":"Claudia Szabo, Y. M. Teo","doi":"10.1109/PADS.2012.9","DOIUrl":"https://doi.org/10.1109/PADS.2012.9","url":null,"abstract":"Component-based models have been shown to exhibit emergent properties but despite a plethora of definitions and methods to identify emergence, practical semantic validation approaches remain a key challenge. This paper proposes an objective-based approach for semantic validation of emergence in component-based simulation models. In contrast to current methods, our approach describes model components in terms of what they achieve rather than how they achieve it, and we exploit reconstruct ability analysis in the validation of emergence. This has the advantage of reducing the number of attributes used to describe each component, and thus facilitates the application of more rigorous mathematical formalisms for emergence validation. As an example, we detail how this methodology is integrated into the life-cycle of our component-based model development framework.","PeriodicalId":299627,"journal":{"name":"2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124634019","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}
Dynamic data driven simulation based on Particle Filter (PF) has been shown to increase the accuracy of wildfire spread simulation by assimilating real time sensor data into the simulation. An important issue in dynamic data driven simulation is to utilize the sensor data in an efficient and effective manner. In our previous work, all sensor readings are treated as independent from each other, however, when sensors are randomly deployed, measurement data from nearby sensors could be correlated and thus biased observation could be incurred. This paper presents a spatial correlation model to exploit sensor correlations from sensor spatial locations and inter-distance, and integrate it as part of the PF measurement model. Experiment results show that with the information of sensor correlation simulation accuracy is further increased.
{"title":"Exploiting Sensor Spatial Correlation for Dynamic Data Driven Simulation of Wildfire","authors":"Haidong Xue, Xiaolin Hu","doi":"10.1109/PADS.2012.17","DOIUrl":"https://doi.org/10.1109/PADS.2012.17","url":null,"abstract":"Dynamic data driven simulation based on Particle Filter (PF) has been shown to increase the accuracy of wildfire spread simulation by assimilating real time sensor data into the simulation. An important issue in dynamic data driven simulation is to utilize the sensor data in an efficient and effective manner. In our previous work, all sensor readings are treated as independent from each other, however, when sensors are randomly deployed, measurement data from nearby sensors could be correlated and thus biased observation could be incurred. This paper presents a spatial correlation model to exploit sensor correlations from sensor spatial locations and inter-distance, and integrate it as part of the PF measurement model. Experiment results show that with the information of sensor correlation simulation accuracy is further increased.","PeriodicalId":299627,"journal":{"name":"2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation","volume":"201 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115568916","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}
As a distributed simulation standard, the high level architecture (HLA) is used to facilitate the interoperability and reuse of multiple federates, rarely applied in the high-performance parallel simulation. This paper, however, shows a parallel simulation running on a 10 teraflops cluster system, which is based on the master-slave programming model, developed in the use of runtime infrastructure (RTI). After the simulation system is introduced, the framework of its core program is also presented as well as the key techniques of object distribution, event management and time management in the program. The HLA-based simulation supports the single program multiple data (SPMD) execution mode and runs well presently in the high-performance parallel computer.
{"title":"HLA-Based Parallel Simulation: A Case Study","authors":"Buquan Liu, Yiping Yao, Zhiwen Jiang, Laibin Yan, Qingjun Qu, Shaoliang Peng","doi":"10.1109/PADS.2012.21","DOIUrl":"https://doi.org/10.1109/PADS.2012.21","url":null,"abstract":"As a distributed simulation standard, the high level architecture (HLA) is used to facilitate the interoperability and reuse of multiple federates, rarely applied in the high-performance parallel simulation. This paper, however, shows a parallel simulation running on a 10 teraflops cluster system, which is based on the master-slave programming model, developed in the use of runtime infrastructure (RTI). After the simulation system is introduced, the framework of its core program is also presented as well as the key techniques of object distribution, event management and time management in the program. The HLA-based simulation supports the single program multiple data (SPMD) execution mode and runs well presently in the high-performance parallel computer.","PeriodicalId":299627,"journal":{"name":"2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122140263","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}
In this paper, we present the Open Network Emulator (ONE) a network simulator that combines the controllability and scalability of simulation with the direct code execution properties of emulation and experimental test beds. ONE has two novel features. First is a compiler framework that automatically transforms existing network application/protocols written in imperative languages such as C and C++ into composable modules, which can then be combined to create arbitrarily complex network stacks. This compiler framework obviates the need for heavyweight virtualization and enables ONE to execute multiple virtual hosts, each with its own application and network protocol stack, within a single process. The second novel feature of ONE is a new time model called Relativistic Time that combines the controllability of virtual time with the fidelity of real-time. To implement ONE, we ported the complete TCP/IP stack from within the Linux kernel (including the sockets interface, TCP, UDP IPv4 and v6, ICMP, IGMP, traffic shaping, net filters, routing and ARP) and well-known configuration and packet tracing applications such as ifconfig and tcpdump. Existing network applications can be compiled and instantiated within ONE without requiring any source code change. We validated the fidelity of ONE by comparing the packet arrival times of multiple traffic generators on a real network against the arrival times with ONE emulation. Our preliminary performance evaluation of ONE on an 8 core system shows that ONE is highly efficient and can run over 450 virtual hosts connected over point-to-point gigabit links, while still retaining linear behavior.
{"title":"Open Network Emulator: A Parallel Direct Code Execution Network Simulator","authors":"V. Duggirala, S. Varadarajan","doi":"10.1109/PADS.2012.29","DOIUrl":"https://doi.org/10.1109/PADS.2012.29","url":null,"abstract":"In this paper, we present the Open Network Emulator (ONE) a network simulator that combines the controllability and scalability of simulation with the direct code execution properties of emulation and experimental test beds. ONE has two novel features. First is a compiler framework that automatically transforms existing network application/protocols written in imperative languages such as C and C++ into composable modules, which can then be combined to create arbitrarily complex network stacks. This compiler framework obviates the need for heavyweight virtualization and enables ONE to execute multiple virtual hosts, each with its own application and network protocol stack, within a single process. The second novel feature of ONE is a new time model called Relativistic Time that combines the controllability of virtual time with the fidelity of real-time. To implement ONE, we ported the complete TCP/IP stack from within the Linux kernel (including the sockets interface, TCP, UDP IPv4 and v6, ICMP, IGMP, traffic shaping, net filters, routing and ARP) and well-known configuration and packet tracing applications such as ifconfig and tcpdump. Existing network applications can be compiled and instantiated within ONE without requiring any source code change. We validated the fidelity of ONE by comparing the packet arrival times of multiple traffic generators on a real network against the arrival times with ONE emulation. Our preliminary performance evaluation of ONE on an 8 core system shows that ONE is highly efficient and can run over 450 virtual hosts connected over point-to-point gigabit links, while still retaining linear behavior.","PeriodicalId":299627,"journal":{"name":"2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124882674","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}
This paper presents a hierarchical composite synchronization algorithm for parallel discrete-event simulation. The composite approach combines an asynchronous CMB-style channel scanning method with a synchronous window-based method to avoid pathological situations where neither synchronization algorithms would perform optimally. The hierarchical approach addresses the discrepancy in the communication and synchronization cost for shared-memory multiprocessor multicore machines and for distributed-memory machines. The paper describes a performance model for the hierarchical composite algorithm and proposes a method for predicting the runtime empirically using linear regression. Experiment results show that the model can predict the overall performance of the hierarchical composite algorithm. A significant performance improvement has been observed over different combinations of the traditional asynchronous and synchronous approaches used separately for distributed-memory machines and on shared-memory multiprocessor multicore machines.
{"title":"Hierarchical Composite Synchronization","authors":"Jason Liu, Rong Rong","doi":"10.1109/PADS.2012.20","DOIUrl":"https://doi.org/10.1109/PADS.2012.20","url":null,"abstract":"This paper presents a hierarchical composite synchronization algorithm for parallel discrete-event simulation. The composite approach combines an asynchronous CMB-style channel scanning method with a synchronous window-based method to avoid pathological situations where neither synchronization algorithms would perform optimally. The hierarchical approach addresses the discrepancy in the communication and synchronization cost for shared-memory multiprocessor multicore machines and for distributed-memory machines. The paper describes a performance model for the hierarchical composite algorithm and proposes a method for predicting the runtime empirically using linear regression. Experiment results show that the model can predict the overall performance of the hierarchical composite algorithm. A significant performance improvement has been observed over different combinations of the traditional asynchronous and synchronous approaches used separately for distributed-memory machines and on shared-memory multiprocessor multicore machines.","PeriodicalId":299627,"journal":{"name":"2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134183289","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}
Imran Mahmood, R. Ayani, Vladimir Vlassov, F. Moradi
Model reuse is a promising and appealing convention for effective development of simulation systems as it offers reduction in development cost and time. Various methodological advances in this area have given rise to the development of different component reusability frameworks such as BOM (Base Object Model). But lack of component matching and weak support for compos ability verification and validation, in these frameworks, makes it difficult to achieve effective and meaningful reuse. In this paper we focus on Compos ability verification and propose a process to verify BOM based composed model at dynamic semantic level. We suggest an extension to the BOM components, to capture behavior at a greater detail. Then we transform the extended BOM into our proposed Colored Petri Nets (CPN) based component model so that the components can be composed and executed at an abstract level. Subsequently we advocate to use CPN tools and analysis techniques to verify that the model satisfy given requirements. We classify the properties of a system among different groups and express the model's requirements by selecting some of the properties from these groups to form requirement specification. Also we present an example of a Field Artillery model, in which we select a set of properties as requirement specification, and explain how CPN state-space analysis technique is used to verify the required properties. Our experience confirms that CPN tools provide strong support for verification of composed models.
{"title":"Verifying Dynamic Semantic Composability of BOM-Based Composed Models Using Colored Petri Nets","authors":"Imran Mahmood, R. Ayani, Vladimir Vlassov, F. Moradi","doi":"10.1109/PADS.2012.48","DOIUrl":"https://doi.org/10.1109/PADS.2012.48","url":null,"abstract":"Model reuse is a promising and appealing convention for effective development of simulation systems as it offers reduction in development cost and time. Various methodological advances in this area have given rise to the development of different component reusability frameworks such as BOM (Base Object Model). But lack of component matching and weak support for compos ability verification and validation, in these frameworks, makes it difficult to achieve effective and meaningful reuse. In this paper we focus on Compos ability verification and propose a process to verify BOM based composed model at dynamic semantic level. We suggest an extension to the BOM components, to capture behavior at a greater detail. Then we transform the extended BOM into our proposed Colored Petri Nets (CPN) based component model so that the components can be composed and executed at an abstract level. Subsequently we advocate to use CPN tools and analysis techniques to verify that the model satisfy given requirements. We classify the properties of a system among different groups and express the model's requirements by selecting some of the properties from these groups to form requirement specification. Also we present an example of a Field Artillery model, in which we select a set of properties as requirement specification, and explain how CPN state-space analysis technique is used to verify the required properties. Our experience confirms that CPN tools provide strong support for verification of composed models.","PeriodicalId":299627,"journal":{"name":"2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121204105","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}
In this article we address the reshuffle of the design of optimistic simulation kernels in order to fit multi-core/multi-processor machines. This is done by providing a reference optimistic simulation architecture based on the symmetric multi-threaded paradigm, where each simulation kernel instance is allowed to run a dynamically changing set of worker threads that share the whole load of LPs hosted by that kernel, and that can run both application-level event handlers and kernel-level housekeeping tasks. With this organization, CPU-cores can be dynamically reassigned to the different kernels depending on fluctuations of the workload, so to maximize productivity in an orthogonal manner with respect to traditional load balancing schemes, typically employed in the context of single-threaded simulation kernels. In order to optimize efficiency and reduce wait-for-lock-release phases while synchronizing worker threads running in kernel mode, we borrow from Operating Systems' theory by readapting the top/bottom-halves paradigm to the design of optimistic simulation systems. We also present a real implementation of our multi-threaded architecture within the ROme OpTimistic Simulator (ROOT-Sim), namely an open-source C-based simulation platform implemented according to the PDES paradigm and the optimistic synchronization approach. Experimental results for an assessment of the validity of our proposal are presented as well.
{"title":"Towards Symmetric Multi-threaded Optimistic Simulation Kernels","authors":"Roberto Vitali, Alessandro Pellegrini, F. Quaglia","doi":"10.1109/PADS.2012.46","DOIUrl":"https://doi.org/10.1109/PADS.2012.46","url":null,"abstract":"In this article we address the reshuffle of the design of optimistic simulation kernels in order to fit multi-core/multi-processor machines. This is done by providing a reference optimistic simulation architecture based on the symmetric multi-threaded paradigm, where each simulation kernel instance is allowed to run a dynamically changing set of worker threads that share the whole load of LPs hosted by that kernel, and that can run both application-level event handlers and kernel-level housekeeping tasks. With this organization, CPU-cores can be dynamically reassigned to the different kernels depending on fluctuations of the workload, so to maximize productivity in an orthogonal manner with respect to traditional load balancing schemes, typically employed in the context of single-threaded simulation kernels. In order to optimize efficiency and reduce wait-for-lock-release phases while synchronizing worker threads running in kernel mode, we borrow from Operating Systems' theory by readapting the top/bottom-halves paradigm to the design of optimistic simulation systems. We also present a real implementation of our multi-threaded architecture within the ROme OpTimistic Simulator (ROOT-Sim), namely an open-source C-based simulation platform implemented according to the PDES paradigm and the optimistic synchronization approach. Experimental results for an assessment of the validity of our proposal are presented as well.","PeriodicalId":299627,"journal":{"name":"2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation","volume":"302 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123234364","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：