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

reverse computation for rollback-based fault tolerance in large parallel systems

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2014年第2期17卷 303-313页

作者： Perumalla, Kalyan S. Park, Alfred J. Oak Ridge Natl Lab Computat Sci & Engn Div Oak Ridge TN 37831 USA

reverse computation is presented here as an important future direction in addressing the challenge of fault tolerant execution on very large cluster platforms for parallel computing. As the scale of parallel jobs increases, traditional checkpointing approaches suffer scalability problems ranging from computational slowdowns to high congestion at the persistent stores for checkpoints. reverse computation can overcome such problems and is also better suited for parallel computing on newer architectures with smaller, cheaper or energy-efficient memories and file systems. Initial evidence for the feasibility of reverse computation in large systems is presented with detailed performance data from a particle (ideal gas) simulation scaling to 65,536 processor cores and 950 accelerators (GPUs). reverse computation is observed to deliver very large gains relative to checkpointing schemes when nodes rely on their host processors/memory to tolerate faults at their accelerators. A comparison between reverse computation and checkpointing with measurements such as cache miss ratios, TLB misses and memory usage indicates that reverse computation is hard to ignore as a future alternative to be pursued in emerging architectures.

关键词： Checkpointing Rollback reverse computation Performance evaluation Parallel Systems Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Optimistic simulations of physical systems using reverse computation

引用

SIMULATION-TRANSACTIONS OF THE SOCIETY FOR MODELING AND SIMULATION INTERNATIONAL 2006年第1期82卷 61-73页

作者： Tang, Yarong Perumalla, Kalyan S. Fujimoto, Richard M. Karimabadi, Homa Driscoll, Jonathan Omelchenko, Yuri Georgia Inst Technol Coll Comp Atlanta GA 30332 USA Oak Ridge Natl Lab Oak Ridge TN 37831 USA SciberQuest Inc Solana Beach CA 92075 USA

Efficient computer simulation of complex physical phenomena has long been challenging due to their multiphysics and multiscale nature. In contrast to traditional time-stepped execution methods, the authors describe an approach using optimistic parallel discrete event simulation (PDES) and reverse computation techniques to execute plasma physics codes. They show that reverse computation-based optimistic parallel execution can significantly reduce the execution time of an example plasma simulation without requiring a significant amount of additional memory compared to conservative execution techniques. The authors describe an application-level reverse computation technique that is efficient and suitable for complex scientific simulations.

关键词： parallel simulation discrete event simulation optimistic simulation reverse computation plasma simulation

来源：评论

学校读者我要写书评

暂无评论

Parallel Discrete Event Simulation of Stochastic Reaction and Diffusion using reverse computation

Parallel Discrete Event Simulation of Stochastic Reaction an...

引用

2015 IEEE International Conference on Smart City/SocialCom/SustainCom (SmartCity)

作者： Lin, Zhongwei Yao, Yiping Natl Univ Def Technol State Key Lab High Performance Comp 17 Yanwachizheng Changsha 410073 Hunan Peoples R China Natl Univ Def Technol Coll Informat Syst & Management Changsha 410073 Hunan Peoples R China

ISBN: (纸本)9781509018932

Parallel discrete event simulation consumes massive memory, involves frequent allocation and deallocation, and generates huge amount of data, which makes the memory usage an important issue for performance. In this paper, we present our reverse computation approach in our multi-threaded parallel discrete event simulator used for large scale stochastic reaction-diffusion simulation. We compute the reverse control code to record what operation an event did on the state of the host Logical Process during forward processing, and undo the operation according to the corresponding code during recovering that event. As the results on two versions of calcium wave model show, the reverse computation version achieved better performance than the state-saving version-it saved about 33% and 36% execution time for the two models respectively when two processing threads were used.

关键词： reverse computation multiple thread performance parallel stochastic simulation

来源：评论

学校读者我要写书评

暂无评论

Parallel vehicular traffic simulation using reverse computation-based optimistic execution 08

Parallel vehicular traffic simulation using reverse computat...

引用

22nd International Workshop on Principles of Advanced and Distributed Simulation

作者： Yoginath, Srikanth B. Perumalla, Kalyan S. Oak Ridge Natl Lab Oak Ridge TN 37831 USA

ISBN: (纸本)9780769531595

Vehicular traffic simulations are useful in applications such as emergency management and homeland security planning tools. High speed of traffic simulations translates directly to speed of response and level of resilience in those applications. Here, a parallel traffic simulation approach is presented that is aimed at reducing the time for simulating emergency vehicular traffic scenarios. Three unique aspects of this effort are: (1) exploration of optimistic simulation applied to vehicular traffic simulation (2) addressing reverse computation challenges speck to optimistic vehicular traffic simulation (3) achieving absolute (as opposed to self-relative) speedup with a sequential speed equal to that of a fast, de facto standard sequential simulator for emergency traffic. The design and development of the parallel simulation system is presented, along with a performance study that demonstrates excellent sequential performance as well as parallel performance.

关键词： Parallel simulation vehicular traffic simulation optimistic simulation discrete event simulation reverse computation

来源：评论

学校读者我要写书评

暂无评论

Anticipation and risk - From the inverse problem to reverse computation

引用

Risk and Decision Analysis 2009年第2期1卷 113-139页

作者： Nadin, Mihai Anté - Institute for Research in Anticipatory Systems University of Texas at Dallas Richardson TX 75080-3021 AT-10 800 West Campbell Road United States

Risk assessment is relevant only if it has predictive relevance. In this sense, the anticipatory perspective has yet to contribute to more adequate predictions. For purely physics-based phenomena, predictions are as good as the science describing such phenomena. For the dynamics of the living, the physics of the matter making up the living is only a partial description of their change over time. The space of possibilities is the missing component, complementary to physics and its associated predictions based on probabilistic methods. The inverse modeling problem, and moreover the reverse computation model guide anticipatory-based predictive methodologies. An experimental setting for the quantification of anticipation is advanced and structural measurement is suggested as a possible mathematics for anticipation-based risk assessment. © 2009 - IOS Press and the authors. All rights reserved.

关键词： Anticipation anticipation scope anticipatory profile inverse problem prediction reverse computation risk structural measurement

来源：评论

学校读者我要写书评

暂无评论

Self-corrective Dynamic Networks via Decentralized reverse computations 14

Self-corrective Dynamic Networks via Decentralized Reverse C...

引用

14th IEEE International Conference on Autonomic Computing (ICAC)

作者： Pournaras, Evangelos Nikolic, Jovan Swiss Fed Inst Technol Computat Social Sci Zurich Switzerland

ISBN: (纸本)9781538617625

The feasibility of large-scale decentralized networks for local computations, as an alternative to big data systems that are often privacy-intrusive, expensive and serve exclusively corporate interests, is usually questioned by network dynamics such as node leaves, failures and rejoins in the network. This is especially the case when decentralized computations performed in a network, such as the estimation of aggregation functions, e.g. summation, are linked to the actual nodes connected in the network, for instance, counting the sum using input values from only connected nodes. reverse computations are required to maintain a high aggregation accuracy when nodes leave or fail. This paper introduces an autonomic agent-based model for highly dynamic self-corrective networks using decentralized reverse computations. The model is generic and equips the nodes with the capability to disseminate connectivity status updates in the network. Highly resilient agents to the dynamic network migrate to remote nodes and orchestrate reverse computations for each node leave or failure. In contrast to related work, no other computational resources or redundancy are introduced. The self-corrective model is experimentally evaluated using real-world data from a smart grid pilot project under highly dynamic network adjustments that correspond to catastrophic events with up to 50% of the nodes leaving the network. The model is highly agile and modular and is applied to the large-scale decentralized aggregation network of DIAS, the Dynamic Intelligent Aggregation Service, without major structural changes in its design and operations. Results confirm the outstanding improvement in the aggregation accuracy when self-corrective actions are employed with a minimal increase in communication overhead.

关键词： self-correction adaptation accuracy reverse computation data analytics decentralized network aggregation agent migration robustness fault-tolerance

来源：评论

学校读者我要写书评

暂无评论

Discrete event modeling and massively parallel execution of epidemic outbreak phenomena

引用

SIMULATION-TRANSACTIONS OF THE SOCIETY FOR MODELING AND SIMULATION INTERNATIONAL 2012年第7期88卷 768-783页

作者： Perumalla, Kalyan S. Seal, Sudip K. Oak Ridge Natl Lab Computat Sci & Engn Div Oak Ridge TN 37831 USA

In complex phenomena such as epidemiological outbreaks, the intensity of inherent feedback effects and the significant role of transients in the dynamics make simulation the only effective method for proactive, reactive or post facto analysis. The spatial scale, runtime speed, and behavioral detail needed in detailed simulations of epidemic outbreaks cannot be supported by sequential or small-scale parallel execution, making it necessary to use large-scale parallel processing. Here, an optimistic parallel execution of a new discrete event formulation of a reaction-diffusion simulation model of epidemic propagation is presented to facilitate a dramatic increase in the fidelity and speed by which epidemiological simulations can be performed. Rollback support needed during optimistic parallel execution is achieved by combining reverse computation with a small amount of incremental state saving. Parallel speedup of over 5,500 and other runtime performance metrics of the system are observed with weak-scaling execution on a small (8,192-core) Blue Gene/P system, while scalability with a weak-scaling speedup of over 10,000 is demonstrated on 65,536 cores of a large Cray XT5 system. Scenarios representing large population sizes, with mobility and detailed state evolution modeled at the level of each individual, exceeding several hundreds of millions of individuals in the largest cases, are successfully exercised to verify model scalability.

关键词： discrete event epidemiology high performance computing reverse computation

来源：评论

学校读者我要写书评

暂无评论

A new framework for the computation of Hessians

引用

OPTIMIZATION METHODS & SOFTWARE 2012年第2期27卷 251-273页

作者： Gower, R. M. Mello, M. P. Univ Estadual Campinas Inst Math Stat & Sci Computat Dept Appl Math Sao Paulo Brazil

We investigate the computation of Hessian matrices via Automatic Differentiation, using a graph model and an algebraic model. The graph model reveals the inherent symmetries involved in calculating the Hessian. The algebraic model, based on Griewank and Walther's [Evaluating derivatives, in Principles and Techniques of Algorithmic Differentiation, 2nd ed., Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 2008] state transformations synthesizes the calculation of the Hessian as a formula. These dual points of view, graphical and algebraic, lead to a new framework for Hessian computation. This is illustrated by developing edge_pushing, a new truly reverse Hessian computation algorithm that fully exploits the Hessian's symmetry. computational experiments compare the performance of edge_pushing on 16 functions from the CUTE collection [I. Bongartz et al. Cute: constrained and unconstrained testing environment, ACM Trans. Math. Softw. 21(1) (1995), pp. 123-160] against two algorithms available as drivers of the software ADOL-C [A. Griewank et al. ADOL-C: A package for the automatic differentiation of algorithms written in C/C++, Technical report, Institute of Scientific Computing, Technical University Dresden, 1999. Updated version of the paper published in ACM Trans. Math. Softw. 22, 1996, pp. 131-167;A. Walther, Computing sparse Hessians with automatic differentiation, ACM Trans. Math. Softw. 34(1) (2008), pp. 1-15;A. H. Gebremedhin et al. Efficient computation of sparse Hessians using coloring and automatic differentiation, INFORMS J. Comput. 21(2) (2009), pp. 209-223], and the results are very promising.

关键词： Hessian matrix automatic differentiation reverse computation sparse matrices

来源：评论

学校读者我要写书评

暂无评论

DETERMINATION OF ORIGINAL SHAPE OF PULSATIONS FROM THEIR SPECTRA

引用

STUDIA GEOPHYSICA ET GEODAETICA 1970年第3期14卷 344-&页

作者： STRESTIK, J Geophysical Institute Czechosl. Acad. Sci. Prague

Zusammenfassung Es wird eine einfache auf der Symmetrie der Grundformeln der Fourierschen Transformation gegründete Methode, wie von den Spektralfunktionen zur ursprünglichen Pulsationsform zu gelangen, beschrieben. Mit dieser Methode wird die durchschnittliche Form der Pi2-Pulsationen konstruiert. Diese idealisierte Pulsation hat dieselben Eigenschaften wie ein statistisches Ensemble von Pulsationen. Der wirkliche Verlauf der Intensität des magnetischen Feldes bei Pi2-Pulsationen wird durch die Methode aus den Induktionsregistrierungen abgeleitet. Die berechnete Kurve zeigt starke Korrelation mit der direkten Registrierung der Intensität des magnetischen Feldes.

关键词： Original Shape Geomagnetic Pulsation reverse computation State Prize Short Contribution

来源：评论

学校读者我要写书评

暂无评论

ROSS: A high-performance, low-memory, modular Time Warp system

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2002年第11期62卷 1648-1669页

作者： Carothers, CD Bauer, D Pearce, S Rensselaer Polytech Inst Dept Comp Sci Troy NY 12180 USA

In this paper, we introduce a new Time Warp system called ROSS: Rensselaer's optimistic simulation system. ROSS is an extremely modular kernel that is capable of achieving event rates as high as 1,250,000 events per second when simulating a wireless telephone network model (PCs) on a quad processor PC server. In a head-to-head comparison, we observe that ROSS out performs the Georgia Tech Time Warp (GTW) system by up to 180% on a quad processor PC server and up to 200% on the SGI Origin 2000. ROSS only requires a small constant amount of memory buffers greater than the amount needed by the sequential simulation for a constant number of processors. ROSS demonstrates for the first time that stable, highly efficient execution using little memory above what the sequential model would require is possible for low-event granularity simulation models. The driving force behind these high-performance and low-memory utilization results is the coupling of an efficient pointer-based implementation framework, Fujimoto's fast GVT algorithm for shared memory multiprocessors, reverse computation and the introduction of kernel processes (KPs). KPs lower fossil collection overheads by aggregating processed event lists. This aspect allows fossil collection to be done with greater frequency, thus lowering the overall memory necessary to sustain stable, efficient parallel execution. These characteristics make ROSS an ideal system for use in large-scale networking simulation models. The principle conclusion drawn from this study is that the performance of an optimistic simulator is largely determined by its memory usage. (C) 2002 Published by Elsevier Science (USA).

关键词： discrete-event simulation parallel simulation Time Warp reverse computation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：