检索结果-内蒙古大学图书馆

A parallel discrete event simulation Engine for the Low-Earth-Orbit Satellite Constellation Networks

China Communications 2024年第8期21卷 264-275页

作者： Su Hailong Liu Yaoqi Zhou Yiqing Shi Jinglin Li Hongguang Qian Manli Institute of Computing Technology Chinese Academy of SciencesBeijing 100190China University of Chinese Academy of Sciences Beijing 100049China State Key Lab of Processors Institute of Computing TechnologyCASBeijing 100190China Zhongke Nanjing Mobile Communication&Computing Innovation Institute Nanjing 211135China Beijing Sylincom Technology Co. Beijing 100190China

Low-Earth-Orbit satellite constellation networks(LEO-SCN)can provide low-cost,largescale,flexible coverage wireless communication *** dynamics and large topological sizes characterize *** development and application testing of LEO-SCN are challenging to carry out in a natural *** platforms are a more effective means of technology *** available simulators have a single function and limited simulation *** needs to be a simulator for full-featured *** this paper,we apply the parallel discrete-event simulation technique to the simulation of LEO-SCN to support large-scale complex system simulation at the packet *** solve the problem that single-process programs cannot cope with complex simulations containing numerous entities,we propose a parallel mechanism and algorithms LP-NM and LP-YAWNS for *** the experiment,we use ns-3 to verify the acceleration ratio and efficiency of the above *** results show that our proposed mechanism can provide parallel simulation engine support for the LEO-SCN.

关键词： constellation low earth orbit satellite ns-3 null-message parallel discrete-event simulation

来源：评论

学校读者我要写书评

暂无评论

A Scalable Quantum Key Distribution Network Testbed Using parallel discrete-event simulation

引用

ACM TRANSACTIONS ON MODELING AND COMPUTER simulation 2022年第2期32卷 11-11页

作者： Wu, Xiaoliang Zhang, Bo Chen, Gong Jin, Dong Illinois Inst Technol Chicago IL 60616 USA Univ Arkansas Fayetteville AR 72701 USA

Quantum key distribution (QKD) has been promoted as a means for secure communications. Although QKD has been widely implemented in many urban fiber networks, the large-scale deployment of QKD remains challenging. Today, researchers extensively conduct simulation-based evaluations for their designs and applications of large-scale QKD networks for cost efficiency. However, the existing discrete-event simulators offer models for QKD hardware and protocols based on sequential event execution, which limits the scale of the experiments. In this work, we explore parallel simulation of QKD networks to address this issue. Our contributions lay in the exploration of QKD network characteristics to be leveraged for parallel simulation as well as the development of a parallel simulation framework for QKD networks. We also investigate three techniques to improve the simulation performance including (1) a ladder queue based event list, (2) memoization for computationally intensive quantum state transformation information, and (3) optimization of the network partition scheme for workload balance. The experimental results show that our parallel simulator is 10 times faster than a sequential simulator when simulating a 128-node QKD network. Our linear-regressionbased network partition scheme can further accelerate the simulation experiments up to two times over using a randomized network partition scheme.

关键词： parallel discrete-event simulation quantum key distribution BB84

来源：评论

学校读者我要写书评

暂无评论

parallel discrete-event simulation on Data Processing Engines 16

Parallel Discrete-Event Simulation on Data Processing Engine...

引用

20th IEEE/ACM International Symposium on Distributed simulation and Real Time Applications (DS-RT)

作者： Shudo, Kazuyuki Kato, Yuya Sugino, Takahiro Hanai, Masatoshi Tokyo Inst Technol Tokyo Japan Cygames Inc Tokyo Japan Digital Arts Inc Tokyo Japan Nanyang Technol Univ Singapore 639798 Singapore

ISBN: (纸本)9781509035052

Development of a decent parallel simulator is challenging work. It should achieve enough performance, scalability and fault tolerance. Our proposal is utilizing general-purpose data processing engines such as MapReduce implementations for parallel simulation. Widely used and mature engines take away a large part of the development effort and support scalability and fault tolerance. We demonstrate that a parallel discrete-event simulator can be implemented on such engines, Apache Hadoop and Apache Spark, by modeling message passing of distributed systems on MapReduce key-value processing model. Implemented simulators could handle 10 8 nodes with 10 computers. Preliminary evaluation showed that our Spark-based simulator is about 20 times as fast as an existing simulator thanks to Time Warp.

关键词： parallel discrete-event simulation Time Warp peer-to-peer data processing engine MapReduce

来源：评论

学校读者我要写书评

暂无评论

Exposing Inter-Process Information for Efficient parallel discrete event simulation of Spatial Stochastic Systems 17

Exposing Inter-Process Information for Efficient Parallel Di...

引用

5th ACM SIGSIM Conference on Principles of Advanced discrete simulation (SIGSIM-PADS)

作者： Linden, Jonatan Bauer, Pavol Engblom, Stefan Jonsson, Bengt Uppsala Univ Dept Informat Technol Uppsala Sweden

ISBN: (纸本)9781450344890

We present a new efficient approach to the parallelization of discrete event simulators for multicore computers, which is based on exposing and disseminating essential information between processors. We aim specifically at simulation models with a spatial structure, where time intervals between successive events are highly variable and without lower bounds. In parallel discrete event simulation (PDES), the model is distributed onto parallel processes. A key challenge in PDES is that each process must continuously decide when to pause its local simulation in order to reduce the risk of expensive rollbacks caused by future "delayed" incoming events from other processes. A process could make such decisions optimally if it would know the timestamps of future incoming events. Unfortunately, this information is often not available in PDES algorithms. We present an approach to designing efficient PDES algorithms, in which an existing natural parallelization of PDES is restructured in order to expose and disseminate more precise information about future incoming events to each LP. We have implemented our approach in a parallel simulator for spatially extended Markovian processes, intended for simulating, e.g., chemical reactions, biological and epidemiological processes. On 32 cores, our implementation exhibits speedup that significantly outweighs the overhead incurred by the refinement. We also show that our resulting simulator is superior in performance to existing simulators for comparable models, achieving for 32 cores an average speedup of 20 relative to an efficient sequential implementation.

关键词： parallel discrete-event simulation PDES Optimism control Multicore Spatial Stochastic simulation

来源：评论

学校读者我要写书评

暂无评论

Partitioned event graph: formalizing LP-based modelling of parallel discrete-event simulation

引用

MATHEMATICAL AND COMPUTER MODELLING OF DYNAMICAL SYSTEMS 2015年第2期21卷 153-179页

作者： Wang, Bing Deng, Bo Xing, Fei Wang, Dongxia Yao, Yiping Beijing Inst Syst Engn Beijing 100101 Peoples R China Natl Univ Def Technol Changsha 410073 Hunan Peoples R China

Logical process (LP) is a modelling paradigm widely used in parallel discrete-event simulation (PDES). However, effective methods for formalizing LP-based modelling of PDES are lacking. This prevents an unambiguous, platform-independent description of LP-based models. We present a formalism named partitioned event graph (PEG) as a solution. PEG extends classical event graph formalism towards a formal specification for LP-based PDES models. We map between PEG and LP-based models, define the structural operational semantics (SOS) in a timed-labelled transition system, and discuss the Wallclock time-based execution. We propose a PEG-based model transformation framework for PDES, which has three model representation phases and distinguishes amongst four kinds of personnel roles. Finally, we present a domain-specific language (DSL) for the PDES of a Lotka-Volterra system and obtain preliminary parallel simulation results using YinHe simulation Utilities for parallel Environment (YHSUPE). The case study shows that the PEG-based framework not only effectively transforms a DSL into the LP paradigm, but will also result in efficient parallel simulation on a specific platform. In summary, by setting out specific characteristics for event scheduling and state space partition in the LP paradigm, PEG provides a formal method for model behaviour analysis and cross-platform model transformation.

关键词： 68Q55 00A72 93C65 65Y05 00A71 event graph parallel discrete-event simulation model transformation structural operational semantics logical process

来源：评论

学校读者我要写书评

暂无评论

Strip Partitioning for Ant Colony parallel and Distributed discrete-event simulation

Strip Partitioning for Ant Colony Parallel and Distributed D...

引用

15th Annual International Conference on Computational Science (ICCS)

作者： Borges, Francisco Gutierrez-Milla, Albert Suppi, Remo Luque, Emilio Univ Autonoma Barcelona Dept Comp Architecture & Operating Syst E-08193 Barcelona Spain

Data partitioning is one of the main problems in parallel and distributed simulation. Distribution of data over the architecture directly influences the efficiency of the simulation. The partitioning strategy becomes a complex problem because it depends on several factors. In an Individual-oriented Model, for example, the partitioning is related to interactions between the individual and the environment. Therefore, parallel and distributed simulation should dynamically enable the interchange of the partitioning strategy in order to choose the most appropriate partitioning strategy for a specific context. In this paper, we propose a strip partitioning strategy to a spatially dependent problem in Individual-oriented Model applications. This strategy avoids sharing resources, and, as a result, it decreases communication volume among the processes. In addition, we develop an objective function that calculates the best partitioning for a specific configuration and gives the computing cost of each partition, allowing for a computing balance through a mapping policy. The results obtained are supported by statistical analysis and experimentation with an Ant Colony application. As a main contribution, we developed a solution where the partitioning strategy can be chosen dynamically and always returns the lowest total execution time.

关键词： parallel and distributed simulation parallel discrete-event simulation High performance distributed simulation Strip Partitioning Individual-oriented Model

来源：评论

学校读者我要写书评

暂无评论

Efficient inter-process synchronization for parallel discrete event simulation on multicores 15

Efficient inter-process synchronization for parallel discret...

引用

3rd ACM Conference on SIGSIM-Principles of Advanced discrete simulation, SIGSIM-PADS 2015

作者： Bauer, Pavol Lindén, Jonatan Engblom, Stefan Jonsson, Bengt Dept. of Information Technology Uppsala University Sweden

ISBN: (纸本)9781450335836

We present a new technique for controlling optimism in parallel discrete event simulation on multicores. It is designed to be suitable for simulating models, in which the time intervals between successive events between different processes are highly variable, and have no lower bounds. In our technique, called Dynamic Local Time Window Estimates (DLTWE), each processor communicates time estimates of its next inter-processor event to (some of) its neighbors, which use the estimates as bounds for advancement of their local simulation time. We have implemented our technique in a parallel simulator for simulation of spatially extended Markovian processes of interacting entities, which can model chemical reactions, processes from biology, epidemics, and many other applications. Intervals between successive events are exponentially distributed, thus having a signifgicant variance and no lower bound. We show that the DLTWE technique can be tuned to drastically reduce the frequency of rollbacks and enable speedups which is superior to that obtained by other works. We also show that the DLTWE technique significantly improves performance over other existing techniques for optimism control that attempt to predict arrival of inter-process events by statistical techniques. © 2015 ACM.

关键词： pdes spatial stochastic simulation multicore parallel discrete-event simulation optimism control

来源：评论

学校读者我要写书评

暂无评论

Strip Partitioning for Ant Colony parallel and Distributed discrete-event simulation

引用

Procedia Computer Science 2015年 51卷 483-492页

作者： Francisco Borges Albert Gutierrez-Milla Remo Suppi Emilio Luque Department of Computer Architecture & Operating Systems Universitat Autonoma de Barcelona Bellaterra 08193 Barcelona Spain

关键词： parallel and distributed simulation parallel discrete-event simulation High performance distributed simulation Strip Partitioning Individual-oriented Model

来源：评论

学校读者我要写书评

暂无评论

parallel simulation of Quantum Networks with Distributed Quantum State Management

引用

ACM TRANSACTIONS ON MODELING AND COMPUTER simulation 2024年第2期34卷 1-28页

作者： Wu, Xiaoliang Kolar, Alexander Chung, Joaquin Jin, Dong Suchara, Martin Kettimuthu, Rajkumar Illinois Inst Technol 10 W 31st St Chicago IL 60616 USA Univ Chicago 5640 S Ellis Ave Chicago IL 60637 USA Argonne Natl Lab 9700 S. Cass Ave Lemont IL 60439 USA Univ Arkansas 227 N Harmon Ave Fayetteville AR 72701 USA

Quantum network simulators offer the opportunity to cost-efficiently investigate potential avenues for building networks that scale with the number of users, communication distance, and application demands by simulating alternative hardware designs and control protocols. Several quantum network simulators have been recently developed with these goals in mind. As the size of the simulated networks increases, however, sequential execution becomes time-consuming. parallel execution presents a suitable method for scalable simulations of large-scale quantum networks, but the unique attributes of quantum information create unexpected challenges. In this work, we identify requirements for parallel simulation of quantum networks and develop the first parallel discrete-event quantum network simulator by modifying the existing serial simulator SeQUeNCe. Our contributions include the design and development of a quantum state manager (QSM) that maintains shared quantum information distributed across multiple processes. We also optimize our parallel code by minimizing the overhead of the QSM and decreasing the amount of synchronization needed among processes. Using these techniques, we observe a speedup of 2 to 25 times when simulating a 1,024-node linear network topology using 2 to 128 processes. We also observe an efficiency greater than 0.5 for up to 32 processes in a linear network topology of the same size and with the same workload. We repeat this evaluation with a randomized workload on a caveman network. We also introduce several methods for partitioning networks by mapping them to different parallel simulation processes. We have released the parallel SeQUeNCe simulator as an open source tool alongside the existing sequential version.

关键词： parallel discrete-event simulation quantum network

来源：评论

学校读者我要写书评

暂无评论

Hybrid PDES simulation of HPC Networks Using Zombie Packets

引用

ACM TRANSACTIONS ON MODELING AND COMPUTER simulation 2025年第2期35卷

作者： Cruz-Camacho, Elkin Brown, Kevin Wang, Xin Xu, Xiongxiao Shu, Kai Lan, Zhiling Ross, Robert B. Carothers, Christopher Rensselaer Polytech Inst Comp Sci Troy NY 12180 USA Argonne Natl Lab Lemont IL USA Univ Illinois Comp Sci Chicago IL USA IIT Chicago IL USA Univ Illinois Chicago IL USA

Although high-fidelity network simulations have proven to be reliable and cost-effective tools to peer into architectural questions for high-performance computing (HPC) networks, they incur a high resource cost. The time spent in simulating a single millisecond of network traffic in the highest detail can take hours, even for static, well-behaved traffic patterns such as uniform random. Surrogate models offer a significant reduction in runtime, yet they cannot serve as complete replacements and should only be used when appropriate. Thus, there is a need for hybrid modeling, where high-fidelity simulation and surrogates run side-by-side. We present a surrogate model for HPC networks in which: packets bypass the network, while the network state is left untouched, i.e., suspended. To bypass the network, we use historical data to estimate the arrival time at which every packet should be scheduled at;to suspend the network, all in-flight packets are scheduled to arrive at their destinations, and are kept in the system to awaken as zombies when switching back to high-fidelity. Speedup for a hybrid model is relative to the proportion of surrogate to high-fidelity. This light-weight surrogate obtained up to 76x speedup. Keeping the zombies in the network showed an increase in the accuracy of the high-fidelity simulation on restart when compared to restarting the network from an empty state.

关键词： parallel discrete-event simulation HPC networks surrogate simulation

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：