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

PartialRC: A Partial Recomputing Method for Efficient Fault Recovery on GPGPUs

Journal of computer Science & Technology 2012年第2期27卷 240-255页

作者：徐新海杨学军薛京灵林宇斐林一松 National Laboratory for Parallel and Distributed Processing School of ComputerNational University of Defense Technology Programming Languages and Compilers Group School of Computer Science and Engineering University of New South Wales

GPGPUs are increasingly being used to as performance accelerators for HPC （High Performance Computing） applications in CPU/GPU heterogeneous computing systems, including TianHe-1A, the world＇s fastest supercomputer in the TOP500 list, built at NUDT （National University of Defense Technology） last year. However, despite their performance advantages, GPGPUs do not provide built-in fault-tolerant mechanisms to offer reliability guarantees required by many HPC applications. By analyzing the SIMT （single-instruction, multiple-thread） characteristics of programs running on GPGPUs, we have developed PartialRC, a new checkpoint-based compiler-directed partial recomputing method, for achieving efficient fault recovery by leveraging the phenomenal computing power of GPGPUs. In this paper, we introduce our PartialRC method that recovers from errors detected in a code region by partially re-computing the region, describe a checkpoint-based faulttolerance framework developed on PartialRC, and discuss an implementation on the CUDA platform. Validation using a range of representative CUDA programs on NVIDIA GPGPUs against FullRC （a traditional full-recomputing Checkpoint-Rollback-Restart fault recovery method for CPUs） shows that PartialRC reduces significantly the fault recovery overheads incurred by FullRC, by 73.5% when errors occur earlier during execution and 74.6% when errors occur later on average. In addition, PartialRC also reduces error detection overheads incurred by FullRC during fault recovery while incurring negligible performance overheads when no fault happens.

关键词： GPGPU partial recomputing fault tolerance CUDA checkpointing

来源：评论

学校读者我要写书评

暂无评论

A novel anycast-based integrated routing protocol for wireless sensor networks: Design and implementation

引用

Journal of Computational Information Systems 2013年第21期9卷 8611-8618页

作者： Yan, Guofeng Peng, Yuxing Chen, Shuhong School of Computer and Communication Hunan Institute of Engineering China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha 410073 China School of Computer National University of Defense Technology Changsha 410073 China School of Information Science and Engineering Central South University Changsha 410083 China

In this paper, we consider novel anycast-based integrated routing protocol (AIRP) to reduce the cost in delay performance of communications in multihop WSNs. Without tight time synchronization or known geographic information, AIRP provides low-delay cost route. We implement a low-overhead AIRP module in TinyOS kernel by modifying BLIP protocol stack, i. e., the Berkeley Low-power IP stack;as demonstrated, this implementation can be incorporated into existing routing protocols with the least effort. We describe the format of AIRP message, the dynamic updating process of MAP table information, and anycast data flow in detail under TinyOS. And then, we present the anycast group management system. Finally, we show the performance of AIRP where AIRP communication is used to distribute load among a set of servers through a study case. © 2013 Binary Information Press.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Orthogonal Nonnegative Locally Linear Embedding

Orthogonal Nonnegative Locally Linear Embedding

引用

IEEE International Conference on Systems, Man, and Cybernetics

作者： Lei Wei Naiyang Guan Xiang Zhang Zhigang Luo Dacheng Tao National Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha 410073 P.R. China These authors contributed equally to this paper National Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha 410073 P.R. China Centre for Quantum Computation and Intelligence Systems and Faculty of Engineering and Information Technology University of Technology Sydney Sydney NSW 2007 Australia

ISBN: (纸本)9781479906505

Nonnegative matrix factorization (NMF) decomposes a nonnegative dataset X into two low-rank nonnegative factor matrices, i.e., W and H, by minimizing either Kullback-Leibler (KL) divergence or Euclidean distance between X and WH. NMF has been widely used in pattern recognition, data mining and computer vision because the non-negativity constraints on both W and H usually yield intuitive parts-based representation. However, NMF suffers from two problems: 1) it ignores geometric structure of dataset, and 2) it does not explicitly guarantee partsbased representation on any datasets. In this paper, we propose an orthogonal nonnegative locally linear embedding (ONLLE) method to overcome aforementioned problems. ONLLE assumes that each example embeds in its nearest neighbors and keeps such relationship in the learned subspace to preserve geometric structure of a dataset. For the purpose of learning parts-based representation, ONLLE explicitly incorporates an orthogonality constraint on the learned basis to keep its spatial locality. To optimize ONLLE, we applied an efficient fast gradient descent (FGD) method on Stiefel manifold which accelerates the popular multiplicative update rule (MUR). The experimental results on real-world datasets show that FGD converges much faster than MUR. To evaluate the effectiveness of ONLLE, we conduct both face recognition and image clustering on real-world datasets by comparing with the representative NMF methods.

关键词： Nonnegative matrix factorization Locally linear embedding Fast gradient descent Stiefel manifold Dataset Nonnegative matrix decomposition geometrical construction NMF protocol images embedding Flue gas desulfurization Nearest neighbor Orthogonal

来源：评论

学校读者我要写书评

暂无评论

Recent advances on trusted computing in China

引用

Chinese Science Bulletin 2012年第35期57卷 4529-4532页

作者： DONG Wei CHEN LiQian School of Computer National University of Defense TechnologyChangsha 410073China National Laboratory for Parallel and Distributed Processing Changsha 410073China

This article highlights some recent research advances on trusted computing in China,focusing mainly on the methodologies and technologies related to trusted computing module,trusted computing platform,trusted network ... 详细信息

关键词：可信计算平台中国计算模块网络连接软件

来源：评论

学校读者我要写书评

暂无评论

Accurate and simplified prediction of L2 cache vulnerability for cost-efficient soft error protection

Accurate and simplified prediction of L2 cache vulnerability...

引用

作者： Cheng, Yu Ma, Anguo Zhang, Minxuan National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology China

Soft errors caused by energetic particle strikes in on-chip cache memories have become a critical challenge for microprocessor design. Architectural vulnerability factor (AVF), which is defined as the probability that a transient fault in the structure would result in a visible error in the final output of a program, has been widely employed for accurate soft error rate estimation. Recent studies have found that designing soft error protection techniques with the awareness of AVF is greatly helpful to achieve a tradeoff between performance and reliability for several structures (i.e., issue queue, reorder buffer). Considering large on-chip L2 cache, redundancy-based protection techniques (such as ECC) have been widely employed for L2 cache data integrity with high costs. Protecting caches without accurate knowledge of the vulnerability characteristics may lead to the over-protection, thus incurring high overheads. Therefore, designing AVF-aware protection techniques would be attractive for designers to achieve a cost-efficient protection for caches, especially at early design stage. In this paper, we propose an improved AVF estimation framework for conducing comprehensive characterization of dynamic behavior and predictability of L2 cache vulnerability. We propose to employ Bayesian Additive Regression Trees (BART) method to accurately model the variation of L2 cache AVF and to quantitatively explain the important effects of several key performance metrics on L2 cache AVF. Then we employ bump hunting technique to extract some simple selecting rules based on several key performance metrics for a simplified and fast estimation of L2 cache AVF. Using the simplified L2 cache AVF estimator, we develop an AVF-aware ECC technique as an example to demonstrate the cost-efficient advantages of the AVF prediction based dynamic fault tolerant techniques. Experimental results show that compared with traditional full ECC technique, AVF-aware ECC technique reduces the L2 cache acc

关键词： Cache memory

来源：评论

学校读者我要写书评

暂无评论

A logistic regression model for Semantic Web service matchmaking

引用

Science China(Information Sciences) 2012年第7期55卷 1715-1720页

作者： WEI DengPing 1 ,WANG Ting 1 & WANG Ji 2 1 school of computer,National University of Defense Technology,Changsha 410073,China 2 National laboratory for parallel and distributed processing,Changsha 410073,China 1. School of Computer National University of Defense Technology Changsha 410073 China2. National Laboratory for Parallel and Distributed Processing Changsha 410073 China

Semantic Web service matchmaking,as one of the most challenging problems in Semantic Web services (SWS),aims to filter and rank a set of services with respect to a service query by using a certain matching *** this paper,we propose a logistic regression based method to aggregate several matching strategies instead of a fixed integration (e.g.,the weighted sum) for SWS *** logistic regression model is trained on training data derived from binary relevance assessments of existing test collections,and then used to predict the probability of relevance between a new pair of query and service according to their matching values obtained from various matching *** are then ranked according to the probabilities of relevance with respect to each *** method is evaluated on two main test collections,SAWSDL-TC2 and Jena Geography Dataset(JGD).Experimental results show that the logistic regression model can effectively predict the relevance between a query and a service,and hence can improve the effectiveness of service matchmaking.

关键词： Semantic Web service matchmaking logistic regression

来源：评论

学校读者我要写书评

暂无评论

Workload-awared HPC system scalability analysis based on electronic technology developing

Workload-awared HPC system scalability analysis based on ele...

引用

2012 International Conference on Mechanical and Electronic Engineering, ICMEE 2012

作者： Lin, Yufei Tang, Yuhua Zhang, Xin National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9783642315152

As the electronic technology develops, the integration levels of CPUs and memories keep growing, and the speeds of communication devices are improved. The high-performance computing (HPC) systems consist of processing nodes and communication network, and their sizes are advanced by the development of electronic technology. Then the scalability of a large-scale parallel computing system, i.e. whether the computing performance is increased with the system size, becomes a major goal pursued by designers of parallel algorithms and high-performance parallel machines. parallel speedup is a popular way to measure the scalability. This paper proposes the definition of HPC system scalability based on speedup first, and then analyzes the influence of function G(P), which describes how the workload changes with processor number, on the system scalability. Through case studies, we analyze some typical programs based on our scalability theorems and the results show that our analysis approach is correct. © 2012 Springer-Verlag Berlin Heidelberg.

关键词： Scalability

来源：评论

学校读者我要写书评

暂无评论

UCBench: A user-centric benchmark suite for C code static analyzers

UCBench: A user-centric benchmark suite for C code static an...

引用

2012 IEEE International Conference on Information Science and Technology, ICIST 2012

作者： Liu, Jiangchao Chen, Liqian Dong, Longming Wang, Ji National Laboratory for Parallel and Distributed Processing School of Computer National University of Defence Technology Changsha China

ISBN: (纸本)9781457703454

In recent years, many C code static analyzers, with different abilities of bug detection, have appeared and been applied in various domains. There are so many choices that it becomes hard for programmers to know in detail the strengths as well as limitations of all these analyzers and to find the most suitable ones for their code. In this paper, we propose a benchmark for C code static analyzers, named UCBench, to provide quantitative and qualitative measurements for evaluating analyzers. Being different from other benchmarks, UCBench concentrates more on users' requirements rather than the improvements of bug detecting technique itself. The major components of UCBench include test case database, evaluation metrics and harness. We classify test cases into several groups according to their attributes and design various user-centric evaluation metrics. Besides, we develop some harness to automate the evaluation process. Finally, we demonstrate our benchmark suite over four C code static analyzers: Flawfinder, Cppcheck, Uno and Splint. © 2012 IEEE.

关键词： C (programming language)

来源：评论

学校读者我要写书评

暂无评论

Checkpoint selection in fault recovery based on byzantine fault model 4th

Checkpoint selection in fault recovery based on byzantine fa...

引用

4th International Conference on Computational Intelligence and Communication Networks, CICN 2012

作者： Xu, Xinhai Lin, Yufei National Laboratory for Parallel and Distributed Processing Computer School National University of Defense Technology Changsha Hunan China

ISBN: (纸本)9781467329811

Nowadays, with the growth of the performance, the reliability problem of supercomputers becomes more and more serious. In order to complete an application with small fault recovery overhead, Checkpoint/Restart(C/R) methods are widely used. So far, the mainstream C/R methods are either based on Fail-Stop fault model or making the system(or program) do error detection before storing checkpoints, so they can ensure the correctness of every checkpoint. However, the faults occurring in the systems in real world are more accordant with the Byzantine fault model, and in order to pursue the higher practical performance, neither the system nor the program implements any fault detection mechanism. Consequently, there may be errors in the checkpoints. This paper studies the checkpoint selection problem that which checkpoint should be selected as the object of rolling back after system occurring failure, based on Byzantine fault model. We design a framework of checkpoint selection, and then, based on it, propose three checkpoint selection strategies: conservative strategy, aggressive strategy and statistical strategy. The simulation results show that: the conservative strategy shows its superiority when the error latent period is long, while the aggressive strategy behaves oppositely, the statistical strategy has a stable efficiency, only 50% more overhead compared to the ideal checkpoint selection when the checkpoint period is the half of mean time between faults. © 2012 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

SMP-SIM: An event-driven performance simulator for SMP

SMP-SIM: An event-driven performance simulator for SMP

引用

2012 International Conference on Systems and Informatics, ICSAI 2012

作者： Zhang, Xin Tang, Yuhua Lin, Yufei Xu, Xinhai Guo, Xiaowei Ren, Xiaoguang National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha Hunan China

ISBN: (纸本)9781467301992

Performance prediction for the high performance computer system is of great importance for designing, implementing, and optimizing system. As a widely used technique for predicting performance, simulation method attracts more and more attention from the research community. Based on analyzing the problems in the current performance simulation techniques, we present a key idea of the performance simulator for SMP system based on event-driven. We propose the framework of SMP-SIM and implement it based on MPICH2. The simulation results show that, our simulation technique has the advantages of high accuracy and simulation performance. © 2012 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：