D. Coudert, Luc Hogie, Aurélien Lancin, D. Papadimitriou, S. Pérennes, Issam Tahiri
The Autonomous System (AS) topology of the Internet (up to 61k ASs) is growing at a rate of about 10% per year. The Border Gateway Protocol (BGP) starts to show its limits in terms of the number of routing table entries it can dynamically process and control. Due to the increasing routing information processing and storage, the same trend is observed for routing model simulators such as DRMSim specialized in large-scale simulations of routing models. Therefore, DRMSim needs enhancements to support the current size of the Internet topology and its evolution (up to 100k ASs). To this end, this paper proposes a feasibility study of the extension of DRMSim so as to support the Distributed Parallel Discrete Event paradigm. We first detail the possible distribution models and their associated communication overhead. Then, we analyze this overhead by executing BGP on a partitioned topology according to different scenarios. Finally, we conclude on the feasibility of such a simulator by computing the expected additional time required by a distributed simulation of BGP compared to its sequential simulation.
{"title":"Feasibility Study on Distributed Simulations of BGP","authors":"D. Coudert, Luc Hogie, Aurélien Lancin, D. Papadimitriou, S. Pérennes, Issam Tahiri","doi":"10.1109/PADS.2012.19","DOIUrl":"https://doi.org/10.1109/PADS.2012.19","url":null,"abstract":"The Autonomous System (AS) topology of the Internet (up to 61k ASs) is growing at a rate of about 10% per year. The Border Gateway Protocol (BGP) starts to show its limits in terms of the number of routing table entries it can dynamically process and control. Due to the increasing routing information processing and storage, the same trend is observed for routing model simulators such as DRMSim specialized in large-scale simulations of routing models. Therefore, DRMSim needs enhancements to support the current size of the Internet topology and its evolution (up to 100k ASs). To this end, this paper proposes a feasibility study of the extension of DRMSim so as to support the Distributed Parallel Discrete Event paradigm. We first detail the possible distribution models and their associated communication overhead. Then, we analyze this overhead by executing BGP on a partitioned topology according to different scenarios. Finally, we conclude on the feasibility of such a simulator by computing the expected additional time required by a distributed simulation of BGP compared to its sequential simulation.","PeriodicalId":299627,"journal":{"name":"2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation","volume":"213 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":"127680700","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}
We present a new Zero-Copy approach for message passing in a tightly coupled, multi - process parallel discrete event simulation. Our approach is highly scalable and is suited for large scale distributed simulations. A Zero-Copy approach never copies message content. Rather, messages are created initially in a shared - memory region, and only a smart pointer referring to the shared memory object is passed to a message recipient. The smart pointer can be dereferenced normally, and has reference count semantics allowing memory reuse when no references remain. This approach significantly reduces the amount of data copied between processes and results in considerable improvement in overall application performance as compared to more traditional shared - memory based message passing. We demonstrate the efficiency of our approach using two distributed discrete event simulators using conservative synchronization. However, we also included knowledge of the Global Virtual Time and the Current Simulation Time in our memory management algorithms, allowing rollbacks and reclaiming of memory that was freed prematurely.
{"title":"A New Approach to Zero-Copy Message Passing with Reversible Memory Allocation in Multi-core Architectures","authors":"B. Swenson, G. Riley","doi":"10.1109/PADS.2012.3","DOIUrl":"https://doi.org/10.1109/PADS.2012.3","url":null,"abstract":"We present a new Zero-Copy approach for message passing in a tightly coupled, multi - process parallel discrete event simulation. Our approach is highly scalable and is suited for large scale distributed simulations. A Zero-Copy approach never copies message content. Rather, messages are created initially in a shared - memory region, and only a smart pointer referring to the shared memory object is passed to a message recipient. The smart pointer can be dereferenced normally, and has reference count semantics allowing memory reuse when no references remain. This approach significantly reduces the amount of data copied between processes and results in considerable improvement in overall application performance as compared to more traditional shared - memory based message passing. We demonstrate the efficiency of our approach using two distributed discrete event simulators using conservative synchronization. However, we also included knowledge of the Global Virtual Time and the Current Simulation Time in our memory management algorithms, allowing rollbacks and reclaiming of memory that was freed prematurely.","PeriodicalId":299627,"journal":{"name":"2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation","volume":"160 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":"126112389","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}
A latency-hiding algorithm for the parallelization of large scale agent-based model simulations (ABMS) on parallel/distributed computing platform is proposed. The key idea of this algorithm is using redundant computations to hide communication latencies. An analytical model for this algorithm is presented to tell how to select R value to reach the best speedup. Compared to B+2R algorithm [1], theoretical analysis and experimental result show that the algorithm proposed in this paper has the following advantages when running on CPU cluster: 1) it can hide more communication latency, 2) a smaller R can satisfy the best communication latency hiding.
{"title":"A Latency-Hiding Algorithm for ABMS on Parallel/Distributed Computing Environment","authors":"Lili Chen, Jianwen Huang, Jing Zhang","doi":"10.1109/PADS.2012.2","DOIUrl":"https://doi.org/10.1109/PADS.2012.2","url":null,"abstract":"A latency-hiding algorithm for the parallelization of large scale agent-based model simulations (ABMS) on parallel/distributed computing platform is proposed. The key idea of this algorithm is using redundant computations to hide communication latencies. An analytical model for this algorithm is presented to tell how to select R value to reach the best speedup. Compared to B+2R algorithm [1], theoretical analysis and experimental result show that the algorithm proposed in this paper has the following advantages when running on CPU cluster: 1) it can hide more communication latency, 2) a smaller R can satisfy the best communication latency hiding.","PeriodicalId":299627,"journal":{"name":"2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation","volume":"25 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":"121698403","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}
Dong Wang, Linxuan Zhang, Mianmian Wang, Tianyuan Xiao, Z. Hou, F. Zou
Assembly simulation is an important step in the process of digital aircraft manufacturing planning which helps engineers find the defects in the preassembly plan and fix them before practical assembly. In this paper, a simulation system for flexible aircraft assembly is proposed. It uses OGRE and PhysX as the development platform instead of customizing commercial CAD/CAM platforms or implementing the system through OpenGL directly. The reason for choosing open source tools to implement the system is described in detail first. Then the architecture of the system is presented and introduced. Meanwhile, an example is given to illustrate the simulation process which consists of motion simulation and collision analysis. Finally the evaluate system that consists of assembly feasibility analysis, tolerance analysis and ergonomic analysis is described.
{"title":"A Simulation System Based on OGRE and PhysX for Flexible Aircraft Assembly","authors":"Dong Wang, Linxuan Zhang, Mianmian Wang, Tianyuan Xiao, Z. Hou, F. Zou","doi":"10.1109/PADS.2012.7","DOIUrl":"https://doi.org/10.1109/PADS.2012.7","url":null,"abstract":"Assembly simulation is an important step in the process of digital aircraft manufacturing planning which helps engineers find the defects in the preassembly plan and fix them before practical assembly. In this paper, a simulation system for flexible aircraft assembly is proposed. It uses OGRE and PhysX as the development platform instead of customizing commercial CAD/CAM platforms or implementing the system through OpenGL directly. The reason for choosing open source tools to implement the system is described in detail first. Then the architecture of the system is presented and introduced. Meanwhile, an example is given to illustrate the simulation process which consists of motion simulation and collision analysis. Finally the evaluate system that consists of assembly feasibility analysis, tolerance analysis and ergonomic analysis is described.","PeriodicalId":299627,"journal":{"name":"2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124887056","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}
Data creditability plays a very important role in the complex system simulation creditability. From the point of how to evaluate and improve the complex system simulation data creditability, the concept of the data quality modeling is advanced and the three-dimension data quality modeling space is founded. Based on which, a multiple attributes decision making theory based data creditability evaluating method is put forward. Taking the joint simulation and experiment as a typical application area, the application of the data creditability evaluating method is discussed initially.
{"title":"Research on Quality-Based Data Creditability Evaluating Method in Complex Systems Simulation","authors":"Yingchao Zhang, Jing Zhang, Wei Li, Feng Ye","doi":"10.1109/PADS.2012.38","DOIUrl":"https://doi.org/10.1109/PADS.2012.38","url":null,"abstract":"Data creditability plays a very important role in the complex system simulation creditability. From the point of how to evaluate and improve the complex system simulation data creditability, the concept of the data quality modeling is advanced and the three-dimension data quality modeling space is founded. Based on which, a multiple attributes decision making theory based data creditability evaluating method is put forward. Taking the joint simulation and experiment as a typical application area, the application of the data creditability evaluating method is discussed initially.","PeriodicalId":299627,"journal":{"name":"2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123631883","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 method which discretizes long and narrow belt-shaped structure into sequence of cross-sections and creates cross-section models automatically based on the real construction data. Then completion and schedule model of construction are obtained by connecting cross-section schedule models. This Method reduces data volumes effectively and improves automation degree and scalability of modeling constructions. The experiment has shown that this system is full-featured, the modeling and visualization of construction processes can meet the requirement of real-time.
{"title":"Data-Driven 4D Visualization for Simulating Highway Construction Processes","authors":"Chen Guojun, Liu Yan, Chen Jingxiang, Wu Wei","doi":"10.1109/PADS.2012.13","DOIUrl":"https://doi.org/10.1109/PADS.2012.13","url":null,"abstract":"This paper presents a method which discretizes long and narrow belt-shaped structure into sequence of cross-sections and creates cross-section models automatically based on the real construction data. Then completion and schedule model of construction are obtained by connecting cross-section schedule models. This Method reduces data volumes effectively and improves automation degree and scalability of modeling constructions. The experiment has shown that this system is full-featured, the modeling and visualization of construction processes can meet the requirement of real-time.","PeriodicalId":299627,"journal":{"name":"2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116680992","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
扫码关注我们
求助内容：
应助结果提醒方式：