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

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

作者： Dong Chen Changqing Xun Dafei Huang Mei Wen Chunyuan Zhang National Key Laboratory of Parallel and Distributed Processing

In this paper, we propose a framework to automatically map single-device OpenCL programs to heterogeneous multi-device platforms with performance concerns. Our framework is based on the independence of work groups which built inside the OpenCL programming model and relies heavily on the knowledge of global memory access regions of work groups. So global memory access patterns of work groups are analyzed and an abstract representation CCRwS is designed to describe the exact memory access regions of each memory access statement in the kernels. A global memory access analyzer is designed to get CCRwSs by performing static program analysis on kernel codes. Based on CCRwSs, data transfer between multiple devices and host can be fully controlled by our framework. Then a kernel code regenerator is designed to distribute the workload and perform architecture specific optimizations by code transformation. Then we tested our framework on a platform with 2 Intel E5-2650 CPUs and 4 NVIDIA Tesla C2050 GPUs. Compared with the performance on single GPU, the kernels running on all the 6 devices can achieve about 4.5x faster.

关键词： Kernel Indexes Performance evaluation Benchmark testing Abstracts Optimization Computer architecture

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Approximate Maximum Common Sub-graph Isomorphism Based on Discrete-Time Quantum Walk

Approximate Maximum Common Sub-graph Isomorphism Based on Di...

引用

International Conference on Pattern Recognition

作者： Kai Lu Yi Zhang Kai Xu Yinghui Gao Richard C. Wilson Science and Technology on Parallel and Distributed Processing Laboratory and College of Computer National University of Defense Technology Changsha P.R. China College of Electronic Science and Engineering National University of Defense Technology Changsha P.R. China Department of Computer Science University of York York UK

Maximum common sub-graph isomorphism (MCS) is a famous NP-hard problem in graph processing. The problem has found application in many areas where the similarity of graphs is important, for example in scene matching, video indexing, chemical similarity and shape analysis. In this paper, a novel algorithm Qwalk is proposed for approximate MCS, utilizing the discrete-time quantum walk. Based on the new observation that isomorphic neighborhood group matches can be detected quickly and conveniently by the destructive interference of a quantum walk, the new algorithm locates an approximate solution via merging neighborhood groups. Experiments show that Qwalk has better accuracy, universality and robustness compared with the state-of-the-art approximate MCS methods. Meanwhile, Qwalk is a general algorithm to solve the MCS problem approximately while having modest time complexity.

关键词： Approximation algorithms Interference Algorithm design and analysis Accuracy Time complexity Quantum computing Noise

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Trace Bench: An Open Data Set for Trace-Oriented Monitoring

Trace Bench: An Open Data Set for Trace-Oriented Monitoring

引用

IEEE International Conference on Cloud Computing Technology and Science (CloudCom)

作者： Jingwen Zhou Zhenbang Chen Ji Wang Zibin Zheng Michael R. Lyu 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 Department of Computer Science and Engineering The Chinese University of Hong Kong Hong Kong China

User request trace-oriented monitoring is an effective method to improve the reliability of cloud systems. However, there are some difficulties in getting traces in practice, which hinder the development of trace-oriented monitoring research. In this paper, we release a fine-grained user request-centric open trace data set, called Trace Bench, collected on a real world cloud storage system deployed in a real environment. During collecting, many aspects are considered to simulate different scenarios, including cluster size, request type, workload speed, etc. Besides recording the traces when the monitored system is running normally, we also collect the traces under the situation with faults injected. With a mature injection tool, 14 faults are introduced, including function faults and performance faults. The traces in Trace Bench are clustered in different files, where each file corresponds to a certain scenario. The whole collection work lasted for more than half a year, resulting in more than 360, 000 traces in 361 files. In addition, we also employ several applications based on Trace Bench, which validate the helpfulness of Trace Bench for the field of trace-oriented monitoring.

关键词： Monitoring Servers Educational institutions Instruments Cloud computing Context Fault diagnosis

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Correntropy induced metric based graph regularized non-negative matrix factorization

Correntropy induced metric based graph regularized non-negat...

引用

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

作者： Bin Mao Naiyang Guan Dacheng Tao Xuhui Huang Zhigang Luo College of Science National University of Defense Technology Changsha China College of Computer National University of Defense Technology Science and Technology on Parallel and Distributed Processing Laboratory Changsha China Department of Computer Science and Technology College of Computer National University of Defense Technology Changsha China Faculty of Engineering and Information Technology University of Technology Sydney Sydney NSW Australia

Non-negative matrix factorization (NMF) is an efficient dimension reduction method and plays an important role in many pattern recognition and computer vision tasks. However, conventional NMF methods are not robust since the objective functions are sensitive to outliers and do not consider the geometric structure in datasets. In this paper, we proposed a correntropy graph regularized NMF (CGNMF) to overcome the aforementioned problems. CGNMF maximizes the correntropy between data matrix and its reconstruction to filter out the noises of large magnitudes, and expects the coefficients to preserve the intrinsic geometric structure of data. We also proposed a modified version of our CGNMF which construct the adjacent graph by using sparse representation to enhance its reliability. Experimental results on popular image datasets confirm the effectiveness of CGNMF.

关键词： Robustness Vectors Clustering algorithms Mutual information Measurement Computer integrated manufacturing

来源：评论

学校读者我要写书评

暂无评论

Balancing CPU-GPU Collaborative High-Order CFD Simulations on the Tianhe-1A Supercomputer

Balancing CPU-GPU Collaborative High-Order CFD Simulations o...

引用

International Symposium on parallel and distributed processing (IPDPS)

作者： Chuanfu Xu Lilun Zhang Xiaogang Deng Jianbin Fang Guangxue Wang Wei Cao Yonggang Che Yongxian Wang Wei Liu College of Computer Science National University of Defense Technology Changsha P.R. China parallel and Distributed Systems Group Delft University of Technology Delft The Netherlands State Key Laboratory of Aerodynamics Mianyang P.R. China National University of Defense Technology Changsha Hunan CN

ISBN: (纸本)9781479938018

HOSTA is an in-house high-order CFD software that can simulate complex flows with complex geometries. Large scale high-order CFD simulations using HOSTA require massive HPC resources, thus motivating us to port it onto modern GPU accelerated supercomputers like Tianhe-1A. To achieve a greater speedup and fully tap the potential of Tianhe-1A, we collaborate CPU and GPU for HOSTA instead of using a naive GPU-only approach. We present multiple novel techniques to balance the loads between the store-poor GPU and the store-rich CPU, and overlap the collaborative computation and communication as far as possible. Taking CPU and GPU load balance into account, we improve the maximum simulation problem size per Tianhe-1A node for HOSTA by 2.3X, meanwhile the collaborative approach can improve the performance by around 45% compared to the GPU-only approach. Scalability tests show that HOSTA can achieve a parallel efficiency of above 60% on 1024 Tianhe-1A nodes. With our method, we have successfully simulated China's large civil airplane configuration C919 containing 150M grid cells. To our best knowledge, this is the first paper that reports a CPUGPU collaborative high-order accurate aerodynamic simulation result with such a complex grid geometry.

关键词： Graphics processing units Kernel Collaboration Computational fluid dynamics Computational modeling Memory management Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

The Hi-GAL compact source catalogue. I : The physical properties of the clumps in the inner Galaxy (−71.0◦ 67.0◦)

arXiv

引用

arXiv 2017年

作者： Elia, Davide Molinari, S. Schisano, E. Pestalozzi, M. Pezzuto, S. Merello, M. Noriega-Crespo, A. Moore, T.J.T. Russeil, D. Mottram, J.C. Paladini, R. Strafella, F. Benedettini, M. Bernard, J.P. Di Giorgio, A. Eden, D.J. Fukui, Y. Plume, R. Bally, J. Martin, P.G. Ragan, S.E. Jaffa, S.E. Motte, F. Olmi, L. Schneider, N. Testi, L. Wyrowski, F. Zavagno, A. Calzoletti, L. Faustini, F. Natoli, P. Palmerim, P. Piacentini, F. Piazzo, L. Pilbratt, G.L. Polychroni, D. Baldeschi, A. Beltrán, M.T. Billot, N. Cambrésy, L. Cesaroni, R. García-Lario, P. Hoare, M.G. Huang, M. Joncas, G. Liu, S.J. Maiolo, B.M.T. Marsh, K.A. Maruccia, Y. Mège, P. Peretto, N. Rygl, K.L.J. Schilke, P. Thompson, M.A. Traficante, A. Umana, G. Veneziani, M. Ward-Thompson, D. Whitworth, A.P. Arab, H. Bandieramonte, M. Becciani, U. Brescia, M. Buemi, C. Bufano, F. Butora, R. Cavuoti, S. Costa, A. Fiorellino, E. Hajnal, A. Hayakawa, T. Kacsuk, P. Leto, P. Li Causi, G. Marchili, N. Martinavarro-Armengol, S. Mercurio, A. Molinaro, M. Riccio, G. Sano, H. Sciacca, E. Tachihara, K. Torii, K. Trigilio, C. Vitello, F. Yamamoto, H. INAF-IAPS via del Fosso del Cavaliere 100 Roma00133 Italy Space Telescope Science Institute 3700 San Martin Dr. BaltimoreMD21218 United States Astrophysics Research Institute Liverpool John Moores University Liverpool Science Park Ic2 146 Brownlow Hill LiverpoolL3 5RF United Kingdom Aix Marseille Univ. CNRS LAM Laboratoire d’Astrophysique de Marseille Marseille France Max-Planck Institute for Astronomy Königstuhl 17 HeidelbergD-69117 Germany Infrared Processing Analysis Center California Institute of Technology 770 South Wilson Ave. PasadenaCA91125 United States Dipartimento di Matematica e Fisica Università del Salento Lecce73100 Italy CNRS IRAP 9 Av. colonel Roche BP 44346 Toulouse cedex 4F-31028 France Université de Toulouse UPS-OMP IRAP Toulouse cedex 4F-31028 France Department of Physics Nagoya University Chikusa-ku Nagoya Aichi464-8601 Japan Department of Physics & Astronomy University of Calgary ABT2N 1N4 Canada Center for Astrophysics and Space Astronomy University of Colorado BoulderCO80309 United States Canadian Institute for Theoretical Astrophysics University of Toronto McLennan Physical Laboratories 60 St. George Street TorontoON Canada School of Physics and Astronomy University of Leeds LeedsLS2 9JT United Kingdom School of Physics and Astronomy Cardiff University Cardiff WalesCF24 3AA United Kingdom IPAG University Grenoble Alpes Grenoble38000 France AIM Paris-Saclay CEA/IRFU - CNRS INSU - Univ. Paris Diderot Service d’Astrophysique CEA-Saclay Gif-surYvette Cedex91191 France INAF Osservatorio Astrofisico di Arcetri Largo E. Fermi 5 Firenze50125 Italy I. Physik. Institut University of Cologne Zülpicher Strasse Köln50937 Germany European Southern Observatory Karl Schwarzschild str. 2 Garching85748 Germany Max-Planck-Institut für Radioastronomie Auf dem Hügel 69 Bonn53121 Germany ASI Science Data centre 00044 Frascati Roma Italy ESA/ESAC PO Box 78 Villanueva de la Cañada Madrid28691 Spain

Hi-GAL is a large-scale survey of the Galactic plane, performed with Herschel in five infrared continuum bands between 70 and 500 µm. We present a band-merged catalogue of spatially matched sources and their properties derived from fits to the spectral energy distributions (SEDs) and heliocentric distances, based on the photometric catalogs presented in Molinari et al. (2016a), covering the portion of Galactic plane −71.0◦ 67.0◦. The band-merged catalogue contains 100922 sources with a regular SED, 24584 of which show a 70 µm counterpart and are thus considered proto-stellar, while the remainder are considered starless. Thanks to this huge number of sources, we are able to carry out a preliminary analysis of early stages of star formation, identifying the conditions that characterise different evolutionary phases on a statistically significant basis. We calculate surface densities to investigate the gravitational stability of clumps and their potential to form massive stars. We also explore evolutionary status metrics such as the dust temperature, luminosity and bolometric temperature, finding that these are higher in proto-stellar sources compared to pre-stellar ones. The surface density of sources follows an increasing trend as they evolve from pre-stellar to proto-stellar, but then it is found to decrease again in the majority of the most evolved clumps. Finally, we study the physical parameters of sources with respect to Galactic longitude and the association with spiral arms, finding only minor or no differences between the average evolutionary status of sources in the fourth and first Galactic quadrants, or between "on-arm" and "inter-arm" positions. Copyright © 2017, The Authors. All rights reserved.

关键词： Galaxies

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：