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

11th ACM International Conference on Computing Frontiers, CF 2014

作者： Wu, Zhenhua Ma, Wenjing Long, Guoping Li, Yucheng Tang, Qiuyan Wang, Zhongjie Lab. of Parallel Software and Computational Science Institute of Software University of Chinese China Science and Technology on Integrated Information System Laboratory Institute of Software Chinese Academy of Sciences China

ISBN: (纸本)9781450328708

Phase unwrapping is an important procedure in digital im-age and signal processing, and has been widely used in many elds, such as optical and microwave interferometry, mag-netic resonance imaging, synthetic aperture radar, adaptive optics. Phase unwrapping is a time consuming process with large amount of calculations and complicated data depen-dency. A number of algorithms with different features have been developed to solve this problem. Among all of them, Goldstein's algorithm is one of the most widely used algo-rithms, and has been included in some standard libraries (such as MATLAB). In this paper we propose an innovative implementation of Goldstein's algorithm on GPU. Several important approaches and optimizations are proposed for the GPU algorithm. For example, by introducing a local-matching step, we were able to parallelize the branchcut step effciently, getting much better performance than ex-isting work. With a cascaded propagation model, another important operation in the algorithm, floodfill, is able to make good use of the computing power of GPU. We tested our GPU algorithm on NVIDIA C2050 and K20 GPUs, and achieved speedup of up to 781 and 896 over the CPU imple-mentation respectively. To the best of our knowledge, this is the best performance of unwrap ever achieved on GPUs. © 2014 ACM.

关键词： MATLAB

来源：评论

学校读者我要写书评

暂无评论

Perspectives of China's HPC system development:a view from the 2009 China HPC TOP100 list

引用

中国计算机科学前沿 2010年第4期4卷 437-444页

作者： Yunquan ZHANG Jiachang SUN Guoxing YUAN Linbo ZHANG Laboratory of Parallel Computing Institute of SoftwareChinese Academy of SciencesBeijing 100190China State Key Laboratory of Computer Science Chinese Academy of SciencesBeijing 100190China Institute of Applied Physics and Computational Mathematics Beijing 100088China Academy of Mathematics and Systems Science Chinese Academy of SciencesBeijing 100190China

The China HPC TOP100 list, an annual report of the 100 most powerful high performance computing (HPC) systems installed in mainland China, has traced the rapid growth of HPC technology in China since its first publication in 2002. This paper introduces the China HPC TOP100 list and reviews the current status of HPC systems in China in terms of system features, manufactures, and areas of application using the data reported in the most recent list, published on November 1st, 2009. We provide further analysis, prediction of future trends, and directions of the development of HPC systems in China referencing historical data accumulated through archived TOP100 lists and other publically available *** predict that the aggregated Linpack performance of the top 100 HPC systems will reach 10 PFlops in 2011, a single system with 10 PFlops peak performance will appear between 2012 and 2013, the aggregated performance of the top 100 systems will reach 100 PFlops in 2014, and a single system with 100 PFlops peak performance will appear around 2015.

关键词： high performance computer (HPC) China HPC TOP 100 list Linpack performance trend analysis

来源：评论

学校读者我要写书评

暂无评论

Optimizing sparse matrix vector multiplication using diagonal storage matrix format

Optimizing sparse matrix vector multiplication using diagona...

引用

IEEE International Conference on High Performance Computing and Communication

作者： Yuan, Liang Zhang, Yunquan Sun, Xiangzheng Wang, Ting Laboratory of Parallel Software and Computational Science ISCAS China State Key Laboratory of Computer Science CAS China Graduate University Chinese Academy of Sciences China

ISBN: (纸本)9780769542140

Sparse matrix vector multiplication (SpMV) is used in many scientific computations. The main bottleneck of this algorithm is memory bandwidth and many methods reduce memory bandwidth usage by compressing the index array. The matrices from finite difference modeling applications often have several dense diagonals and sparse diagonals. For these matrices, the index array can be deleted by using diagonal storage format (DIA) to store dense diagonals and DIA & CSR mixed algorithm. In this paper we propose two improved sparse matrix storage format based on DIA format and the corresponding SpMV algorithms. We present the performance results on two platforms, which show that our method can reduce the memory usage for a wide range of sparse matrices and achieve speedup up to 1.87. © 2010 IEEE.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

SSSP on GPU without atomic operation 2nd

SSSP on GPU without atomic operation

引用

2nd International Conference on Human Centered Computing, HCC 2016

作者： Wang, Feng Zhu, Liehuang Zhang, Changyou School of Computer Science and Technology Beijing Institute of Technology Beijing100081 China Laboratory of Parallel Software and Computational Science Institute of Software Chinese Academy of Science Beijing100190 China

ISBN: (纸本)9783319318530

Graph is a general theoretical model in many large scale data-driven applications. SSSP (Single Source Shortest Path) algorithm is a foundation for most important algorithms and applications. GPU remains its mainstream station in high performance computing with heterogeneous architecture computers. Because of the high parallelization of the GPU threads, the distances of the vertices of the GPU are updated by atomic operations to avoid the read and write errors. Most atomic operations are unnecessary since the read-write conflicts are rare in large graph. However, without atomic operations the result accuracy can’t be guaranteed. The atomic operations take large part of the running time of the program. To improve the performance of SSSP on GPU, we proposed an algorithm with data block iterations instead of atomic operations. The algorithm not only gets a high speed-up but also guarantees the accuracy of the result. Experimental results show that this SSSP algorithm gained a speedup of three times than the serial algorithm on CPU and more than ten times than the parallel algorithm on GPU with atomic operation. © Springer International Publishing Switzerland 2016.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

VolCE: An efficient tool for solving #SMT(LA) problems 2

VolCE: An efficient tool for solving #SMT(LA) problems

引用

2nd Workshop on Logics for Reasoning about Preferences, Uncertainty, and Vagueness, PRUV 2018

作者： Ge, Cunjing Ma, Feifei Zhang, Jian State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences China Laboratory of Parallel Software and Computational Science Institute of Software Chinese Academy of Sciences China University of Chinese Academy of Sciences China

We present VolCE, a tool for computing and estimating the size of the solution space of SMT(LA) constraints. VolCE supports the SMT-LIB format. It integrates SMT solving with volume computation/estimation and integer solution counting for convex polytopes. Several effective techniques are adopted, which enable the tool to deal with high-dimensional problem instances efficiently. © 2018 CEUR-WS. All Rights Reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

software Component Library Management Mechanism for Equipment Parts Service Value-Net 6th

Software Component Library Management Mechanism for Equipmen...

引用

6th International Conference on Human Centered Computing, HCC 2020

作者： Tian, Zhuo Zhang, Changyou Cai, Xiaofeng Xiao, Jiaojiao Laboratory of Parallel Software and Computational Science Institute of Software Chinese Academy of Sciences Beijing China School of Computer and Communication Engineering University of Science and Technology Beijing Beijing China

ISBN: (纸本)9783030706258

software reuse realizes the sharing of software resources, and component-based reuse is the main form of software reuse. The classification, storage, retrieval, and release of a large number of component resources require efficient component library management methods. This paper proposes an open software component library management mechanism based on microservices. Taking manufacturing product service life cycle value chain collaboration as a case, it realizes a domain-oriented microservice granularity division mechanism and forms a domain-oriented software component representation, warehousing, discovery, selection, arrangement, filing, and other compatible open software component library management mechanisms;realization of the design of an open software component management system for manufacturing product operation and maintenance reengineering value chain collaboration, The simulation verifies the open ability and management efficiency of the management mechanism. © 2021, Springer Nature Switzerland AG.

关键词： Computer software reusability

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

The Eleventh International Symposium on Distributed Computing and Applications to Business,Engineering and science(DCABES2012)(第十一届分布式计算及其应用国际学术研讨会)(原名:电子商务、工程及科学领域的分布式计算和应用国际学术研讨会)

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

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 *** structure index reduction algorithm is one of the popular methods,but in special cases,it *** relaxation algorithm can detect and correct the breakdown *** the maximum weight matching of bipartite graph is an important part of the combinatorial relaxation *** order to choose the proper method for the large-scale,dense bipartite graph,this paper provides three implementations of the Hungarian *** experiment results and the theory show that the BFS single-augmented method is better than others.

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

来源：评论

学校读者我要写书评

暂无评论

An Efficient Algorithm for Solving Eigenproblem

An Efficient Algorithm for Solving Eigenproblem

引用

The 13th International Symposium on Distributed Computing and Applications to Business,Engineering and science(DCABES 2014)(第十三届分布式计算及其应用国际学术研讨会)

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

ISBN: (纸本)9781479941681

In this paper,we consider second order elliptic ODE eigenproblems on general *** construct an efficient algorithm for computing the eigenvalue by using weighted mean combination of the linear finite element method and corresponding 2nd-order finite difference *** first take the arithmetic mean of the two *** we compute the quasi-optimal combined parameters for different eigenvalues to improve our efficient *** algorithm we construct convergence faster and have higher accuracy than the linear finite element method and corresponding 2nd-order finite difference *** numerical examples tested on both uniform meshes and nonuniform meshes are given to illustrate the computational cost of different numerical methods for solving eigenvalue *** efficiency,all the matrices use sparse storage in our algorithm.

关键词： Keywords-Efficient algorithm combinatorial quasioptimal eigenproblem

来源：评论

学校读者我要写书评

暂无评论

parallel Construction of Approximate kNN Graph

Parallel Construction of Approximate kNN Graph

引用

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

Building k-nearest neighbor(kNN)graphs is a necessary step in such areas as data mining and machine *** 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 *** show that our MPI/OpenMP mixed mode codes can make the construction of approximate kNN graph faster and make the parallelization and implementation ***,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

来源：评论

学校读者我要写书评

暂无评论

LogGPH: A parallel computational model with hierarchical communication awareness

LogGPH: A parallel computational model with hierarchical com...

引用

International Conference on computational science and Engineering

作者： Yuan, Liang Zhang, Yunquan Tang, Yuxin Rao, Li Sun, Xiangzheng Laboratory of Parallel Software and Computational Science ISCAS China State Key Laboratory of Computer Science Chinese Academy of Sciences China Graduate University Chinese Academy of Sciences China

ISBN: (纸本)9780769543239

In large-scale cluster systems, interconnecting thousands of computing nodes increase the complexity of the network topology. Nevertheless, few existing computational models consider the impact of hierarchical communication latencies and bandwidths caused by the network complexity. In this paper we propose a new parallel computational model called LogGPH with a new parameter H incorporated into the LogGP model to describe the communication hierarchy. Through predicting and analyzing the point-to-point and collective MPI-Allgather communication on two 100-Terascale supercomputers, the Dawning 5000A and the Deep Comp 7000, with the new model, it shows that the new model is more accurate than the LogGP model. The mean of absolute error of our model on point-to-point communications is 13%, but the value is 30% without the hierarchical communication consideration. © 2010 IEEE.

关键词： Supercomputers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：