2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation最新文献_第3页

Discrete Event Simulation for Antisubmarine Searching 反潜搜索离散事件仿真

2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation Pub Date : 2012-07-15 DOI: 10.1109/PADS.2012.14

Jinshu Wang, Bin Xiao

引用次数: 0

Performance Analysis of a Multithreaded PDES Simulator on Multicore Clusters 多核集群上多线程PDES模拟器的性能分析

2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation Pub Date : 2012-07-15 DOI: 10.1109/PADS.2012.33

Jingjing Wang, D. Ponomarev, N. Abu-Ghazaleh

引用次数: 10

Offline Road Network Partitioning in Distributed Transportation Simulation 分布式交通仿真中的离线路网划分

2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation Pub Date : 2012-07-15 DOI: 10.1109/PADS.2012.28

Xu Yan, Gary S. H. Tan

{"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}

引用次数: 2

An Objective-Based Approach for Semantic Validation of Emergence in Component-Based Simulation Models 基于目标的构件仿真模型突现语义验证方法

2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation Pub Date : 2012-07-15 DOI: 10.1109/PADS.2012.9

Claudia Szabo, Y. M. Teo

引用次数: 8

Exploiting Sensor Spatial Correlation for Dynamic Data Driven Simulation of Wildfire 利用传感器空间相关性进行野火动态数据驱动模拟

2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation Pub Date : 2012-07-15 DOI: 10.1109/PADS.2012.17

Haidong Xue, Xiaolin Hu

引用次数: 3

HLA-Based Parallel Simulation: A Case Study 基于hla的并行仿真:一个案例研究

2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation Pub Date : 2012-07-15 DOI: 10.1109/PADS.2012.21

Buquan Liu, Yiping Yao, Zhiwen Jiang, Laibin Yan, Qingjun Qu, Shaoliang Peng

引用次数: 5

Open Network Emulator: A Parallel Direct Code Execution Network Simulator 开放网络模拟器:一个并行的直接代码执行网络模拟器

2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation Pub Date : 2012-07-15 DOI: 10.1109/PADS.2012.29

V. Duggirala, S. Varadarajan

{"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}

引用次数: 7

Hierarchical Composite Synchronization 分层复合同步

2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation Pub Date : 2012-07-15 DOI: 10.1109/PADS.2012.20

Jason Liu, Rong Rong

引用次数: 19

Verifying Dynamic Semantic Composability of BOM-Based Composed Models Using Colored Petri Nets 彩色Petri网验证基于bom的组合模型的动态语义可组合性

2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation Pub Date : 2012-07-15 DOI: 10.1109/PADS.2012.48

Imran Mahmood, R. Ayani, Vladimir Vlassov, F. Moradi

{"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}

引用次数: 10

Towards Symmetric Multi-threaded Optimistic Simulation Kernels 面向对称多线程乐观仿真内核

2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation Pub Date : 2012-07-15 DOI: 10.1109/PADS.2012.46

Roberto Vitali, Alessandro Pellegrini, F. Quaglia

{"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}

引用次数: 55