High-yield performance-efficient redundancy analysis for 2D memory

High-yield performance-efficient remapping architecture,repairing algorithms and redundancy analysis (HYPERA) are proposed for 2D memory.The proposed hypercube-based memory repair architecture consists of spare row-like subcubes with a modified ternary CAM with an address concentrator and a parallel sorter-like address concentrator.Generally,for an acceptable repair rate about 3% of spare subcubes and no more than 5% of hardware overhead are required. A modified Quine-McCluskey algorithm and the Essential C...     

基于超立方体容错路由算法分析*

基于超立方体的优良的拓扑性质,提出了一个应用于超立方体网络的容错路由算法.该容错路由算法是基于局部信息的,因为路由算法在路由过程中,只需要知道其邻节点的信息,而无须知道其他节点的出错情况.对于给定的源节点和目的节点,路由算法均能够找到一条最优容错路径,并且可以预防死锁.模拟实验结果表明,路由算法所构造的路由路径长度接近于两个节点之间的最优路径长度.     

超立方体系统中基于安全通路向量的容错路由

n维超立方体结构的多处理机系统在并行与分布式处理中具有良好的性能.随着多处理机系统规模的增大,系统出现链路与节点故障的概率也随之增大,因此设计容错性更强的路由算法对n维超立方体结构的多处理机系统具有重要意义.针对系统中存在链路故障的情况,提出了用于记录最优通路的安全通路向量(safety path vectors,简称SPVs)概念,并给出了建立SPVs及其容错路由算法.其中SPVs的赋值可以通过n-1轮邻节点之间的信息交换来完成,且算法中各节点的存储开销仅为n bits,因此,SPVs是安全向量(SVs)与扩展安全向量(ESVs)的一种扩展,具有比SVs和ESVs更好的记录最优通路的能力.另外，与基于最优通路矩阵(optimal path matrices,简称OPMs)及扩展最优通路矩阵(extended optimal path matrices,简称EOPMs)的容错路由算法相比,SPVs呈指数级地降低了算法的存储开销，且能够记录OPMs和EOPMs所不能记录到的最优通路信息.理论分析和仿真实验验证了SPVs的上述性能.     

交叉立方体内顶点不交叉路径长度的研究

Efe提出的交叉立方体（crossed cube）是超立方体（hypercube）的一种变型,其某些性质优于超立方体,比如其直径几乎是超立方体的一半.在高性能的并行计算机系统中,信息是通过若干条结点互不交叉的路径并行传输,并且网络中的结点和链路出错是不可避免的,因此这些路径的长度将直接影响并行计算的性能.本文对交叉立方体的内顶点互不交叉路径进行了研究,证明了以下结论：在n维交叉立方体CQn中任意两顶点u,v间存在n条内顶点互不交叉的路径, 使得（1）最短路的长度=u和v之间的距离, （2）所有路中的最长路径长度≤u和v的距离＋4. 这说明交叉立方体互连网络具有很好的并行通信性能和容错性能.     

Neural network and regression spline value function approximations for stochastic dynamic programming

Dynamic programming is a multi-stage optimization method that is applicable to many problems in engineering. A statistical perspective of value function approximation in high-dimensional, continuous-state stochastic dynamic programming (SDP) was first presented using orthogonal array (OA) experimental designs and multivariate adaptive regression splines (MARS). Given the popularity of artificial neural networks (ANNs) for high-dimensional modeling in engineering, this paper presents an implementation of ANNs as an alternative to MARS. Comparisons consider the differences in methodological objectives, computational complexity, model accuracy, and numerical SDP solutions. Two applications are presented: a nine-dimensional inventory forecasting problem and an eight-dimensional water reservoir problem. Both OAs and OA-based Latin hypercube experimental designs are explored, and OA space-filling quality is considered.     

Refinement strategies for stratified sampling methods

In many computer experiments the adequacy of a given sample to give acceptable statistical estimates cannot be determined a priori, and thus the ability to extend or refine an experimental design may be important. This paper describes refinement strategies for the class of stratified experimental designs such as latin hypercubes, orthogonal arrays, and factorial designs. A few applications are given to demonstrate their usefulness.     

一种基于超立方体的应用层组播协议

提出了一种基于超立方体结构的应用层组播协议-comcast．ComCast协议通过反馈机制实现了可靠组播。并通过建立逻辑连接的方法解决了容错性问题；采用NS2对ComCast协议进行了仿真，并与另外一种基于超立方体的协议HyperCast进行了比较，比较指标包括路径伸展率、链路压力、数据传送率．结果表明，虽然ComCast协议的链路压力较高。但是其路径伸展率较低。同时在节点正常和出错两种情况下都具有较好的数据传送率．     

Summary discussion of the 1996 performance assessment for the Waste Isolation Pilot Plant

The Waste Isolation Pilot Plant (WIPP) is under development by the US Department of Energy (DOE) for the geologic disposal of transuranic waste. The construction of complementary cumulative distribution functions (CCDFs) for total radionuclide release from the WIPP to the accessible environment is described. The resultant CCDFs (i) combine releases due to cuttings and cavings, spallings, direct brine release, and long-term transport in flowing groundwater; (ii) fall substantially to the left of the boundary line specified by the US Environmental Protection Agency's (EPA's) standard 40 CFR 191 for the geologic disposal of radioactive waste; and (iii) constitute an important component of the DOE's successful Compliance Certification Application to the EPA for the WIPP. Insights and perspectives gained in the performance assessment (PA) that led to these CCDFs are described, including the importance of: (i) an iterative approach to PA; (ii) uncertainty and sensitivity analysis; (iii) a clear conceptual model for the analysis; (iv) the separation of stochastic (i.e. aleatory) and subjective (i.e. epistemic) uncertainty; (v) quality assurance procedures; (vi) early involvement of peer reviewers, regulators, and stakeholders; (vii) avoidance of conservative assumptions; and (viii) adequate documentation.     

Assessment methodology for confidence in safety margin for large break loss of coolant accident sequences

Deterministic Safety Analysis and Probabilistic Safety Assessment (PSA) analyses are used to assess the Nuclear Power Plant (NPP) safety. The conventional deterministic analysis is conservative. The best estimate plus uncertainty analysis (BEPU) is increasingly being used for deterministic calculation in NPPs. The PSA methodology integrates information about the postulated accident, plant design, operating practices, component reliability and human behavior. The deterministic and probabilistic methodologies are combined by analyzing the accident sequences within design basis in the event trees of a postulated initiating event (PIE) by BEPU. The peak clad temperature (PCT) distribution provides an insight into the confidence in safety margin for an initiating event.     

Embedding of special classes of circulant networks,hypercubes and generalized Petersen graphs

Hypercubes are a very popular model for parallel computation because of their regularity and the relatively small number of interprocessor connections. In this paper, we present an algorithm for embedding special class of circulant networks into their optimal hypercubes with dilation 2 and prove its correctness. Also, we embed special class of circulant networks into special class of generalized Petersen graphs with dilation 2 and vice versa.