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

International Conference on parallel processing (ICPP)

作者： Feng Wang Hao Jiang Ke Zuo Xing Su Jingling Xue Canqun Yang School of Computer Science National University of Defense Technology Changsha China School of Computer Science and Engineering University of New South Wales NSW Australia Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China

This paper presents the design and implementation of a highly efficient Double-precision General Matrix Multiplication (DGEMM) based on Open BLAS for 64-bit ARMv8 eight-core processors. We adopt a theory-guided approach by first developing a performance model for this architecture and then using it to guide our exploration. The key enabler for a highly efficient DGEMM is a highly-optimized inner kernel GEBP developed in assembly language. We have obtained GEBP by (1) maximizing its compute-to-memory access ratios across all levels of the memory hierarchy in the ARMv8 architecture with its performance-critical block sizes being determined analytically, and (2) optimizing its computations through exploiting loop unrolling, instruction scheduling and software-implemented register rotation and taking advantage of A64 instructions to support efficient FMA operations, data transfers and prefetching. We have compared our DGEMM implemented in Open BLAS with another implemented in ATLAS (also in terms of a highly-optimized GEBP in assembly). Our implementation outperforms the one in ALTAS by improving the peak performance (efficiency) of DGEMM from 3.88 Gflops (80.9%) to 4.19 Gflops (87.2%) on one core and from 30.4 Gflops (79.2%) to 32.7 Gflops (85.3%) on eight cores. These results translate into substantial performance (efficiency) improvements by 7.79% on one core and 7.70% on eight cores. In addition, the efficiency of our implementation on one core is very close to the theoretical upper bound 91.5% obtained from micro-benchmarking. Our parallel implementation achieves good performance and scalability under varying thread counts across a range of matrix sizes evaluated.

关键词： Registers Kernel Computational modeling Program processors Assembly Memory management

来源：评论

学校读者我要写书评

暂无评论

Iaso： an autonomous fault-tolerant management system for supercomputers

引用

Frontiers of Computer science 2014年第3期8卷 378-390页

作者： Kai LU Xiaoping WANG Gen LI Ruibo WANG Wanqing CHI Yongpeng LIU Hongwei TANG Hua FENG Yinghui GAO Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha 410073 China College of Computer National University of Defense Technology Changsha 410073 China ATR Laboratory National University of Defense Technology Changsha 410073 China

With the increase of system scale, the inherent reliability of supercomputers becomes lower and lower. The cost of fault handling and task recovery increases so rapidly that the reliability issue will soon harm the usability of supercomputers. This issue is referred to as the ＂reliability wall＂, which is regarded as a critical problem for current and future supercomputers. To address this problem, we propose an autonomous fault-tolerant system, named Iaso, in MilkyWay- 2 system. Iaso introduces the concept of autonomous management in supercomputers. By autonomous management, the computer itself, rather than manpower, takes charge of the fault management work. Iaso automatically manage the whole lifecycle of faults, including fault detection, fault diagnosis, fault isolation, and task recovery. Iaso endows the autonomous features with MilkyWay-2 system, such as self-awareness, self-diagnosis, self-healing, and self-protection. With the help of Iaso, the cost of fault handling in supercomputers reduces from several hours to a few seconds. Iaso greatly improves the usability and reliability of MilkyWay-2 system.

关键词： supercomputer autonomous management fault tolerant fault management MilkyWay-2 system

来源：评论

学校读者我要写书评

暂无评论

Fast image matching algorithm based on affine invariants

引用

Journal of Central South University 2014年第5期21卷 1907-1918页

作者：张毅卢凯高颖慧 National Laboratory for Parallel and Distributed Processing(National University of Defense Technology) College of Computer National University of Defense Technology College of Electronic Science and Engineering National University of Defense Technology

Feature-based image matching algorithms play an indispensable role in automatic target recognition （ATR）. In this work, a fast image matching algorithm （FIMA） is proposed which utilizes the geometry feature of extended centroid （EC） to build affine invariants. Based on at-fine invariants of the length ratio of two parallel line segments, FIMA overcomes the invalidation problem of the state-of-the-art algorithms based on affine geometry features, and increases the feature diversity of different targets, thus reducing misjudgment rate during recognizing targets. However, it is found that FIMA suffers from the parallelogram contour problem and the coincidence invalidation. An advanced FIMA is designed to cope with these problems. Experiments prove that the proposed algorithms have better robustness for Gaussian noise, gray-scale change, contrast change, illumination and small three-dimensional rotation. Compared with the latest fast image matching algorithms based on geometry features, FIMA reaches the speedup of approximate 1.75 times. Thus, FIMA would be more suitable for actual ATR applications.

关键词： affine invariants image matching extended centroid robustness performance

来源：评论

学校读者我要写书评

暂无评论

Maximizing the information diffusion opportunity in the cyber-physical network

Maximizing the information diffusion opportunity in the cybe...

引用

International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QSHINE)

作者： Hongliang Lu Xuan Dong Wenxiang Li Saohe Lv Xiaodong Wang Wei Chen Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Hunan China School of Information Science and Engineering Wuhan University of Science and Technology Wuhan China Engineering Research Center for Metallurgical Automation and Detecting Technology of Ministry of Education Wuhan University of Science and Technology Wuhan China

ISBN: (纸本)9781479982172

Our daily life is changing by the smart objects, such as smart watches, smart phones etc. They make the cyber world and the physical world integrated by their abundant abilities of sensing, communication and computation etc. Focusing on a wide range of the integrated network, a statistical based strategy was introduced to get a special kind of link between objects, the statistical probability communication link. To get a maximized information spread probability for grouped people, this paper introduced a distributed, yet efficient algorithm naming DMPID algorithm, for finding a sub-network to spread people oriented inforamtion. The DMPID algorithm take the size of the selection and the information spread probability into account, and made a balance between the two parameters. Extended simulation showed that the DMPID algorithm performs well in different distributed networks.

关键词： distributed algorithms probability statistical analysis telecommunication networks DMPID algorithm cyber world cyber-physical network distributed maximizing probability of information diffusion information diffusion opportunity information spread probability statistical probability communication link

来源：评论

学校读者我要写书评

暂无评论

A Novel Design of Flexible Crypto Coprocessor and Its Application

A Novel Design of Flexible Crypto Coprocessor and Its Applic...

引用

10th Annual Conference of Advanced Computer Architecture, ACA 2014

作者： Ni, Shice Dou, Yong Chen, Kai Deng, Lin National Laboratory for Parallel and Distribution Processing National University of Defense Technology Deya Road 109# Changsha 410073 China

ISBN: (纸本)9783662444900

Accelerating security protocols has been a great challenge in general-purpose processor due to the complexity of crypto algorithms. Most crypto algorithms are employed at the function level among different security protocols. We propose a novel flexible crypto coprocessor architecture that relies on Reconfigurable Cryptographic Blocks (RCBs) to achieve a balance between high performance and flexibility and implement the architecture for security application on FPGA. The pipelining technique is adopted to realize parallel data and to reduce the commication costs. We consider several crypto algorithms as examples to illustrate the design of the RCB in the FC Coprocessor. Finally, we create a prototype of the FC coprocessor on a Xilinx XC5VLX330 FPGA chip. The experiment results show that the coprocessor, running at 216 MHz, outperforms the software-based file encryption running on an Intel Core i3 530 CPU at 2.93 GHz by a factor of 29× for typical encrypt application. © Springer-Verlag Berlin Heidelberg 2014.

关键词： Coprocessor

来源：评论

学校读者我要写书评

暂无评论

Constraint-Relaxation Approach for Nonnegative Matrix Factorization: A Case Study

Constraint-Relaxation Approach for Nonnegative Matrix Factor...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Jue Wang Naiyang Guan Xuhui Huang Zhigang Luo Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology Hunan P.R. China Department of Computer Science and Techonoly College of Computer National University of Defense Technology Hunan P.R. China

ISBN: (纸本)9781479986989

Nonnegative matrix factorization (NMF) is a powerful technique for dimensionality reduction. Conventional NMF algorithms usually keep the matrices W and H nonnegative while iterating. However, to get the NMF of a matrix, it's unnecessary to force the temporary solutions in iterations nonnegative. In this paper, we propose a two-staged approach for NMF. At the relaxation stage, the nonnegative constraint of temporary solutions is relaxed and a real valued matrix factorization is generated. At the constraint stage, the real valued matrix factorization is transformed to a nonnegative matrix factorization by an invertible linear transformation. Based on this approach, we study on exact nonnegative matrix factorization when rank=2. We proved that, given two real valued matrices of rank=2, there exists an invertible linear transformation which can transform the real valued matrices to nonnegative matrices with their product stable. We propose an algorithm to find out the transformation. When rank is higher than 2, this kind of transformation may not exist. In the experiments, it's showed that this approach can reach a nonnegative matrix factorization with lower reconstruction error than conventional methods, and the technique for rank=2 exact NMF works well.

关键词： Algorithm design and analysis Matrix decomposition Additives Computers Transforms Matrix converters Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Low-trimming-power design of on-chip optical networks

Low-trimming-power design of on-chip optical networks

引用

Photonic Networks and Devices, 2014

作者： Zhang, Luo Kefie, Wang Zhengbin, Pang Weixia, Xu School of Computer Science National University of Defense Technology Changsha 410073 China National Laboratory for Parallel and Distribution Processing National University of Defense Technology Changsha 410073 China

The trimming power of on-chip optical networks consisted by 105 microrings is simulated. The total trimming power is no larger than 14W from 20°C to 100°C, if the distribution of these rings is optimized. &#... 详细信息

ISBN: (纸本)9781557527370

关键词： Fiber optic networks

来源：评论

学校读者我要写书评

暂无评论

Performance Optimization of a CFD Application on Intel Multicore and Manycore Architectures

Performance Optimization of a CFD Application on Intel Multi...

引用

10th Annual Conference of Advanced Computer Architecture, ACA 2014

作者： Che, Yonggang Zhang, Lilun Wang, Yongxian Xu, Chuanfu Liu, Wei Cheng, Xinghua Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China

ISBN: (纸本)9783662444900

This paper reports our experience optimizing the performance of a high-order and high accurate Computational Fluid Dynamics (CFD) application (HOSTA) on the state of art multicore processor and the emerging Intel Many Integrated Core (MIC) coprocessor. We focus on effective loop vectorization and memory access optimization. A series techniques, including data structure transformations, procedure inlining, compiler SIMDization, OpenMP loop collapsing, and the use of Huge Pages, are explored. Detailed execution time and event counts from Performance Monitoring Units are measured. The results show that our optimizations have improved the performance of HOSTA by 1.61× on a two Intel Sandy Bridge processors based computer node and 1.97× on a Intel Knights Corner coprocessor, the public MIC product. The microarchitecture level effects of these optimizations are also discussed. © Springer-Verlag Berlin Heidelberg 2014.

关键词： Computational fluid dynamics

来源：评论

学校读者我要写书评

暂无评论

DREAMS: Dynamic resource allocation for MapReduce with data skew

DREAMS: Dynamic resource allocation for MapReduce with data ...

引用

IFIP/IEEE International Symposium on Integrated Network Management

作者： Zhihong Liu Qi Zhang Mohamed Faten Zhani Raouf Boutaba Yaping Liu Zhenghu Gong College of Computer National University of Defense Technology Changsha China David R. Cheriton School of Computer Science University of Waterloo Waterloo ON Canada Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha Hunan China

ISBN: (纸本)9781479982424

MapReduce has become a popular model for large-scale data processing in recent years. However, existing MapRe-duce schedulers still suffer from an issue known as partitioning skew, where the output of map tasks is unevenly distributed among reduce tasks. In this paper, we present DREAMS, a framework that provides run-time partitioning skew mitigation. Unlike previous approaches that try to balance the workload of reducers by repartitioning the intermediate data assigned to each reduce task, in DREAMS we cope with partitioning skew by adjusting task run-time resource allocation. We show that our approach allows DREAMS to eliminate the overhead of data repartitioning. Through experiments using both real and synthetic workloads running on a 11-node virtual virtualised Hadoop cluster, we show that DREAMS can effectively mitigate negative impact of partitioning skew, thereby improving job performance by up to 20.3%.

关键词： Resource management Containers Predictive models Mathematical model Monitoring Biomedical monitoring Yarn

来源：评论

学校读者我要写书评

暂无评论

High-energy-density electron beam from interaction of two successive laser pulses with subcritical-density plasma

引用

Physical Review Accelerators and Beams 2016年第2期19卷 021301-021301页

作者： J. W. Wang W. Yu M. Y. Yu H. Xu J. J. Ju S. X. Luan M. Murakami M. Zepf S. Rykovanov Helmholtz Institute Jena Jena 07743 Germany State Key Laboratory of High Field Laser Physics Shanghai Institute of Optics and Fine Mechanics Chinese Academy of Sciences Shanghai 201800 China Institute for Fusion Theory and Simulation and the Department of Physics Zhejiang University Hangzhou 310027 China Institute for Theoretical Physics I Ruhr University Bochum D-44780 Germany National Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha 410073 China Institute of Laser Engineering Osaka University Osaka 565-0871 Japan Centre for Plasma Physics School of Mathematics and Physics Queen’s University Belfast Belfast BT7 1NN United Kingdom

It is shown by particle-in-cell simulations that a narrow electron beam with high energy and charge density can be generated in a subcritical-density plasma by two consecutive laser pulses. Although the first laser pulse dissipates rapidly, the second pulse can propagate for a long distance in the thin wake channel created by the first pulse and can further accelerate the preaccelerated electrons therein. Given that the second pulse also self-focuses, the resulting electron beam has a narrow waist and high charge and energy densities. Such beams are useful for enhancing the target-back space-charge field in target normal sheath acceleration of ions and bremsstrahlung sources, among others.

关键词： Plasma acceleration & new acceleration techniques

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：