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

29th IEEE International Parallel and Distributed Processing Symposium (IPDPS)

作者： Strazdins, Peter E. Ali, Md Mohsin Harding, Brendan Australian Natl Univ Res Sch Comp Sci Canberra ACT Australia Australian Natl Univ Inst Math Sci Canberra ACT Australia

ISBN: (纸本)9781467376846

Many petascale and exascale scientific simulations involve the time evolution of systems modelled as Partial Differential Equations (PDEs). The sparse grid combination technique (SGCT) is a cost-effective method for solve time-evolving PDEs, especially for higher-dimensional problems. It consists of evolving PDE over a set of grids of differing resolution in each dimension, and then combining the results to approximate the solution of the PDE on a grid of high resolution in all dimensions. It can also be extended to support algorithmic-based fault-tolerance, which is also important for computations at this scale. In this paper, we present two new parallel algorithms for the SGCT that supports the full distributed memory parallelization over the dimensions of the component grids, as well as over the grids as well. The direct algorithm is so called because it directly implements a SGCT combination formula. The second algorithm converts each component grid into their hierarchical surpluses, and then uses the direct algorithm on each of the hierarchical surpluses. The conversion to/from the hierarchical surpluses is also an important algorithm in its own right. An analysis of both indicates the direct algorithm minimizes the number of messages, whereas the hierarchical surplus minimizes memory consumption and offers a reduction in bandwidth by a factor of 1-2-d, where d is the dimensionality of the SGCT. However, this is offset by its incomplete parallelism and factor of two load imbalance in practical scenarios. Our analysis also indicates both are suitable in a bandwidth-limiting regime. Experimental results including the strong and weak scalability of the algorithms indicates that, for scenarios of practical interest, both are sufficiently scalable to support large-scale SGCT but the direct algorithm has generally better performance, to within a factor of 2. Hierarchical surplus formation is much less communication intensive, but shows less scalability with increasin

关键词： high performance computing parallel computing PDE solvers sparse grid combination technique algorithm-based fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Combining backward and forward recovery to cope with silent errors in iterative solvers 29

Combining backward and forward recovery to cope with silent ...

引用

29th IEEE International Parallel and Distributed Processing Symposium (IPDPS)

作者： Fasi, Massimiliano Robert, Yves Ucar, Bora Ecole Normale Super Lyon Lyon France CNRS F-75700 Paris France INRIA Rocquencourt France Univ Bologna I-40126 Bologna Italy Univ Knoxville Knoxville TN USA

ISBN: (纸本)9781467376846

Several recent papers have introduced a periodic verification mechanism to detect silent errors in iterative solvers. Chen [PPoPP' 13, pp. 167-176] has shown how to combine such a verification mechanism (a stability test checking the orthogonality of two vectors and recomputing the residual) with checkpointing: the idea is to verify every d iterations, and to checkpoint every c x d iterations. When a silent error is detected by the verification mechanism, one can rollback to, and re-execute from, the last checkpoint. In this paper, we also propose to combine checkpointing and verification, but we use ABFT rather than stability tests. ABFT can be used for error detection, but also for error detection and correction, allowing a forward recovery (and no rollback nor re-execution) when a single error is detected. We introduce an abstract performance model to compute the performance of all schemes, and we instantiate it using the Conjugate Gradient algorithm. Finally, we validate our new approach through a set of simulations.

关键词： fault-tolerance Silent errors algorithm-based fault tolerance Checkpointing Sparse matrix-vector multiplication Performance model

来源：评论

学校读者我要写书评

暂无评论

Failure Mitigation in Linear, Sesquilinear and Bijective Operations On Integer Data Streams Via Numerical Entanglement 21

Failure Mitigation in Linear, Sesquilinear and Bijective Ope...

引用

21st IEEE International On-Line Testing Symposium (IOLTS)

作者： Anam, Mohammad Ashraful Andreopoulos, Yiannis UCL Dept Elect & Elect Engn Roberts BldgTorrington Pl London WC1E 7JE England

ISBN: (纸本)9781467379052

A new roll-forward technique is proposed that recovers from any single fail-stop failure in M integer data streams (M >= 3) when undergoing linear, sesquilinear or bijective (LSB) operations, such as: scaling, additions/subtractions, inner or outer vector products and permutations. In the proposed approach, the M input integer data streams are linearly superimposed to form M numerically entangled integer data streams that are stored in-place of the original inputs. A series of LSB operations can then be performed directly using these entangled data streams. The output results can be extracted from any M - 1 entangled output streams by additions and arithmetic shifts, thereby guaranteeing robustness to a fail-stop failure in any single stream computation. Importantly, unlike other methods, the number of operations required for the entanglement, extraction and recovery of the results is linearly related to the number of the inputs and does not depend on the complexity of the performed LSB operations. We have validated our proposal in an Intel processor (Haswell architecture with AVX2 support) via convolution operations. Our analysis and experiments reveal that the proposed approach incurs only 1.8% to 2.8% reduction in processing throughput in comparison to the failure-intolerant approach. This overhead is 9 to 14 times smaller than that of the equivalent checksum-based method. Thus, our proposal can be used in distributed systems and unreliable processor hardware, or safety-critical applications, where robustness against fail-stop failures becomes a necessity.

关键词： linear operations sum-of-products algorithm-based fault tolerance fail-stop failure numerical entanglement

来源：评论

学校读者我要写书评

暂无评论

Correcting DFT Codes with a Modified Berlekamp-Massey algorithm and Kalman Recursive Syndrome Extension

引用

IEEE TRANSACTIONS ON COMPUTERS 2014年第1期63卷 196-203页

作者： Redinbo, G. Robert Univ Calif Davis Dept Elect & Comp Engn Davis CA 95616 USA

Real number block codes derived from the discrete Fourier transform (DFT) are corrected by coupling a very modified Berlekamp-Massey (BM) algorithm with a syndrome extension process. The modified BM algorithm determines recursively the locations of any large errors whose number is within the capability of the DFT code. It evolves a connection polynomial which is changed when a discrepancy is above a threshold which is adjusted during each iteration. The large error locations are repositioned to exact location indices to combat low-level noise effects. The syndromes are extended using the refined connection polynomial taps. Alternately, enhanced extension recursions based on Kalman syndrome extensions are developed and simulated.

关键词： algorithm-based fault tolerance discrete Fourier transform codes Berlekamp-Massey algorithm Kalman estimation syndrome extensions

来源：评论

学校读者我要写书评

暂无评论

algorithm-based fault tolerance for Fail-Stop Failures

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2008年第12期19卷 1628-1641页

作者： Chen, Zizhong Dongarra, Jack Colorado Sch Mines Dept Math & Comp Sci Golden CO 80401 USA Univ Tennessee Dept Elect Engn & Comp Sci Knoxville TN 37996 USA

Fail-stop failures in distributed environments are often tolerated by checkpointing or message logging. In this paper, we show that fail-stop process failures in ScaLAPACK matrix-matrix multiplication kernel can be tolerated without checkpointing or message logging. It has been proved in the previous algorithm-based fault tolerance research that, for matrix-matrix multiplication, the checksum relationship in the input checksum matrices is preserved at the end of the computation no matter which algorithm is chosen. From this checksum relationship in the final computation results, processor miscalculations can be detected, located, and corrected at the end of the computation. However, whether this checksum relationship in the input checksum matrices can be maintained in the middle of the computation or not remains open. In this paper, we first demonstrate that, for many matrix-matrix multiplication algorithms, the checksum relationship in the input checksum matrices is not maintained in the middle of the computation. We then prove that, however, for the outer product version matrix-matrix multiplication algorithm, the checksum relationship in the input checksum matrices can be maintained in the middle of the computation. based on this checksum relationship maintained in the middle of the computation, we demonstrate that fail-stop process failures in ScaLAPACK matrix-matrix multiplication can be tolerated without checkpointing or message logging. Because no periodical checkpointing is involved, the fault tolerance overhead for this approach is surprisingly low.

关键词： algorithm-based fault tolerance checkpointing fail-stop failures parallel matrix-matrix multiplication ScaLAPACK

来源：评论

学校读者我要写书评

暂无评论

Supporting the Development of Resilient Message Passing Applications using Simulation

Supporting the Development of Resilient Message Passing Appl...

引用

22nd Euromicro International Conference on Parallel, Distributed, and Network-based Processing (PDP)

作者： Naughton, Thomas Engelmann, Christian Vallee, Geoffroy Boehm, Swen Oak Ridge Natl Lab Comp Sci & Math Div Oak Ridge TN 37831 USA

ISBN: (纸本)9781479927289

An emerging aspect of high-performance computing (HPC) hardware/software co-design is investigating performance under failure. The work in this paper extends the Extreme-scale Simulator (xSim), which was designed for evaluating the performance of message passing interface (MPI) applications on future HPC architectures, with fault-tolerant MPI extensions proposed by the MPI fault tolerance Working Group. xSim permits running MPI applications with millions of concurrent MPI ranks, while observing application performance in a simulated extreme-scale system using a lightweight parallel discrete event simulation. The newly added features offer user-level failure mitigation (ULFM) extensions at the simulated MPI layer to support algorithm-based fault tolerance (ABFT). The presented solution permits investigating performance under failure and failure handling of ABFT solutions. The newly enhanced xSim is the very first performance tool that supports ULFM and ABFT.

关键词： High-performance Computing Message Passing Interface algorithm-based fault tolerance Parallel Discrete Event Simulation Performance Prediction

来源：评论

学校读者我要写书评

暂无评论

Reducing Overheads for fault-tolerant Datapaths with Dynamic Partial Reconfiguration 22

Reducing Overheads for Fault-tolerant Datapaths with Dynamic...

引用

22nd IEEE Annual International Symposium on Field-Programmable Custom Computing Machines ((FCCM)

作者： Davis, James J. Cheung, Peter Y. K. Imperial Coll London Dept Elect & Elect Engn London SW7 2AZ England

ISBN: (纸本)9781479951116

As process scaling and transistor count inflation continue, silicon chips are becoming increasingly susceptible to faults. Although FPGAs are particularly vulnerable to these effects, their runtime reconfigurability offers unique opportunities for fault tolerance. This work presents an application combining algorithmic-level error detection with dynamic partial reconfiguration (DPR) to allow faults manifested within its datapath at runtime to be circumvented at low cost.

关键词： Circuit faults fault tolerance fault tolerant systems Field programmable gate arrays Hardware Heuristic algorithms Runtime algorithm-based fault tolerance dynamic partial reconfiguration error recovery fault-tolerant hardware accelerators matrix multiplication fault tolerance Field programmable gate arrays Runtime fault tolerant systems Circuit faults system recovery Matrix multiplication Heuristic algorithms Computer hardware dynamic reconfiguration Reconfiguration

来源：评论

学校读者我要写书评

暂无评论

On-line soft error correction in matrix-matrix multiplication

引用

JOURNAL OF COMPUTATIONAL SCIENCE 2013年第6期4卷 465-472页

作者： Wu, Panruo Ding, Chong Chen, Longxiang Davies, Teresa Karlsson, Christer Chen, Zizhong Colorado Sch Mines Dept Elect Engn & Comp Sci Golden CO 80401 USA Univ Calif Riverside Dept Comp Sci & Engn Riverside CA 92521 USA

Soft errors are one-time events that corrupt the state of a computing system but not its overall functionality. Soft errors normally do not interrupt the execution of the affected program, but the affected computation results cannot be trusted any more. A well known technique to correct soft errors in matrix-matrix multiplication is algorithm-based fault tolerance (ABFT). While ABET achieves much better efficiency than triple modular redundancy (TMR) - a traditional general technique to correct soft errors, both ABFT and TMR detect errors off-line after the computation is finished. This paper extends the traditional ABET technique from off-line to on-line so that soft errors in matrix-matrix multiplication can be detected in the middle of the computation during the program execution and higher efficiency can be achieved by correcting the corrupted computations in a timely manner. Experimental results demonstrate that the proposed technique can correct one error every ten seconds with negligible (i.e. less than 1%) performance penalty over the ATLAS dgemm (). (C) 2013 Elsevier B.V. All rights reserved.

关键词： algorithm-based fault tolerance Matrix multiplication fault tolerant linear algebra On-line algorithm based fault tolerance

来源：评论

学校读者我要写书评

暂无评论

A Case Study of Designing Efficient algorithm-based fault Tolerant Application for Exascale Parallelism

A Case Study of Designing Efficient Algorithm-based Fault To...

引用

26th IEEE International Parallel and Distributed Processing Symposium (IPDPS) / Workshop on High Performance Data Intensive Computing

作者： Yao, Erlin Wang, Rui Chen, Mingyu Tan, Guangming Sun, Ninghui Chinese Acad Sci Inst Comp Technol State Key Lab Comp Architecture Beijing Peoples R China

ISBN: (纸本)9780769546759

fault tolerance overhead of high performance computing (HPC) applications is becoming critical to the efficient utilization of HPC systems at large scale. Today's HPC applications typically tolerate fail-stop failures by checkpointing. However, checkpointing will lose its efficiency when system becoming very large. An alternative method is algorithm-based fault recovery which has been proved to be more efficient than checkpointing. In this paper, we first point out by theoretical analysis that algorithm-based fault recovery will also lose its efficiency when systems scale up to Exaflops. Then, a more efficient algorithm-based fault tolerance scheme for HPC applications at large scale is presented. The new method has two novel skills. One is algorithm-based hot replacement, which avoids the stop-and-wait time after failure. Second is background accelerated recovery, which guarantees the system to endure multiple failures in succession. As a case study, this method is incorporated to High Performance Linpack (HPL). Theoretical analysis shows that the fault tolerance overhead can be reduced to 2/log(2)(p) of that of algorithm-based fault recovery method (p is the number of computation processes), so that the new method will still be efficient in Exascale. Experimental results for up to 1800 processes show that the overhead of the new method is about 25% of that of algorithm-based fault recovery method, which is close to the theoretical prediction.

关键词： Exascale algorithm-based fault tolerance High Performance Linpack

来源：评论

学校读者我要写书评

暂无评论

Correcting DFT Codes with Modified Berlekamp-Massey algorithm and Syndrome Extension

Correcting DFT Codes with Modified Berlekamp-Massey Algorith...

引用

17th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC)

作者： Redinbo, Robert Univ Calif Davis ECE Dept Davis CA 95616 USA

Real number block codes derived from the discrete Fourier transform (DFT) are corrected by coupling a very modified Berlekamp-Massey algorithm with a syndrome extension process. Enhanced extension recursions based on ... 详细信息

ISBN: (纸本)9780769545905

关键词： algorithm-based fault tolerance Discrete Fourier Transform Codes Berlekamp-Massey algorithm Kalman Estimation Syndrome Extensions

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：