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

Realization and optimization DGEMM on ARMv8 64-bit multi-core processor

Dongbei Daxue Xuebao/Journal of Northeastern University 2014年 35卷 37-43页

作者： Jiang, Hao Wang, Feng Zuo, Ke Li, Kuan Yang, Can-Qun College of Computer Science National University of Defense Technology Changsha410073 China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha410073 China

The double-precision matrix-matrix multiplication (DGEMM) on ARMv8 64-bit multi-core processor architecture was realized and optimized, and the optimal model for the purpose of maximizing the compute-to-memory access ratio was built to design DGEMM kernel. The ARM 64-bit memory accessing instruction, Cache pre-fetching instruction and NEON vector FMA instruction were utilized through instruction reordering and loop unrolling to construct the kernel assembly codes. The blocking and packing algorithms and parallel methods from GotoBLAS (OpenBLAS) were chosen, and the results showed that the floating-point peak efficiency can achieve 82% with one thread and 80% with eight threads, respectively. As the fastest DGEMM implementation on ARMv8 64-bit processor, it improves the peak performance by 8.3% and 16.7% compared to ATLAS. ©, 2014, Northeastern University. All right reserved.

关键词： Digital arithmetic

来源：评论

学校读者我要写书评

暂无评论

Analysis and evaluation method for linpack benchmark

引用

Dongbei Daxue Xuebao/Journal of Northeastern University 2014年 35卷 102-107页

作者： Du, Yun-Fei Yang, Can-Qun Wang, Feng Yi, Hui-Zhan School of Computer National University of Defense Technology Changsha410073 China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha410073 China

The basic algorithm of HPL was introduced. Two optimization methods of communication, i.e., advanced-lookahead and dynamic broadcasting algorithm, were proposed. The performances of the two optimization methods were evaluated on the Tianhe-2 system, and compared with the performance of traditional HPL. The Linpack evaluating methods were discussed, the choice methods of the key parameters affecting the performance were given, and the effect of the high-speed interconnection network on Linpack performance was analyzed. The results showed that the higher the node performance, the greater the effect of the network bandwidth and latency on the performances of HPL. ©, 2014, Northeastern University. All right reserved.

关键词： Large scale systems

来源：评论

学校读者我要写书评

暂无评论

Mining and recommending software features across multiple web repositories 13

Mining and recommending software features across multiple we...

引用

5th Asia-Pacific Symposium on Internetware, Internetware 2013

作者： Yu, Yue Wang, Huaimin Yin, Gang Liu, Bo School of Computer Science National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9781450323697

The Internetware" paradigm is fundamentally changing the traditional way of software development. More and more software projects are developed, maintained and shared on the Internet. However, a large quantity of heterogeneous software resources have not been organized in a reasonable and efficient way. Software feature is an ideal material to characterize software resources. The effectiveness of feature- related tasks will be greatly improved, if a multi-grained feature repository is available. In this paper, we propose a novel approach for organizing, analyzing and recommend- ing software features. Firstly, we construct a Hierarchical rEpository of Software feAture (HESA). Then, we mine the hidden affnities among the features and recommend relevant and high-quality features to stakeholders based on HESA. Finally, we conduct a user study to evaluate our approach quantitatively. The results show that HESA can organize software features in a more reasonable way compared to the traditional and the state-of-the-art approaches. The result of feature recommendation is effective and interesting. Categories and Subject Descriptors D.2.9 [Software Engineering]: Mining Software Reposi- tory;H.3.3 [Information Storage and retrieval]: Fea- ture Model, Clustering, Query formulation General Terms Algorithms, Human Factors.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

HESA: The construction and evaluation of hierarchical software feature repository 25

HESA: The construction and evaluation of hierarchical softwa...

引用

25th International Conference on Software Engineering and Knowledge Engineering, SEKE 2013

作者： Yu, Yue Wang, Huaimin Yin, Gang Li, Xiang Yang, Cheng National Key Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha China

ISBN: (纸本)1891706330

Nowadays, the demand for software resources on different granularity is becoming prominent in software engineering field. However, a large quantity of heterogeneous software resources have not been organized in a reasonable and efficient way. Software features, a kind of important knowledge for software reuse, are ideal materials to characterize software resources. Our preliminary study shows that the effectiveness of feature-related tasks, such as software resource retrieval and feature location, will be greatly improved, if a multi-grained feature repository is available. In this paper, we construct a Hierarchical rEpository of Software feAture (HESA), in which a novel hierarchical clustering approach is proposed. For a given domain, we first aggregate a large number of feature descriptions from multiple online software repositories. Then we cluster these descriptions into a flexible hierarchy by mining their hidden semantic structures. Finally, we implement an online search engine on HESA and conduct a user study to evaluate our approach quantitatively. The results show that HESA can organize software features in a more reasonable way compared to the classic and the state-of-the-art approaches. Copyright © 2013 by Knowledge Systems Institute Graduate School.

关键词： Computer software reusability

来源：评论

学校读者我要写书评

暂无评论

A novel secure inter-domain routing for identifier/locator split network

A novel secure inter-domain routing for identifier/locator s...

引用

2nd International Conference on Information technology and Management Innovation, ICITMI 2013

作者： Liu, Ya Ping Liu, Zhi Hong Ma, Shi Cong Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology China College of Computer National University of Defense Technology China

ISBN: (纸本)9783037858646

With the rapid development of the Internet, the de facto inter-domain routing protocol, Border Gateway Protocol (BGP), has become very vulnerable to many attacks. For this, several secure inter-domain protocols have been proposed, most of which are focus on addressing the issue of faking AS path, but cannot address other issues, such as violating routing policies, reachability attacks and so on. Based on the concept of identifier/locator split and routing isolation, we have proposed a secure identifier-based inter-domain Routing, SIR [1], which can provide control plane security without using the high overhead mechanism. Then, we here optimize SIR and propose another secure inter-domain routing, Optimized SIR (O-SIR), which introduces a checked path table and records the path which has been checked before in each AS. We present the simulations based on the real world datasets CAIDA and compare the performance between SIR and O-SIR by different deployments and different position of attacks. The results show that O-SIR can reduce 18%-45% communication cost of verifying paths with additional below 0.1% routing table size. © (2013) Trans Tech Publications, Switzerland.

关键词： Routing protocols

来源：评论

学校读者我要写书评

暂无评论

An integration framework of cloud computing with wireless sensor networks

An integration framework of cloud computing with wireless se...

引用

7th International Conference on Ubiquitous Information Technologies and Applications, CUTE 2012

作者： You, Pengfei Li, Huiba Peng, Yuxing Li, Ziyang National Key Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology 410073 Changsha China

ISBN: (纸本)9789400758568

Wireless sensor networks (WSN) is a key technology extensively applied in many fields, such as transportation, health-care and environment monitoring. Despite rapid development, the exponentially increasing data emanating from WSN is not efficiently stored and used. Besides, the data from multiple different types and locations of WSN needs to be well analyzed, fused and supplied to various types of clients, such as PC, workstation and smart phone. The emerging cloud computing technology provides scalable data process and storage power and some types of connectable services, which can helpfully utilize sensor data from WSN. In this paper, we propose an integration framework of cloud computing with WSN, in which sensor data is transmitted from WSN to cloud, and processed and stored in cloud, then mined and analyzed so as to be supplied to various clients. By applying virtualization and cloud storage technology, and Infrastructure as a Service (IaaS) and Software as a Service (SaaS) of cloud service model, the framework can fully process and store mass sensor data from multiple types of WSN. Besides, it efficiently mines and analyzes sensor data, based on which the data applications are well supplied to various types of clients in form of services. © 2013 Springer science+Business Media.

关键词： Virtualization

来源：评论

学校读者我要写书评

暂无评论

Resource Allocation with Dynamic Substrate Network in Data Centre Networks

引用

China Communications 2013年第9期10卷 130-142页

作者：李小玲王怀民丁博李小勇刘惠 National Key Laboratory for Parallel and Distributed Processing School of Computer ScienceNational University of Defense Technology

The resource allocation problem in data centre networks refers to a map of the workloads provided by the cloud users/tenants to the Substrate Network(SN)which are provided by the cloud *** studies consider the dynamic arrival and departure of the workloads,while the dynamics of the substrate are *** this paper,we first propose the resource allocation with the dynamic SN,and denote it as ***,we propose an efficient mapping algorithm for *** performance of the proposed algorithm is evaluated by performing simulation *** results show that the proposed algorithm can effectively solve the GraphMap-DS.

关键词： resource allocation data centrenetwork workload substrate algorithm

来源：评论

学校读者我要写书评

暂无评论

Effective top-down active learning for hierarchical text classification

引用

17th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2013

作者： Li, Xiao Ling, Charles X. Wang, Huaimin Department of Computer Science University of Western Ontario Canada National Laboratory for Parallel and Distributed Processing National University of Defense Technology China

ISBN: (纸本)9783642374555

Hierarchical text classification is an important task in many real-world applications. To build an accurate hierarchical classification system with many categories, usually a very large number of documents must be labeled and provided. This can be very costly. Active learning has been shown to effectively reduce the labeling effort in traditional (flat) text classification, but few works have been done in hierarchical text classification due to several challenges. A major challenge is to reduce the so-called out-of-domain queries. Previous state-of-the-art approaches tackle this challenge by simultaneously forming the unlabeled pools on all the categories regardless of the inherited hierarchical dependence of classifiers. In this paper, we propose a novel top-down hierarchical active learning framework, and effective strategies to tackle this and other challenges. With extensive experiments on eight real-world hierarchical text datasets, we demonstrate that our strategies are highly effective, and they outperform the state-of-the-art hierarchical active learning methods by reducing 20% to 40% queries. © Springer-Verlag 2013.

关键词： Text processing

来源：评论

学校读者我要写书评

暂无评论

GPS: A General Framework for Parallel Queries over Data Streams in Cloud

GPS: A General Framework for Parallel Queries over Data Stre...

引用

IEEE International Conference on High Performance Computing and Communications (HPCC)

作者： Xiaoyong Li Yijie Wang Yu Zhao Yuan Wang Xiaoling Li Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha Hunan P. R. China

Parallel query processing over data streams in cloud computing environments has attracted considerable attention recently in various fields, due to the huge potential value of analyzing massive data or big data in a large number of streaming applications. Nevertheless, existing studies on queries primarily focus on the algorithms for the specific query types with the lack of the general framework for processing various queries. Moreover, existing parallel frameworks in cloud such as MapReduce and its variations are not suitable for many complex queries over complex data streams. In this paper, we extensively discuss the problem of designing the general framework for parallel queries over data streams in cloud. Particularly, we propose and implement a framework called GPS, which can be well adapted to various queries over complex data streams like the uncertain data streams. Furthermore, we further propose a hierarchical and general parallel model for queries over data streams based on the proposed framework, which is more flexible than the MapReduce model. The skyline queries over uncertain data streams based on our proposed framework with real deployment are conducted as an example to verify the performances of our proposals.

关键词： Peer-to-peer computing Parallel processing Data models Query processing Global Positioning System Object oriented modeling distributed databases

来源：评论

学校读者我要写书评

暂无评论

Improved algorithm for reconstructing singular connection in multi-block CFD applications

引用

Transactions of Nanjing University of Aeronautics and Astronautics 2013年第SUPPL.1期30卷 51-57页

作者： Wang, Yongxian Zhang, Lilun Che, Yonggang Xu, Chuanfu Liu, Wei Liu, Huayong Wang, Zhenghua College of Computer National University of Defense Technology Changsha 410073 China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha 410073 China State Key Laboratory of Aerodynamics Mianyang 621000 China

An improved algorithm is proposed for the reconstruction of singular connectivity from the available pairwise connections during preprocessing phase. To evaluate the performance of the algorithm, an in-house computational fluid dynamics (CFD) code is used in which high-order finite-difference method for spatial discretization running on the Tianhe-1A supercomputer is employed. Test cases with a varied amount of mesh points are chosen, and the test results indicate that the improved singular connection reconstruction algorithm can achieve a speedup of 2000× at least when compared with the naive search method adopted in the former version of our code. Moreover, the parallel efficiency can benefit from the strategy of local communication based on the algorithm.

关键词： Finite difference method

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：