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

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Huirong Zhang Jianwen Cao Laboratory of Parallel Software and Computational Science of Software Institute of Software Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781509032068

In this paper, a preconditioning algorithm for sparse, symmetric, diagonally dominant (SDD) linear systems is proposed by using combinatorial techniques. Firstly, we construct preconditioners by finding a subgraph based on the relationship between SDD matrices and undirected graphs. The subgraph is built by augmenting a low-stretch spanning tree with some extra high stretch edges. Then we implement the algorithm for building a low stretch tree and give a parallel implementation of the subgraph preconditioning algorithm based on PETSc software. Finally, numerical experiments arising from both elliptic PDEs and Laplacian systems of network graphs are tested to evaluate the performance of our algorithm. Numerical experiments show that preconditioners constructed by our algorithm are more efficient than incomplete Choleskey factorization preconditioners and Vaidya's preconditioners. Besides, based on the tree structure, our preconditioners perform respectable parallel scalability.

关键词： Laplace equations Symmetric matrices Linear systems software algorithms software Buildings Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

An insightful program performance tuning chain for GPU computing

An insightful program performance tuning chain for GPU compu...

引用

12th International Conference on Algorithms and Architectures for parallel Processing, ICA3PP 2012

作者： Jia, Haipeng Zhang, Yunquan Long, Guoping Yan, Shengen Lab. of Parallel Software and Computational Science Institute of Software Chinese Academy of Sciences China College of Information Science and Engineering Ocean University of China China State Key Laboratory of Computing Science Chinese Academy of Sciences China Graduate University of Chinese Academy of Sciences China

ISBN: (纸本)9783642330773

It is challenging to optimize GPU kernels because this progress requires deep technical knowledge of the underlying hardware. Modern GPU architectures are becoming more and more diversified, which further exacerbates the already difficult problem of performance optimization. This paper presents an insightful performance tuning chain for GPUs. The goal is to help non-expert programmers with limited knowledge of GPU architectures implement high performance GPU kernels directly. We achieve it by providing performance information to identify GPU program performance bottlenecks and decide which optimization methods should be adopted, so as to facilitate the best match between algorithm features and underlying hardware characteristics. To demonstrate the usage of tuning chain, we optimize three representative GPU kernels with different compute intensity: Matrix Transpose, Laplace Transform and Integral on both NVIDIA and AMD GPUs. Experimental results demonstrate that under the guidance of our tuning chain, performance of those kernels achieves 7.8~42.4 times speedup compared to their naïve implementations on both NVIDIA and AMD GPU platforms. © 2012 Springer-Verlag.

关键词： Chains

来源：评论

学校读者我要写书评

暂无评论

UniDegree: A GPU-based graph representation for SSSP 15th

UniDegree: A GPU-based graph representation for SSSP

引用

15th International Conference on Algorithms and Architectures for parallel Processing, ICA3PP 2015

作者： Zhang, Changyou Wang, Feng Huang, Kun Liu, Zhiyou Chen, Yifeng Laboratory of Parallel Software and Computational Science Institute of Software Chinese Academy of Sciences Beijing100190 China HCST Key Lab School of EECS Peking University Beijing100085 China School of Computer Beijing Institute of Technology Beijing100081 China

ISBN: (纸本)9783319271217

GPU is the mainstream co-processor computers of heterogeneous architecture. parallel graph algorithms are fundamental for many data-driven applications to be solved on heterogeneous clusters. SSSP (Single Source Shortest Path) algorithm is one of the most important one. We proposed a graph representation structure with unified vertex’s degree. This method ensures the data block size consistency. And then, the transferring in memory on this representation makes the data reading in cohesion for CUDA thread blocks. Thirdly, vertex renumbering optimizes the locality of graph vertices to make the relaxing operation more efficient. With data of New York road, we implemented SSSP algorithms of delta-stepping on Nvida Tesla K20x GPU device. The experimental results show that the best unified-degree is approximate to the mode of vertex-degree of the graph. For example of the New York road map, all degrees were unified into 4-degree that results to the biggest speed-up of SSSP algorithm. © Springer International Publishing Switzerland 2015.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

A novel anti-detection criterion for covert storage channel threat estimation

引用

science China(Information sciences) 2018年第4期61卷 212-214页

作者： Chong WANG Changyou ZHANG Bin WU Yu'an TAN Yongji WANG University of Chinese Academy of Sciences Cooperative Innovation Center Institute of Software Chinese Academy of Sciences State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Laboratory of Parallel Software and Computational Science Institute of Software Chinese Academy of Sciences School of Computer Science and Technology Beijing Institute of Technology

Covert(storage)channels[1]are widely considered a main threat[2]to multilevel secure systems,e.g.,desktop operating *** estimation,as an important part of covert channel analysis,must be included in the security analy... 详细信息

关键词： Linux

来源：评论

学校读者我要写书评

暂无评论

Investigating the Existence of Holey Latin Squares via Satisfiability Testing 20th

Investigating the Existence of Holey Latin Squares via Sa...

引用

20th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2023

作者： Liu, Minghao Han, Rui Jia, Fuqi Huang, Pei Ma, Feifei Zhang, Hantao Zhang, Jian State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China Laboratory of Parallel Software and Computational Science Institute of Software Chinese Academy of Sciences Beijing China Stanford University StanfordCA United States Computer Science Department The University of Iowa Iowa CityIA52242 United States University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9789819970216

Holey Latin square (HLS) is a special combinatorial design of interest to mathematicians and is helpful in the construction of many important structures in design theory. In this paper, we investigate the existence of HLSs satisfying the seven kinds of identities with automated reasoning techniques. We formulate this problem as propositional logic formulae. Since state-of-the-art SAT solvers have difficulty solving many HLS problems, we further propose a symmetry breaking method, called partially ordered HLS (POHLS), to eliminate isomorphic solutions. We have achieved the following goals through experimental evaluation. First, we have solved a dozen of open problems interested by mathematicians. Second, we identify the impact of different encodings. Third, we demonstrate the advantages of SAT solver over other FOL-based solvers. Fourth, we show that the proposed POHLS reduction can improve the efficiency of solving and find the complementarity between two types of symmetry breaking techniques. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd 2024.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Automatic FFT Performance Tuning on OpenCL GPUs

Automatic FFT Performance Tuning on OpenCL GPUs

引用

International Conference on parallel and Distributed Systems (ICPADS)

作者： Yan Li Yunquan Zhang Haipeng Jia Guoping Long Ke Wang Laboratory of Parallel Software and Computational Science Institute of Software State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China School of Information Science and Engineering Ocean University of China Qingdao China Laboratory of Parallel Software and Computational Science Institute of Software Chinese Academy of Sciences Beijing China

Many fields of science and engineering, such as astronomy, medical imaging, seismology and spectroscopy, have been revolutionized by Fourier methods. The fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. The emerging class of high performance computing architectures, such as GPU, seeks to achieve much higher performance and efficiency by exposing a hierarchy of distinct memories to programmers. However, the complexity of GPU programming poses a significant challenge for programmers. In this paper, based on the Kronecker product form multi-dimensional FFTs, we propose an automatic performance tuning framework for various OpenCL GPUs. Several key techniques of GPU programming on AMD and NVIDIA GPUs are also identified. Our OpenCL FFT library achieves up to 1.5 to 4 times, 1.5 to 40 times and 1.4 times the performance of clAmdFft 1.0 for 1D, 2D and 3D FFT respectively on an AMD GPU, and the overall performance is within 90% of CUFFT 4.0 on two NVIDIA GPUs.

关键词： Graphics processing unit Instruction sets Vectors Memory management Kernel Programming

来源：评论

学校读者我要写书评

暂无评论

Fast flow field prediction of pollutant leakage diffusion based on deep learning

引用

Environmental science and Pollution Research 2024年第36期31卷 49393-49412页

作者： YunBo, Wan Zhong, Zhao Jie, Liu KuiJun, Zuo Yong, Zhang Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha410073 China Computational Aerodynamics Institute China Aerodynamics Research and Development Center Mianyang621000 China Laboratory of Digitizing Software for Frontier Equipment National University of Defense Technology Changsha410073 China School of Aeronautics Northwestern Polytechnical University Xi’an710072 China

Abstract: Predicting pollutant leakage and diffusion processes is crucial for ensuring people’s safety. While the deep learning method offers high simulation efficiency and superior generalization, there is currently a lack of research on predicting pollutant leakage and diffusion flow field using deep learning. Therefore, it is necessary to conduct further studies in this area. This paper introduces a two-level network method to model the flow characteristics of pollutant diffusion. The proposed method in this study demonstrates a significant enhancement in flow field prediction accuracy compared to traditional deep learning methods. Moreover, it improves computational efficiency by over 800 times compared to traditional computational fluid dynamics (CFD) methods. Unlike conventional CFD methods that require grid expansion to calculate all operation conditions, the deep learning method is not confined by grid limitations. While deep learning methods may not entirely replace CFD methods, they can serve as a valuable supplementary tool, expanding the versatility of CFD methods. The findings of this research establish a robust foundation for incorporating deep learning methods in addressing pollutant leakage and diffusion challenges. Graphical abstract: A deep learning method for simulating pollutant leakage diffusion. (Figure presented.) © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2024.

关键词： Diffusion

来源：评论

学校读者我要写书评

暂无评论

The Research and Analysis of Hungarian Algorithm in the Structure Index Reduction for DAE

The Research and Analysis of Hungarian Algorithm in the Stru...

引用

第11届分布式计算及其应用国际学术研讨会

作者： Yan Zeng Xuesong Wu Jianwen Cao Laboratory of Parallel Software and Computational Science of Software Institute of Software Chinese Academy of Sciences Graduate University of Chinese Academy of Sciences

Modeling of complex physical systems with Modelica usually leads to the high-index differential algebraic equation system(DAE), index reduction is an important part of solving the high-index DAE. The structure index reduction algorithm is one of the popular methods, but in special cases, it fails. Combinatorial relaxation algorithm can detect and correct the breakdown situation. And the maximum weight matching of bipartite graph is an important part of the combinatorial relaxation algorithm. In order to choose the proper method for the large-scale, dense bipartite graph, this paper provides three implementations of the Hungarian algorithm. The experiment results and the theory show that the BFS single-augmented method is better than others.

关键词： Modelica Bipartite Graph DAE Hungarian Algorithm Augmenting Path

来源：评论

学校读者我要写书评

暂无评论

parallel Construction of Approximate kNN Graph

Parallel Construction of Approximate kNN Graph

引用

第11届分布式计算及其应用国际学术研讨会

作者： Dilin Wang Yanmei Zheng Jianwen Cao Laboratory of Parallel Software and Computational Science of Software Institute of Software Chinese Academy of Sciences Graduate University of Chinese Academy of Sciences

Building k-nearest neighbor(kNN) graphs is a necessary step in such areas as data mining and machine learning. So in this paper, we attempt to study the kNN furthermore, we first propose a parallel algorithm for approximate kNN graph construction and then apply the kNN graph to the application of clustering. Experiments show that our MPI/OpenMP mixed mode codes can make the construction of approximate kNN graph faster and make the parallelization and implementation easier. Finally, we compare the results of agglomerative clustering methods by using our parallel algorithm to illustrate the applicability of this method.

关键词： Approximate kNN MPI/OpenMP parallel algorithms Clustering

来源：评论

学校读者我要写书评

暂无评论

An Improved KM Algorithm for Computing Structural Index of DAE System

An Improved KM Algorithm for Computing Structural Index of D...

引用

第12届分布式计算及其应用国际学术研讨会

This paper proposes an improved KM algorithm to computing the structural index of linear time-invariant Differential Algebraic Equation(DAE) systems. The problem is of practical significance in index reduction based on structural index of DAE system and combinatorial relaxation theory. This improved KM algorithm combines greedy idea and classical KM algorithm. It first computes matches as much as possible using greedy technology, and then call KM algorithm to search the matches for the unmatched vertices during the step of greedy technology. The improved KM algorithm reduces the running time bound by a factor of, the number of matches searched using greedy algorithm. Generally, the time complexity is, the optimal time is.

关键词： DAE Index Reduction Structural Index Bipartite Graph Greedy KM Algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：