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

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

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

来源：评论

学校读者我要写书评

暂无评论

Massively parallel and Distributed simulation of a Class of discrete event Systems: A Different Perspective

引用

ACM Transactions on Modeling and Computer simulation (TOMACS) 1992年第3期2卷 214-238页

作者： Vakili, Pirooz Department of Manufacturing Engineering Boston University Boston MA 02215 44 Cummington Street United States

In this paper we propose a new approach to parallel and distributed simulation of discrete event systems. Most parallel and distributed discrete event simulation algorithms are concerned with the simulation of one “large” discrete event system. In this case the computational intensity is due to the size and complexity of the simulated system. In contrast, we are interested in simulating a “large” number of “medium sized” systems. These are variants of a “nominal system” with different system parameter values or operation policies. The computational intensity in our case is due to the “large” number of simulated variants. Many simulation projects such as factor screening, performance modeling, and optimization require system performance evaluations at many parameter values;and others, we believe, could significantly benefit from them. There is considerable work in the literature on stochastic coupling of trajectories of parametric families of stochastic processes. Our approach can be viewed as the simulation of the coupled trajectories. We use a single clock mechanism that drives all trajectories simultaneously, hence the approach is called Single Clock Multiple System 1992 simulation. The single clock synchronizes all trajectories such that the “same” event occurs at the “same” time at all systems. This synchronization is the basis of our parallel and distributed algorithms. We focus on a particular implementation of the SCMS simulation using the so-called Standard Clock (SC) technique and also on the massively parallel implementation of the SC algorithms on the SIMD Connection Machine. Orders of magnitude of speedup is possible. Furthermore, the possibility of concurrent performance evaluation and comparison at many system parameter values offers new and significant opportunities for performance optimization. © 1992, ACM. All rights reserved.

关键词： event-driven simulation parallel discrete-event simulation speedup

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A unifying framework for specifying DEVS parallel and distributed simulation architectures

引用

simulation-TRANSACTIONS OF THE SOCIETY FOR MODELING AND simulation INTERNATIONAL 2013年第11期89卷 1293-1309页

作者： Adegoke, Adedoyin Togo, Hamidou Traore, Mamadou K. African Univ Sci & Technol Galadimawa Abuja Nigeria Univ Sci Tech & Technol Bamako Bamako Mali Univ Blaise Pascal LIMOS Aubiere France

DEVS (discrete event System Specification) is an approach in the area of modeling and simulation that provides a means of specifying dynamic systems. A variety of DEVS tools have been implemented without a standard developmental guideline across the board, consequently revealing a lack of central frameworks for integrating heterogeneous DEVS simulators. When implementing a DEVS Simulator there are salient concepts that are intuitively defined, such as how events should be processed, what simulation architecture to use, what existing procedures (set of rules/algorithm) can be used, what should be the organizational architecture and so on. The aim of this paper is to propose a theoretical guide in building a DEVS distributed simulation as well as a formalization of underlying concepts to allow symbolic reasoning and automated code synthesis. From a review of existing implementation approaches, we propose a taxonomy of the identified concepts, including some formal definitions as they constitute the essential building blocks of performing parallel discrete-event simulation by utilizing DEVS. The contribution of this taxonomy and its impact as a unifying framework is that it provides a more systematic understanding of the process of constructing a DEVS simulator. Also, it offers an abstract way for integrating different and heterogeneous DEVS implementation strategies and thus can serve as a contribution to the on-going DEVS standardization efforts.

关键词： DEVS parallel discrete-event simulation conceptual framework simulation Tree simulation Graph

来源：评论

学校读者我要写书评

暂无评论

Nonblocking checkpointing for optimistic parallel simulation: Description and an implementation

引用

IEEE TRANSACTIONS ON parallel AND DISTRIBUTED SYSTEMS 2003年第6期14卷 593-610页

作者： Quaglia, F Santoro, A Univ Roma La Sapienza Dipartimento Informat & Sistemist I-00198 Rome Italy

This paper describes a nonblocking checkpointing mode in support of optimistic parallel discrete event simulation. This mode allows real concurrency in the execution of state saving and other simulation specific operations (e.g., event list update, event execution) with the aim of removing the, cost of recording state information from the completion time of the parallel simulation application. We present an implementation of a C library supporting nonblocking checkpointing on a myrinet based cluster, which demonstrates the practical viability of this checkpointing mode on standard off-the-shelf hardware. By the results of an empirical study on classical parameterized synthetic benchmarks, we show that, except for the case of minimal state granularity applications, nonblocking checkpointing allows improvement of the speed of the parallel execution, as compared to commonly adopted, optimized checkpointing methods based on the classical blocking mode. A performance study for the case of a Personal Communication System (PCS) simulation is additionally reported to point out the benefits from nonblocking checkpointing for a real world application.

关键词： parallel discrete-event simulation optimistic synchronization checkpointing myrinet DMA performance optimization

来源：评论

学校读者我要写书评

暂无评论

A cost model for selecting checkpoint positions in time warp parallel simulation

引用

IEEE TRANSACTIONS ON parallel AND DISTRIBUTED SYSTEMS 2001年第4期12卷 346-362页

作者： Quaglia, F Univ Roma La Sapienza Dipartimento Informat & Sistemist I-00198 Rome Italy

Recent papers have shown that the performance of Time Warp simulators can be improved by appropriately selecting the positions of checkpoints, instead of taking them on a periodic basis. In this paper, we present a checkpointing technique in which the selection of the positions of checkpoints is based on a checkpointing-recovery cost model. Given the current state S, the model determines the convenience of recording S as a checkpoint before the next event is executed. This is done by taking into account the position of the last taken checkpoint, the granularity (i.e., the execution time) of intermediate events, and using an estimate of the probability that S will have to be restored due to rollback in the future of the execution. A synthetic benchmark in different configurations is used for evaluating and comparing this approach to classical periodic techniques. As a testing environment we used a cluster of PCs connected through a Myrinet switch coupled with a fast communication layer specifically designed to exploit the potential of this type of switch. The obtained results point out that our solution allows faster execution and, in some cases, exhibits the additional advantage that less memory is required for recording state vectors. This possibly contributes to further performance improvements when memory is a critical resource for the specific application. A performance study for the case of a cellular phone system simulation is finally reported to demonstrate the effectiveness of this solution for a real world application.

关键词： parallel discrete-event simulation checkpointing rollback-recovery time warp optimistic synchronization performance optimization cost models

来源：评论

学校读者我要写书评

暂无评论

A Case Study in Using Massively parallel simulation for Extreme-Scale Torus Network Codesign 14

A Case Study in Using Massively Parallel Simulation for Extr...

引用

2nd ACM Conference on SIGSIM Principles of Advanced discrete simulation (ACM SIGSIM/PADS)

作者： Mubarak, Misbah Carothers, Christopher D. Ross, Robert B. Carns, Philip Rensselaer Polytech Inst Dept Comp Sci Troy NY 12180 USA Argonne Natl Lab Math & Comp Sci Div Chicago IL 60439 USA

ISBN: (纸本)9781450327947

A high-bandwidth, low-latency interconnect will be a critical component of future exascale systems. The torus network topology, which uses multidimensional network links to improve path diversity and exploit locality between nodes, is a potential candidate for exascale interconnects. The communication behavior of large-scale scientific applications running on future exascale networks is particularly important and analytical/algorithmic models alone cannot deduce it. Therefore, before building systems, it is important to explore the design space and performance of candidate exascale interconnects by using simulation. We improve upon previous work in this area and present a methodology for modeling and simulating a high-fidelity, validated, and scalable torus network topology at a packet-chunk level detail using the Rensselaer Optimistic simulation System (ROSS). We execute various configurations of a 1.3 million node torus network model in order to examine the effect of torus dimensionality on network performance with relevant HPC traffic patterns. To the best of our knowledge, these are the largest torus network simulations that are carried out at such a detailed fidelity. In terms of simulation performance, a 1.3 million node, 9-D torus network model is shown to process a simulated exascale-class workload of nearest-neighbor traffic with 100 million message injections per second per node using 65,536 Blue Gene/Q cores in a simulation run-time of only 25 seconds. We also demonstrate that massive-scale simulations are a critical tool in exascale system design since small-scale torus simulations are not always indicative of the network behavior at an exascale size. The take-away message from this case study is that massively parallel simulation is a key enabler for effective extreme-scale network codesign.

关键词： High-performance computing parallel discrete-event simulation Massively parallel architectures Torus networks Exascale systems

来源：评论

学校读者我要写书评

暂无评论

Visualizing parallel simulations that execute in network computing environments

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF GRID COMPUTING AND ESCIENCE 1999年第4期15卷 513-529页

作者： Carothers, CD Topol, B Fujimoto, RM Stasko, JT Sunderam, V Rensselaer Polytech Inst Dept Comp Sci Troy NY 12180 USA IBM Corp Network Comp Software Div Res Triangle Pk NC 27709 USA Georgia Inst Technol Coll Comp Atlanta GA 30332 USA Emory Univ Dept Math & Comp Sci Atlanta GA 30322 USA

parallel discrete-event simulation systems (PDES) are used to simulate large-scale applications such as modeling telecommunication networks, transportation grids, and battlefield scenarios. While a large amount of PDES research has focused on employing multiprocessors and multicomputers, the use of networks of workstations interconnected through Ethernet or ATM has evolved into a popular effective platform for PDES. Nonetheless, the development of efficient PDES systems in network computing environments is not without obstacles that severely degrade simulator performance. To better understand how these factors degrade performance as well as develop new algorithms to mitigate them, we investigate the use of graphical visualization to provide insight into performance evaluation and simulator execution. We began with a general-purpose network computing visualization system, PVaniM, and used it to investigate the execution of an advanced version of Time Warp, called Georgia Tech Time Warp (GTW), which executes in network computing environments. Because PDES systems such as GTW are essentially middleware that support their own applications, we soon realized these systems require their own middleware-specific visualization support. To this end we have extended PVaniM into a new system, called PVaniM-GTW by adding middleware-specific views. Our experiences with PVaniM-GTW indicates that these enhancements enable one to better satisfy the needs of PDES middleware than general-purpose visualization systems while also not requiring the development of application-specific visualizations by the end-user. (C) 1999 Elsevier Science B.V. All rights reserved.

关键词： parallel discrete-event simulation visualization network computing time warp

来源：评论

学校读者我要写书评

暂无评论

Model and simulation of exascale communication networks

引用

JOURNAL OF simulation 2012年第4期6卷 227-236页

作者： Liu, N. Carothers, C. Cope, J. Carns, P. Ross, R. Rensselaer Polytech Inst Dept Comp Sci Troy NY USA Argonne Natl Lab Div Math & Comp Sci Argonne IL 60439 USA

Exascale supercomputers will have millions or even hundreds of millions of processing cores and the potential for nearly billion-way parallelism. Exascale compute and data storage architectures will be critically dependent on the interconnection network. The most popular interconnection network for current and future supercomputer systems is the torus (eg, k-ary, n-cube). This paper focuses on the modelling and simulation of ultra-large-scale torus networks using Rensselaer's Optimistic Simulator System. We compare real communication delays between our model and the actual torus network from Blue Gene/L using 2048 processors. Our performance experiments demonstrate the ability to simulate million-node to billion-node torus networks. The torus network model for a 16-million-node configuration shows a high degree of strong scaling when going from 1024 cores to 32 768 cores on Blue Gene/L, with a peak event-rate of nearly 5 billion events per second. We also demonstrate the performance of our torus network model configured with 1 billion nodes on both Blue Gene/L and Blue Gene/P systems. The observed best event rate at 128K cores is 12.36 billion per second on Blue Gene/P. Journal of simulation (2012) 6, 227-236. doi:10.1057/jos.2012.4;published online 23 March 2012

关键词： parallel discrete-event simulation torus network exascale discrete-event model

来源：评论

学校读者我要写书评

暂无评论

Software control systems for parallel simulation 02

Software control systems for parallel simulation

引用

Proceedings of the sixteenth workshop on parallel and distributed simulation

作者： Radharamanan Radhakrishnan Philip A. Wilsey Experimental Computing Laboratory Cincinnati OH

ISBN: (纸本)9780769516080

parallel simulations using optimistic synchronization strategies such as Time Warp, operate with no regard to global synchronization since this results in greater parallelism and lower synchronization cost. However, like virtual memory, the parallel simulators may end up thrashing instead of performing useful work. The complication in using a Time Warp simulator is then to configure it suitably for good performance and avoid thrashing. Unfortunately, the optimal configuration is not generally static among different applications or even throughout an entire run of a single application. Thus, online feedback control systems are deployed to govern the adjustment of input parameters in our Time Warp simulation kernel. The design and implementation of effective feedback control systems can be difficult; the extra processing is pure overhead that must be absorbed by any performance gains delivered. The problem is further complicated when attempting to build a simulation kernel that is designed efficiently to operate with many different applications. In this paper, we introduce a control-centric architecture that is used to monitor and manage different parts of a Time Warp simulator. Specifically, we extend concepts from control theory such as adaptive control and stability, to better understand and design hierarchically-distributed run-time control systems for Time Warp based parallel simulation.

关键词： parallel discrete-event simulation Time Warp Distributed simulation Run-time Control Control Theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：