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

Assessing the Impact of Cascading Failures on the Interdomain Routing System of the Internet

New Generation Computing 2014年第3期32卷 237-255页

作者： Liu, Yujing Peng, Wei Su, Jinshu Wang, Zhilin College of Computer National University of Defense Technology Hunan Changsha China College of Computer Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Hunan Changsha China Education Department National University of Defense Technology Hunan Changsha China

The Internet is a typical complex network, whose traffic load is controlled by the inter-domain routing system. Due to the co-location of data plane and control plane of Border Gateway Protocol, the survivability of inter-domain routing system is sensitive to severe congestion. Therefore, an initial outage may lead to a cascade of failures in the Internet. But the cascading failures on links are able to be automatically restored when the congestion is mitigated. In this paper, we propose a model - CAFEIN for characterizing this special process. Based on CAFEIN, we assess the difference of impact under intentional attacks and random breakdowns; identify the worst affected part of the Internet; and study the propagation of cascading failures. Through simulations, we find that the cascading failures bring a great deal of added burden to the routing system. However, the cascading effect is amplified globally when the relative capacity of links is very low. Moreover, the difference of impact between intentional attack and random breakdown is not as prominent as previous research due to the unique automatic-restoration process.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Runtime Verification Based Trace-Oriented Monitoring Framework for Cloud Systems

A Runtime Verification Based Trace-Oriented Monitoring Frame...

引用

IEEE International Conference on Software Reliability Engineering Workshops (ISSRE Wksp)

作者： Jingwen Zhou Zhenbang Chen Ji Wang Zibin Zheng Wei Dong College of Computer National University of Defense Technology Changsha China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China Shenzhen Research Institute The Chinese University of Hong Kong Shenzhen China

Cloud computing provides a new paradigm for resource utilization and sharing. However, the reliability problems, like system failures, often happen in cloud systems and bring enormous loss. Trace-oriented monitoring is an important runtime method to improve the reliability of cloud systems. In this paper, we propose to bring runtime verification into trace-oriented monitoring, to facilitate the specification of monitoring requirements and to improve the efficiency of monitoring cloud systems. Based on a data set collected from a cloud storage system in a real environment, we validate our approach by monitoring the critical properties of the storage system. The preliminary experimental results indicate the promise of our approach.

关键词： Monitoring Runtime Cloud computing Educational institutions Reliability Google Computers

来源：评论

学校读者我要写书评

暂无评论

Data storage optimization of application-level checkpointing on heterogeneous systems

Data storage optimization of application-level checkpointing...

引用

2013 IEEE Conference Anthology, ANTHOLOGY 2013

作者： Jia, Jia Song, Wei National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9781479916603

General purpose GPU's (GPGPU) appearance made it possible that heterogeneous computing can be used by human beings. And it's also produce a reform for GPU's general purpose computing and parallel computing. Heterogeneous Systems has been adopted by large-scale of high-performance computers. Nowadays, fault tolerance technique is necessary among these large-scale kinds of scientific computing, but in a few years of GPGPU and heterogeneous system appearance, there is not an effective fault tolerance method come out, therefore, towards this situation, this paper will apply the traditional fault tolerance technique - application-level checkpointing to heterogeneous system. Cause the main solution of reducing overhead of the application-level checkpointing is reducing checkpoint data size, so after analyzing the heterogeneous system and GPGPU program, we propose a method to optimize the data storage of application-level checkpointing technique and validate its optimization by experiments. © 2013 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Translation Non-negative Matrix Factorization with Fast Optimization

Translation Non-negative Matrix Factorization with Fast Opti...

引用

IEEE International Conference on Systems, Man, and Cybernetics

作者： Yuanyuan Wang Naiyang Guan Bin Mao Xuhui Huang Zhigang Luo Department of Basic Courses Army Officer Academy Science and Technology on Parallel and Distributed Processing Laboratory College of Computer Science National University of Defense Technology College of Science National University of Defense Technology College of Computer Science National University of Defense Technology

ISBN: (纸本)9781479938414

Non-negative matrix factorization (NMF) reconstructs the original samples in a lower dimensional space and has been widely used in pattern recognition and data mining because it usually yields sparse representation. Since NMF leads to unsatisfactory reconstruction for the datasets that contain translations of large magnitude, it is required to develop translation NMF (TNMF) to first remove the translation and then conduct a decomposition. However, existing multiplicative update rule based algorithm for TNMF is not efficient enough. In this paper, we reformulate TNMF and show that it can be efficiently solved by using the state-of-the-art solvers such as NeNMF. Experimental results on face image datasets confirm both efficiency and effectiveness of the reformulated TNMF.

关键词： Non-negative matrix factorization (NMF) Translation transformation NeNMF

来源：评论

学校读者我要写书评

暂无评论

Overlapping community detection via link partition of asymmetric weighted graph

Overlapping community detection via link partition of asymme...

引用

International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)

作者： Wenju Zhang Naiyang Guan Xuhui Huang Zhigang Luo Jianwu Li Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology Changsha Hunan P.R. China 410073 National University of Defense Technology Changsha Hunan CN Beijing Institute of Technology Beijing Beijing CN

Link partition clusters edges of a complex network to discover its overlapping communities. Due to Its effectiveness, link partition has attracted much attentions from the network science community. However, since link partition assigns each edge of a network to unique community, it cannot detect the disjoint communities. To overcome this deficiency, this paper proposes a link partition on asymmetric weighted graph (LPAWG) method for detecting overlapping communities. Particularly, LPAWG divides each edge into two parts to distinguish the roles of connected nodes. This strategy biases edges to a specific node and helps assigning each node to its affiliated community. Since LPAWG introduces more edges than those in the original network, it cannot efficiently detect communities from some networks with relative large amount of edges. We therefore aggregate the line graph of LPAWG to shrink its scale. Experimental results of community detection on both synthetic datasets and the realworld networks show the effectiveness of LPAWG comparing with the representative methods.

关键词： Communities Image edge detection Partitioning algorithms Benchmark testing Acceleration Educational institutions Complex networks

来源：评论

学校读者我要写书评

暂无评论

parallel 3D deterministic particle transport on Intel MIC architecture

Parallel 3D deterministic particle transport on Intel MIC ar...

引用

International Conference on High Performance Computing & Simulation (HPCS)

作者： Qinglin Wang Zuocheng Xing Jie Liu Xiaogang Qiang Chunye Gong Jiang Jiang Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China H.H. Wills Physics Laboratory University of Bristol Bristol UK Science and Technology on Space Physics Libratory Beijing China School of Microelectronics Shanghai Jiao Tong University Shanghai China

Single-node computation speed is essential in large-scale parallel solutions of particle transport problems. The Intel Many Integrated Core (MIC) architecture supports more than 200 hardware threads as well as 512-bit double precision float-point vector operations. In this paper, we use the native model of MIC in the parallelization of the simulation of one energy group time-independent deterministic discrete ordinates particle transport in 3D Cartesian geometry (Sweep3D). The implementation adopts both hardware threads and vector units in MIC to efficiently exploit multi-level parallelism in the discrete ordinates method when keeping good data locality. Our optimized implementation is verified on target MIC and can provide up to 1.99 times speedup based on the original MPI code on Intel Xeon E5-2660 CPU when flux fixup is off. Compared with the prior on NVIDIA Tesla M2050 GPU, the speedup of up to 1.23 times is obtained. In addition, the difference between the implementations on MIC and GPU is discussed as well.

关键词： Computer architecture Microwave integrated circuits Graphics processing units Tin Computational modeling Legged locomotion Equations

来源：评论

学校读者我要写书评

暂无评论

Detecting null dereference with a game

引用

2012 International Conference on Information Technology and Software Engineering, ITSE 2012

作者： Chen, Jie National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology 410073 Changsha China

ISBN: (纸本)9783642345302

As one of the most dangerous and common software vulnerabilities, null dereference often leads to program crashes. In this chapter we propose a human computation method to detect null dereference in a "frog and bug" game. The purpose of the game is to utilize the rich distributed human resource to do the complex science work in a simple and pleasant way. Programs are transformed into visual puzzles first, and then the server collects information from the people playing the game. Finally the recorded metadata is translated back into the positions in the programs where null dereference may happen. The game has shown to be effective. © 2013 Springer-Verlag.

关键词： Computers

来源：评论

学校读者我要写书评

暂无评论

Fault tolerant Lu factorization in transactional memory system

Fault tolerant Lu factorization in transactional memory syst...

引用

2013 IEEE Conference Anthology, ANTHOLOGY 2013

作者： Song, Wei Jia, Jia National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9781479916603

With the popularization of multi-core processors, transaction memory, as a concurrent control mechanism with easy programing and high scalability, has attracted more and more attention. As a result, the reliability problems of transactional memory become a concerning issue. This paper addresses a transactional implementation of the Lu benchmark of SPLASH-2, and proposes a fault-tolerant Lu algorithm for this transactionalize Lu algorithm. The fault-tolerant Lu uses the data-versioning mechanism of the transactional memory system, detects errors based on transactions and recovers the error by rolling back the error transaction. The experiments show that the fault-tolerant Lu can get a better fault tolerance effect under a smaller cost. © 2013 IEEE.

关键词： Errors

来源：评论

学校读者我要写书评

暂无评论

Single image defogging with single and multiple hybrid scattering model

Single image defogging with single and multiple hybrid scatt...

引用

International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)

作者： Weijiang Feng Naiyang Guan Xiang Zhang Xuhui Huang Zhigang Luo Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology Changsha Hunan P.R. China Department of Computer Science and Technology College of Computer National University of Defense Technology Changsha Hunan P.R. China

Image defogging (IDF) removes influences of fogs from an image to improve its quality. Since defogged images can significantly boost the performance of subsequent processing, IDF has attracted many attentions from the computer vision community. However, existing IDF algorithms are built on the assumption that light is scattered once by a grain. Since such assumption is violated if images are contaminated by dense haze or heavy fog, traditional IDF algorithms often fail in this situation. In this paper, we propose a hybrid image defogging (HIDF) algorithm to overcome this deficiency. In particular, HIDF applies the single scattering physics model (SSPM) to pixels dominated by single scattering of light, and applies the multiple scattering physics model (MSPM) to remaining pixels. To distinguish two types of pixels, HIDF utilizes the optical thickness of corresponding pixels. If optical thickness is smaller than a threshold that determines whether the single scattering or the multiple scattering dominates, HIDF applies the SSPM, and HIDF applies the MSPM otherwise. Experimental results on several popular foggy images demonstrate that HIDF competes with the state-of-the-art algorithms, and show the promise of HIDF for defogging heavily foggy images.

关键词： Meteorology Optical imaging Optical scattering Atmospheric modeling Image color analysis

来源：评论

学校读者我要写书评

暂无评论

Continuous probabilistic reverse skyline monitoring over uncertain data streams

Continuous probabilistic reverse skyline monitoring over unc...

引用

2013 International Conference on Vehicle and Mechanical Engineering and Information Technology, VMEIT 2013

作者： Yang, Yong Tao Wang, Yi Jie Guo, Min Li, Xiao Yong National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha Hunan China

ISBN: (纸本)9783037858202

Reverse skyline is useful for supporting many applications, such as marketing decision, environmental monitoring. Since the uncertainty of data is inherent in many scenarios, there is a need for processing probabilistic reverse skyline queries. In this paper, we study the problem of efficiently processing these queries on uncertain data streams. We first show the formal definitions of reverse skyline probability and probabilistic reverse skyline. Then we propose a new algorithm called CPRS to maintain the most recent N uncertain data elements and to process continuous queries on them. CPRS is based on R-tree, and efficient pruning techniques, one of which is based on a new structure named Characteristic Rectangle, are incorporated into it to handling the extra computing complexity arising from the uncertainty of data. Finally, extensive experiments demonstrate that our techniques are very efficient in handling uncertain data streams. © (2013) Trans Tech Publications, Switzerland.

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：