2010 IEEE Workshop on Principles of Advanced and Distributed Simulation最新文献

{"title":"Validation of Radio Channel Models Using an Anechoic Chamber","authors":"Yuhao Zheng, D. Nicol","doi":"10.1109/PADS.2010.5471660","DOIUrl":"https://doi.org/10.1109/PADS.2010.5471660","url":null,"abstract":"NA","PeriodicalId":388814,"journal":{"name":"2010 IEEE Workshop on Principles of Advanced and Distributed Simulation","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123715573","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":"Efficient Gigabit Ethernet Switch Models for Large-Scale Simulation","authors":"Dong Jin, D. Nicol, M. Caesar","doi":"10.1109/PADS.2010.5471659","DOIUrl":"https://doi.org/10.1109/PADS.2010.5471659","url":null,"abstract":"Ethernet is the most widely implemented low-level networking technology used today, with Gigabit Ethernet seen as the emerging standard implementation. The backbones of many large scale networks (e.g., data centers, metro-area deployments) are increasingly made up of Gigabit Ethernet as the underlying technology, and Ethernet is seeing increasing use in dynamic and failure-prone settings (e.g., wireless backhaul, developing regions) with high rates of churn. Correspondingly, when using simulation to study such networks and applications that run on them, the switching makes up a significant fraction of the model, and can make up a significant amount of the simulation activity. This paper describes a unique testbed that gathers highly accurate measurements of loss and latency through a switch, experiments that reveal the behavior of three commercial switches, and then proposes simulation models that explain the observed data. The models vary in their computational complexity and in their accuracy with respect to frame loss patterns, and latency through the switch. In particular, the simplest model predicts a frame's loss and latency immediately at the time of its arrival, which keeps the computational cost close to one event per frame per switch, provides excellent temporal separation between switches (useful for parallel simulation), while providing excellent accuracy for loss and adequate accuracy for latency.","PeriodicalId":388814,"journal":{"name":"2010 IEEE Workshop on Principles of Advanced and Distributed Simulation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128922009","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":"Flow: A Stream Processing System Simulator","authors":"Alfred Park, Cheng-Hong Li, R. Nair, N. Ohba, U. Shvadron, A. Zaks, E. Schenfeld","doi":"10.1109/PADS.2010.5471658","DOIUrl":"https://doi.org/10.1109/PADS.2010.5471658","url":null,"abstract":"Stream processing is an important emerging computational model for performing complex operations on and across multi-source, high volume, unpredictable dataflows. We present Flow, a platform for parallel and distributed stream processing system simulation that provides a flexible modeling environment for analyzing stream processing applications. The Flow stream processing system simulator is a high performance, scalable simulator that automatically parallelizes chunks of the model space and incurs near zero synchronization overhead for stream application graphs that exhibit feed-forward behavior. We show promising multi-threaded and multi-process event rates exceeding 80 million events per second on a cluster with 256 processor cores.","PeriodicalId":388814,"journal":{"name":"2010 IEEE Workshop on Principles of Advanced and Distributed Simulation","volume":"664 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133398802","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":"Reversible Parallel Discrete-Event Execution of Large-Scale Epidemic Outbreak Models","authors":"K. Perumalla, S. Seal","doi":"10.1109/PADS.2010.5471657","DOIUrl":"https://doi.org/10.1109/PADS.2010.5471657","url":null,"abstract":"The spatial scale, runtime speed, and behavioral detail of epidemic outbreak simulations altogether require the use of large-scale parallel processing. Here, an optimistic parallel discrete event execution of a reaction-diffusion simulation model of epidemic outbreaks is presented, with an implementation using the μsik simulator. Rollback support is achieved with the development of a novel reversible model that combines reverse computation with a small amount of incremental state saving. Parallel speedup and other runtime performance metrics of the system are tested on a small (8,192-core) Blue Gene / P system, while scalability is demonstrated on 65,536 cores of a large Cray XT5 system. Scenarios representing large population sizes (up to several hundreds of million individual in the largest case) are exercised.","PeriodicalId":388814,"journal":{"name":"2010 IEEE Workshop on Principles of Advanced and Distributed Simulation","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127245910","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":"Simulating Routing Schemes on Large-Scale Topologies","authors":"Luc Hogie, D. Papadimitriou, Issam Tahiri, Frédéric Majorczyk","doi":"10.1109/PADS.2010.5471662","DOIUrl":"https://doi.org/10.1109/PADS.2010.5471662","url":null,"abstract":"The expansion of the Internet routing system results in a number of research challenges, in particular, the Border Gateway Protocol (BGP) starts to show its limits a.o. in terms of the number of routing table entries it can dynamically process and control. Dynamic routing protocols showing better scaling properties are thus under investigation. However, because deploying under-development routing protocols on the Internet is not practicable at a large-scale (due to the size of the Internet topology), simulation is an unavoidable step to validate the properties of a newly proposed routing scheme. Unfortunately, the simulation of inter- domain routing protocols over large networks (order of tens of thousands of nodes) poses real challenges due to the limited memory and computational power that computers impose. This paper presents the Dynamic Routing Model simulator (DRMsim) which addresses the specific problem of large-scale simulations of (inter-domain) routing models on large networks. The motivation for developing a new simulator lies in the limitation of existing simulation tools in terms of the number of nodes they can handle and in the models they propose.","PeriodicalId":388814,"journal":{"name":"2010 IEEE Workshop on Principles of Advanced and Distributed Simulation","volume":"160 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124487509","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":"A Continuous Matching Algorithm for Interest Management in Distributed Virtual Environments","authors":"Elvis S. Liu, G. Theodoropoulos","doi":"10.1109/PADS.2010.5471665","DOIUrl":"https://doi.org/10.1109/PADS.2010.5471665","url":null,"abstract":"Interest management provides scalable data distribution for large-scale distributed virtual environments by filtering irrelevant messages on the network. The interest matching process is essential for most of the interest management schemes which determines what data should be sent to the participants as well as what data should be filtered. Most of the existing interest matching approaches focus on reducing the computational overhead of the matching process. However, they have a fundamental disadvantage - they perform interest matching at discrete time intervals. As a result, they would fail to report events between two consecutive time-steps of simulation. If participants ignore these missing events, they would most likely perform incorrect simulations. This paper presents a new algorithm for continuous interest matching which aims to capture missing events between discrete time-steps. Although our approach requires additional matching steps, we employ a efficient algorithm to significantly reduce this overhead.","PeriodicalId":388814,"journal":{"name":"2010 IEEE Workshop on Principles of Advanced and Distributed Simulation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129162586","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":"On Validation of Semantic Composability in Data-Driven Simulation","authors":"Claudia Szabo, Y. M. Teo","doi":"10.1109/PADS.2010.5471654","DOIUrl":"https://doi.org/10.1109/PADS.2010.5471654","url":null,"abstract":"A simulation model composed using reusable components is semantically valid if it produces meaningful results in terms of expressed behaviors and meets the desired objective. This paper focuses on the validation of component-based data-driven simulation. In data-driven simulation applications, it is necessary to model entity behavior at higher resolution. In simulations such as military training scenarios where entity behavior changes dynamically, additional input data is required to express complex state transitions. This can significantly increase the composed model state space and presents a major challenge in simulation validation. Using a component-based data-driven tactical military simulation, we propose a layered and automated approach for semantic composability validation. While the expressivity of data driven models increases the semantic equivalence of the validated model, it incurs higher validation cost.","PeriodicalId":388814,"journal":{"name":"2010 IEEE Workshop on Principles of Advanced and Distributed Simulation","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131517264","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":"Explicit Spatial Scattering for Load Balancing in Conservatively Synchronized Parallel Discrete Event Simulations","authors":"S. Thulasidasan, S. Kasiviswanathan, S. Eidenbenz, Philip Romero","doi":"10.1109/PADS.2010.5471664","DOIUrl":"https://doi.org/10.1109/PADS.2010.5471664","url":null,"abstract":"We re-examine the problem of load balancing in conservatively synchronized parallel, discrete- event simulations executed on high-performance computing clusters, focusing on simulations where computational and messaging load tend to be spatially clustered. Such domains are frequently characterized by the presence of geographic ``hot-spots'' -- regions that generate significantly more simulation events than others. Examples of such domains include simulation of urban regions, transportation networks and networks where interaction between entities is often constrained by physical proximity. Noting that in conservatively synchronized parallel simulations, the speed of execution of the simulation is determined by the slowest ( i.e most heavily loaded) simulation process, we study different partitioning strategies in achieving equitable processor-load distribution in domains with spatially clustered load. In particular, we study the effectiveness of partitioning via spatial scattering to achieve optimal load balance. In this partitioning technique, nearby entities are explicitly assigned to different processors, thereby scattering the load across the cluster. This is motivated by two observations, namely, (i) since load is spatially clustered, spatial scattering should, intuitively, spread the load across the compute cluster, and (ii) in parallel simulations, equitable distribution of CPU load is a greater determinant of execution speed than message passing overhead. Through large-scale simulation experiments -- both of abstracted and real simulation models -- on high performance clusters, we observe that scatter partitioning -- even with its greatly increased messaging overhead -- often significantly outperforms more conventional spatial partitioning techniques that seek to reduce messaging overhead. Further, even if hot-spots change over the course of the simulation, if the underlying feature of spatial clustering is retained, load continues to be balanced with spatial scattering leading us to the observation that spatial scattering can often obviate the need for dynamic load balancing.","PeriodicalId":388814,"journal":{"name":"2010 IEEE Workshop on Principles of Advanced and Distributed Simulation","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133003904","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":"Optimizing a Business Process Model by Using Simulation","authors":"Farzad Kamrani, R. Ayani, Anvar Karimson","doi":"10.1109/PADS.2010.5471671","DOIUrl":"https://doi.org/10.1109/PADS.2010.5471671","url":null,"abstract":"In this paper we present the problem of optimizing a business process model with the objective of finding the most beneficial assignment of tasks to agents, without modifying the structure of the process itself. The task assignment problem for four types of processes are distinguished and algorithms for finding optimal solutions to them are presented: 1) a business process with a predetermined workflow, for which the optimal solution is conveniently found using the well-known Hungarian algorithm. 2) a Markovian process, for which we present an analytical method that reduces it to the first type. 3) a non-Markovian process, for which we employ a simulation method to obtain the optimal solution. 4) the most general case, i.e. a non-Markovian process containing critical tasks. In such processes, depending on the agents that perform critical tasks the workflow of the process may change. We introduce two algorithms for this type of processes. One that finds the optimal solution, but is feasible only when the number of critical tasks is few. The second algorithm is even applicable to large number of critical tasks but provides a near-optimal solution. In the second algorithm a hill-climbing heuristic method is combined with Hungarian algorithm and simulation to find an overall near-optimal solution for assignments of tasks to agents. The results of a series of tests that demonstrate the feasibility of the algorithms are included.","PeriodicalId":388814,"journal":{"name":"2010 IEEE Workshop on Principles of Advanced and Distributed Simulation","volume":"179 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125815374","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":"Federate Fault Tolerance in HLA-Based Simulation","authors":"Zengxiang Li, Wentong Cai, S. Turner, K. Pan","doi":"10.1109/PADS.2010.5471663","DOIUrl":"https://doi.org/10.1109/PADS.2010.5471663","url":null,"abstract":"A large scale HLA-based simulation (federation) is composed of a large number of simulation components (federates), which may be developed by different participants and executed at different locations. These federates are subject to failures due to various reasons. What is worse, the risk of federation failure increases with the number of federates in the federation. In this paper, a fault tolerance mechanism is proposed to tolerate the crash-stop failures of federates. By exploiting the decoupled federate architecture, federate failures can be masked from the federation and recovery can take place without interrupting the executions of other federates. A basic state recovery protocol is first proposed to recover the state of the failed federate relying on the checkpoint and message logging taken before the failure. Then, an optimized protocol is further developed to accelerate the state recovery procedure. Experiments are carried out to verify that the proposed mechanism provides correct failure recovery. The experimental results also indicate that the optimized protocol can outperform the basic one considerably.","PeriodicalId":388814,"journal":{"name":"2010 IEEE Workshop on Principles of Advanced and Distributed Simulation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120946867","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}