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

Effective fault tolerance for agent-based cluster computing

JOURNAL OF SYSTEMS AND SOFTWARE 1999年第3期48卷 189-196页

作者： Shum, KH Natl Univ Singapore Dept Informat Syst & Comp Sci Harbourlights 098830 Singapore

Long-lived parallel applications running on workstation clusters are vulnerable to single-node or multiple-node failures. Fault recovery is therefore important in avoiding immature program termination. However, much of the runtime overhead imposed by fault tolerance schemes is generally due to the cost of transferring the checkpoint states of applications by disk I/O operations. In this paper, we propose a fault tolerant model in which disk I/O operations are not required because checkpoint states are transferred between replicated parallel applications. We also describe how the resource consumption of the replicated applications can be effective. To achieve this, applications are constructed as computation agents that can reconfigure dynamically according to resource availability. The fault tolerant model has been implemented and tested on a workstation cluster and a Fujitsu AP3000 multiprocessor machine. The measurements of our experiments have showed that efficient fault tolerance can be achieved by replicating parallel applications on workstation clusters. (C) 1999 Elsevier Science Inc. All rights reserved.

关键词： fault tolerance replication checkpointing networks of workstation cluster computing parallel discrete-event simulation

来源：评论

学校读者我要写书评

暂无评论

Abstract Next Subvolume Method: A logical process-based approach for spatial stochastic simulation of chemical reactions

引用

COMPUTATIONAL BIOLOGY AND CHEMISTRY 2011年第3期35卷 193-198页

作者： Wang, Bing Hou, Bonan Xing, Fei Yao, Yiping Natl Univ Def Technol Sch Comp Sci Changsha 410073 Hunan Peoples R China

The spatial stochastic simulation of biochemical systems requires significant calculation efforts. parallel discrete-event simulation is a promising approach to accelerate the execution of simulation runs. However, achievable speedup depends on the parallelism inherent in the model. One of our goals is to explore this degree of parallelism in the Next Subvolume Method type simulations. Therefore we introduce the Abstract Next Subvolume Method, in which we decouple the model representation from the sequential simulation algorithms, and prove that state trajectories generated by its executions statistically accord with those generated by the Next Subvolume Method. The experimental performance analysis shows that optimistic synchronization algorithms, together with careful controls over the speculative execution, are necessary to achieve considerable speedup and scalability in parallel spatial stochastic simulation of chemical reactions. Our proposed method facilitates a flexible incorporation of different synchronization algorithms, and can be used to select the proper synchronization algorithm to achieve the efficient parallel simulation of chemical reactions. (C) 2011 Elsevier Ltd. All rights reserved.

关键词： Stochastic simulation algorithm Next subvolume Method Spatial stochastic simulation parallel discrete-event simulation

来源：评论

学校读者我要写书评

暂无评论

A geographically distributed enterprise simulation system

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2000年第2期17卷 135-146页

作者： Ammerlahn, HR Goldsby, ME Johnson, MM Nicol, DM Sandia Natl Labs Syst Studies Dept 8114 Livermore CA 94551 USA Dartmouth Coll Hanover NH 03755 USA

Sandia National Laboratories has the role of system integrator in the US Department of Energy's Nuclear Weapons Complex (NWC) and the responsibility for maintaining the nuclear stockpile. Maintenance is a complex task that involves a great number of geographically distributed functions, and a variety of analysis tools and models are used to plan operations, assess capabilities and guide political decisions. We are developing a framework for modeling the NWC unde interactive human control. The framework consists of a simulation system whose users and components are distributed across the entire United States. The purpose of the system is to support decisions about questions ranging from low-level operational matters involving only a sub-component of the complex to high-level policy issues requiring simulation of the entire complex. The system integrates multiple domain-specific legacy models and policy models and allows simulation at varying levels of detail. To provide such a framework, we have had to address a number of technical problems, whose solution is the focus of this paper. The three most fundamental problems are to provide geographically distributed, synchronized human participation in the simulation;to provide distributed ownership and security in such a way that the facility hosting a domain-specific model retains all rights to provide or deny a user access to its information;and to integrate legacy models written in a variety of tools or languages and executed on different platforms. Key features of our approach are the use of the Java language and the coordination of the simulation through a new parallel discrete-event simulation system. (C) 2000 Elsevier Science B.V. All rights reserved.

关键词： enterprise modeling parallel discrete-event simulation human-in-the-loop distributed role-based access control Java security legacy systems

来源：评论

学校读者我要写书评

暂无评论

A Visual Analytics Framework for Analyzing parallel and Distributed Computing Applications

A Visual Analytics Framework for Analyzing Parallel and Dist...

引用

IEEE Conference on Visualization in Data Science (VDS)

作者： Li, Jianping Kelvin Fujiwara, Takanori Kesavan, Suraj P. Ross, Caitlin Mubarak, Misbah Carothers, Christopher D. Ross, Robert B. Ma, Kwan-Liu Univ Calif Davis Davis CA 95616 USA Rensselaer Polytech Inst Troy NY 12181 USA Argonne Natl Lab 9700 S Cass Ave Argonne IL 60439 USA

ISBN: (纸本)9781728150475

To optimize the performance and efficiency of HPC applications, programmers and analysts often need to collect various performance metrics for each computer at different time points as well as the communication data between the computers. This results in a complex dataset that consists of multivariate time-series and communication network data, which makes debugging and performance tuning of I IPC applications challenging. Automated analytical methods based on statistical analysis and unsupervised learning are often insufficient to support such tasks without the background knowledge from the application programmers. To better explore and analyze a wide spectrum of HPC datasets, effective visual data analytics techniques are needed. In this paper, we present a visual analytics framework for analyzing HPC datasets produced by parallel discrete-event simulations (PDES). Our framework leverages automated time-series analysis methods and effective visualizations to analyze both multivariate time-series and communication network data. Through several case studies for analyzing the performance of PDES, we show that our visual analytics techniques and system can be effective in reasoning multiple performance metrics, temporal behaviors of the simulation, and the communication patterns.

关键词： Visual analytics information visualization time-series data multivariate data performance analysis parallel discrete-event simulation

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Composite Synchronization 12

Hierarchical Composite Synchronization

引用

ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed simulation (PADS)

作者： Liu, Jason Rong, Rong Florida Int Univ Sch Comp & Informat Sci Miami FL 33199 USA

ISBN: (纸本)9780769547145;9781467317979

This paper presents a hierarchical composite synchronization algorithm for parallel discrete-event simulation. The composite approach combines an asynchronous CMB-style channel scanning method with a synchronous window-based method to avoid pathological situations where neither synchronization algorithms would perform optimally. The hierarchical approach addresses the discrepancy in the communication and synchronization cost for shared-memory multiprocessor multi-core machines and for distributed-memory machines. The paper describes a performance model for the hierarchical composite algorithm and proposes a method for predicting the runtime empirically using linear regression. Experiment results show that the model can predict the overall performance of the hierarchical composite algorithm. A significant performance improvement has been observed over different combinations of the traditional asynchronous and synchronous approaches used separately for distributed-memory machines and on shared-memory multiprocessor multicore machines.

关键词： parallel discrete-event simulation conservative synchronization protocol composite synchronization hierarchical algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimal Run Length for discrete-event Distributed Cluster-Based simulations

Optimal Run Length for Discrete-Event Distributed Cluster-Ba...

引用

14th Annual International Conference on Computational Science

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

In scientific simulations the results generated usually come from a stochastic process. New solutions with the aim of improving these simulations have been proposed, but the problem is how to compare these solutions since the results are not deterministic. Consequently how to guarantee that the output results are statistically trusted. In this work we apply a statistical approach in order to define the transient and steady state in discrete event distributed simulation. We used linear regression and batch method to find the optimal simulation size. As contributions of our work we can enumerate: we have applied and adapted the simple statistical approach in order to define the optimal simulation length;we propose the approximate approach to normal distribution instead of generate replications sufficiently large;and the method can be used in other kind of non-terminating science simulations where the data either have a normal distribution or can be approximated by a normal distribution.

关键词： parallel and distributed simulation parallel discrete-event simulation High performance distributed simulation Output analysis Run length Transient state Steady state

来源：评论

学校读者我要写书评

暂无评论

Designing Systems for Large-Scale, discrete-event simulations: Experiences with the FastTrans parallel Microsimulator

Designing Systems for Large-Scale, Discrete-Event Simulation...

引用

16th International Conference on High Performance Computing (HiPC 2009)

作者： Thulasidasan, Sunil Kasiviswanathan, Shiva Eidenbenz, Stephan Galli, Emanuele Mniszewski, Susan Romero, Phillip Los Alamos Natl Lab Los Alamos NM 87545 USA

ISBN: (纸本)9781424449217

We describe the various aspects involved in building FastTrans, a scalable, parallel microsimulator for transportation networks that can simulate and route tens of millions of vehicles on real-world road networks in a fraction of real time. Vehicular trips are generated using agent-based simulations that provide realistic, daily activity schedules for a synthetic population of millions of intelligent agents. We use parallel discrete-event simulation techniques and distributed-memory algorithms to scale these simulations to over one thousand compute nodes. We present various optimizations for speeding up simulation execution times, including (i) a set of routing algorithms such as variations of Dijkstra's shortest path algorithm and heuristic-based A* search, and (ii) a number of different partitioning schemes for load balancing, including geographic partitioning (that assigns simulation entities that are geographically close by to the same processor) and scattering (that assigns geographically close by entities to different processors). Our main findings include: (i) A* significantly outperforms other routing algorithms while computing near-optimal paths;(ii) surprisingly, scattering outperforms more sophisticated partitioning schemes by achieving near-perfect load-balancing. With optimized routing and partitioning, FastTrans is able to simulate a full 24 hour work-day in New York - involving over one million road links and approximately 25 million vehicular trips - in less than one hour of wall-clock time on a 512-node cluster.

关键词： parallel discrete-event simulation Transportation simulation Load Balancing

来源：评论

学校读者我要写书评

暂无评论

Hybrid PDES simulation of HPC Networks Using Zombie Packets 23

Hybrid PDES Simulation of HPC Networks Using Zombie Packets

引用

ACM SIGSIM International Conference on Principles of Advanced discrete simulation (ACMSIGSIM-PADS)

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

ISBN: (纸本)9798400700309

High-fidelity network simulations provide insights into new realms for high-performance computing (HPC) architectures, although at a high cost. Surrogate models offer a significant reduction in runtime, yet they cannot serve as complete replacements and should be only used when appropriate. Thus the 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, and the network state itself is suspended when switching to the surrogate. To bypass the network, every packet is scheduled to arrive at a predicted time in the future estimated from historical data;to suspend the network, all in-flight packets are delivered to their destinations, but they 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. We obtained a 3x speedup for a simulation where 70% of virtual time was spent in surrogate mode. When considering the surrogate portion only, the speedup jumps to nearly 20x on a uniform random network traffic example. The accuracy of the overall simulation increased when the network state was suspended instead of ignored, which demonstrates the need for modeling the network state when transitioning from surrogate back to high-fidelity mode.

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

来源：评论

学校读者我要写书评

暂无评论

Fine-Grained Local Dynamic Load Balancing in PDES 18

Fine-Grained Local Dynamic Load Balancing in PDES

引用

32nd 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: (纸本)9781450350921

We present a fine-grained load migration protocol intended for parallel discrete event simulation (PDES) of spatially extended models. Typical models have domains that are fine-grained discretizations of some volume, e.g., a cell, using an irregular three-dimensional mesh, where most events span several voxels. Phenomena of interest in, e.g., cellular biology, are often non-homogeneous and migrate over the simulated domain, making load balancing a crucial part of a successful PDES. Our load migration protocol is local in the sense that it involves only those processors that exchange workload, and does not affect the running parallel simulation. We present a detailed description of the protocol and a thorough proof for its correctness. We combine our protocol with a strategy for deciding when and what load to migrate, which optimizes both for load balancing and inter-processor communication using tunable parameters. Our evaluation shows that the overhead of the load migration protocol is negligible, and that it significantly reduces the number of rollbacks caused by load imbalance. On the other hand, the implementation mechanisms that we added to support fine-grained load balancing incur a significant cost.

关键词： parallel discrete-event simulation PDES Load Balancing Load Migration Load Metric

来源：评论

学校读者我要写书评

暂无评论

Modeling a Leadership-Scale Storage System 1

引用

9th International Conference on parallel Processing and Applied Mathematics (PPAM)

作者： Liu, Ning Carothers, Christopher Cope, Jason Carns, Philip Ross, Robert Crume, Adam Maltzahn, Carlos Rensselaer Polytech Inst Troy NY 12180 USA Argonne Natl Lab Argonne IL 60439 USA Univ Calif Santa Cruz CA 95064 USA

ISBN: (数字)9783642314643

ISBN: (纸本)9783642314636;9783642314643

Exascale supercomputers will have the potential for billion-way parallelism. While physical implementations of these systems are currently not available, HPC system designers can develop models of exascale systems to evaluate system design points. Modeling these systems and associated subsystems is a significant challenge. In this paper, we present the Co-design of Exascale Storage System (CODES) framework for evaluating exascale storage system design points. As part of our early work with CODES, we discuss the use of the CODES framework to simulate leadership-scale storage systems in a tractable amount of time using parallel discrete-event simulation. We describe the current storage system models and protocols included with the CODES framework and demonstrate the use of CODES through simulations of an existing petascale storage system.

关键词： exascale computing storage system design parallel discrete-event simulation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：