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

24th International Conference on Algorithms and Architectures for parallel Processing, ICA3PP 2024

作者： Lei, Tong Chen, Zongjing Che, Yonggang Xu, Chuanfu Laboratory of Digitizing Software for Frontier Equipment National University of Defense Technology Changsha410073 China National Key Laboratory of Parallel and Distributed Computing College of Computer Science and Technology National University of Defense Technology Changsha410073 China

ISBN: (纸本)9789819615445

Currently, the landscape of computer hardware architecture presents the characteristics of heterogeneity and diversity, prompting widespread attention to cross-platform portable parallel programming techniques. Most existing portable programming approaches adopt the "MPI+X" strategy, focusing mainly on node-level "X" parallelism, while inter-node parallelization still relies on manual MPI programming. OP2 is a domain-specific language-based portable parallel programming framework for unstructured mesh applications that supports the automatic generation of MPI parallel code. However, programmers must manually write pre-processing code during code refactoring, such as handling the mapping relationship between global and process-local variables and the initial distribution of process-local data. In this paper, we propose MARO (MPI Automatic Refactoring for OP2), an automatic refactoring method for generating pre-processing code targeting MPI code generation within the OP2 programming framework for unstructured mesh applications. This method automatically generates the pre-processing code required for MPI parallelism through the source-to-source translator, enabling OP2 to generate MPI parallel code without requiring users to write MPI-related code manually. We compare the automatically refactored OP2 applications using the proposed method with those manually refactored to validate its effectiveness. The proposed method enhances OP2’s automatic parallel code generation capability, enabling it to achieve fully automatic MPI parallelization. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Automatic programming

来源：评论

学校读者我要写书评

暂无评论

Open source oriented cross-platform survey

引用

Information and software Technology 2025年 182卷

作者： Yao, Simeng Zhang, Xunhui Zhang, Yang Wang, Tao College of Computer Science and Technology National University of Defense Technology Changsha410073 China State Key Laboratory of Complex & Critical Software Environment Changsha410073 China National Key Laboratory of Parallel and Distributed Computing Changsha410073 China

Context: Open-source software development has become a widely adopted approach to software creation. However, developers’ activities extend beyond social coding platforms (e.g., GitHub), encompassing social Q&A platforms (e.g., StackOverflow) and social media platforms (e.g., Twitter). Therefore, cross-platform research is essential for a deeper understanding of the nature of software development activities. Objective: This paper focuses on open-source platforms and systematically summarizes relevant cross-platform research. It aims to assess the current state of cross-platform research and provide insights into the challenges and future developments in this field. Method: This paper reviews 69 cross-platform research papers related to open-source software from 2013 to 2024, with a focus on several key areas, including platform interconnections, research themes, experimental design methods, challenges and research opportunities. Results: Through the analysis of 69 papers, we found that cross-platform research primarily involves platforms such as social coding, social Q&A, and social media. Researchers typically rely on information traces, including user personal info, technical info, project/post/bug report metadata, interaction info, to facilitate connections between platforms. Cross-platform research in the open-source domain mainly focuses on problem classification and feature extraction. The predominant research methods include data-driven approaches, qualitative studies, modeling and machine learning, and tool development and implementation. Despite these advancements, common challenges remain, such as subjective evaluation bias in manual data classification, insufficient data source coverage, and inaccurate data recognition. Future research opportunities may focus on increasing the diversity of data sources, improving data recognition accuracy, optimizing data classification methods, and clarifying user skill requirements. Conclusions: Based on our findings, w

关键词： Data accuracy

来源：评论

学校读者我要写书评

暂无评论

A SPECTRAL LEVENBERG-MARQUARDT-DEFLATION METHOD FOR MULTIPLE SOLUTIONS OF SEMILINEAR ELLIPTIC SYSTEMS

arXiv

引用

arXiv 2025年

作者： Li, Lin Zhou, Yuheng Xie, Pengcheng Li, Huiyuan School of Mathematics and Physics University of South China Hengyang China Applied Mathematics and Computational Research Division Lawrence Berkeley National Laboratory 1 Cyclotron Road BerkeleyCA94720 United States State Key Laboratory of Computer Science Laboratory of Parallel Computing Institute of Software Chinese Academy of Sciences Beijing100190 China

Many nonlinear differential equations arising from practical problems may permit nontrivial multiple solutions relevant to applications, and these multiple solutions are helpful to deeply understand these practical problems and to improve some applications. Developing an efficient numerical method for finding multiple solutions is very necessary due to the nonlinearity and multiple solutions of these equations. Moreover, providing an efficient iteration plays an important role in successfully obtaining multiple solutions with fast and stable convergence. In the current paper, an efficient algorithm for finding multiple solutions of semilinear elliptic systems is proposed, where the trust region Levenberg-Marquardt method is firstly used to iterate the resulted nonlinear algebraic system. When the nonlinear term in these equations has only the first derivative, our algorithm can efficiently find multiple solutions as well. Several numerical experiments are tested to show the efficiency of our algorithm, and some solutions which have not been shown in the literature are also found and *** Codes 65N35, 65N22, 65F05, 65L10 Copyright © 2025, The Authors. All rights reserved.

关键词： Galerkin methods

来源：评论

学校读者我要写书评

暂无评论

Fast Maxwell Solvers Based on Exact Discrete Eigen-Decompositions I. Two-Dimensional Case

arXiv

引用

arXiv 2025年

作者： Wang, Lixiu Jia, Lueling Cao, Zijian Li, Huiyuan Zhang, Zhimin School of Mathematics and Physics University of Science and Technology Beijing Beijing100083 China School of Mathematics and Statistics Shandong Normal University Jinan250358 China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing101408 China State Key Laboratory of Computer Science Laboratory of Parallel Computing Institute of Software Chinese Academy of Sciences Beijing100190 China Department of Mathematics Wayne State University DetroitMI48202 United States

In this paper, we propose fast solvers for Maxwell’s equations in rectangular domains. We first discretize the simplified Maxwell’s eigenvalue problems by employing the lowest-order rectangular Nédélec elements and derive the discrete eigen-solutions explicitly, providing a Hodge-Helmholtz decomposition framework at the discrete level. Based on exact eigen-decompositions, we further design fast solvers for various Maxwell’s source problems, guaranteeing either the divergence-free constraint or the Gauss’s law at the discrete level. With the help of fast sine/cosine transforms, the computational time grows asymptotically as O(n2 log n) with n being the number of grids in each direction. Our fast Maxwell solvers outperform other existing Maxwell solvers in the literature and fully rival fast scalar Poisson/Helmholtz solvers based on trigonometric transforms in either efficiency, robustness, or storage complexity. It is also utilized to perform an efficient pre-conditioning for solving Maxwell’s source problems with variable coefficients. Finally, numerical experiments are carried out to illustrate the effectiveness and efficiency of the proposed fast *** Codes 65N30, 35Q61, 65F05, 68W40 © 2025, CC BY.

关键词： Maxwell equations

来源：评论

学校读者我要写书评

暂无评论

Highly Optimized Code Generation for Stencil Codes with Computation Reuse for GPUs

引用

Journal of Computer science & Technology 2016年第6期31卷 1262-1274页

作者： Wen-Jing Ma Kan Gao Guo-Ping Long Laboratory of Parallel Software and Computing Science Institute of Software Chinese Academy of Sciences Beijing 100190 China State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing 100190 China Information Center China Association for Science and Technology Beijing 100863 China

Computation reuse is known as an effective optimization technique. However, due to the complexity of modern GPU architectures, there is yet not enough understanding regarding the intriguing implications of the interplay of compu- ration reuse and hardware specifics on application performance. In this paper, we propose an automatic code generator for a class of stencil codes with inherent computation reuse on CPUs. For such applications, the proper reuse of intermediate results, combined with careful register and on-chip local memory usage, has profound implications on performance. Current state of the art does not address this problem in depth, partially due to the lack of a good program representation that can expose all potential computation reuse. In this paper, we leverage the computation overlap graph （COG）, a simple representation of data dependence and data reuse with ＂element view＂, to expose potential reuse opportunities. Using COG, we propose a portable code generation and tuning framework for GPUs. Compared with current state-of-the-art code generators, our experimental results show up to 56.7% performance improvement on modern GPUs such as NVIDIA C2050.

关键词： GPGPU OpenCL stencil code generation computation reuse

来源：评论

学校读者我要写书评

暂无评论

A new class of three-variable orthogonal polynomials and their recurrences relations

引用

science China Mathematics 2008年第6期51卷 1071-1092页

作者： SUN JiaChang State Key laboratory of Computer science,R&D Center for parallel computing,Institute of software,Chinese Academy of sciences,Beijing 100080,China State Key Laboratory of Computer Science R & D Center for Parallel Computing Institute of Software Chinese Academy of Sciences Beijing 100080 China

A new class of three-variable orthogonal polynomials, defined as eigenfunctions of a second order PDE operator, is studied. These polynomials are orthogonal over a curved tetrahedron region, which can be seen as a mapping from a traditional tetrahedron, and can be taken as an extension of the 2-D Steiner domain. The polynomials can be viewed as Jacobi polynomials on such a domain. Three-term relations are derived explicitly. The number of the individual terms, involved in the recurrences relations, are shown to be independent on the total degree of the polynomials. The numbers now are determined to be five and seven, with respect to two conjugate variables z, $ \bar z $ and a real variable r, respectively. Three examples are discussed in details, which can be regarded as the analogues of the Chebyshev polynomials of the first and the second kinds, and Legendre polynomials.

关键词： 3-D PDE eigen-problem three-variable Chebyshev polynomials Legendre polynomial Jacobi polynomials recurrence relations 65N25 42C05 33C45

来源：评论

学校读者我要写书评

暂无评论

Jacobi-Sobolev Orthogonal Polynomialsand Spectral Methods for Elliptic Boundary Value Problems

引用

Communications on Applied Mathematics and Computation 2019年第2期1卷 283-308页

作者： Xuhong Yu Zhongqing Wang Huiyuan Li University of Shanghai for Science and Technology Shanghai 200093China State Key Laboratory of Computer Science/Laboratory of Parallel Computing Institute of SoftwareChinese Academy of SciencesBeijing 100190China

Generalized Jacobi polynomials with indexes α,β∈ R are introduced and some basic properties are established. As examples of applications,the second- and fourth-order elliptic boundary value problems with Dirichlet or Robin boundary conditions are considered,and the generalized Jacobi spectral schemes are proposed. For the diagonalization of discrete systems,the Jacobi-Sobolev orthogonal basis functions are constructed,which allow the exact solutions and the approximate solutions to be represented in the forms of infinite and truncated Jacobi series. Error estimates are obtained and numerical results are provided to illustrate the effectiveness and the spectral accuracy.

关键词： Generalized Jacobi polynomials Spectral method - Jacobi-Sobolev orthogonal basis functions Elliptic boundary value problems Error analysis

来源：评论

学校读者我要写书评

暂无评论

Large-Scale Multi-Objective Optimization Algorithm Based on Weighted Overlapping Grouping of Decision Variables

引用

Computer Modeling in Engineering & sciences 2024年第7期140卷 363-383页

作者： Liang Chen Jingbo Zhang Linjie Wu Xingjuan Cai Yubin Xu Shanxi Key Laboratory of Big Data Analysis and Parallel Computing Taiyuan University of Science and TechnologyTaiyuan030024China School of State Key Laboratory of Novel Software Technology Nanjing UniversityNanjing210008China

The large-scale multi-objective optimization algorithm(LSMOA),based on the grouping of decision variables,is an advanced method for handling high-dimensional decision ***,in practical problems,the interaction among decision variables is intricate,leading to large group sizes and suboptimal optimization effects;hence a large-scale multi-objective optimization algorithm based on weighted overlapping grouping of decision variables(MOEAWOD)is proposed in this ***,the decision variables are perturbed and categorized into convergence and diversity variables;subsequently,the convergence variables are subdivided into groups based on the interactions among different decision *** the size of a group surpasses the set threshold,that group undergoes a process of weighting and overlapping ***,the interaction strength is evaluated based on the interaction frequency and number of objectives among various decision *** decision variable with the highest interaction in the group is identified and disregarded,and the remaining variables are then reclassified into ***,the decision variable with the strongest interaction is added to each *** minimizes the interactivity between different groups and maximizes the interactivity of decision variables within groups,which contributed to the optimized direction of convergence and diversity exploration with different *** was subjected to testing on 18 benchmark large-scale optimization problems,and the experimental results demonstrate the effectiveness of our *** with the other algorithms,our method is still at an advantage.

关键词： Decision variable grouping large-scale multi-objective optimization algorithms weighted overlapping grouping direction-guided evolution

来源：评论

学校读者我要写书评

暂无评论

Models of parallel computation :a survey and classification

引用

中国高等学校学术文摘·计算机科学 2007年第2期1卷 156-165页

作者： ZHANG Yunquan CHEN Guoliang SUN Guangzhong MIAO Qiankun Laboratory of Parallel Computing Institute of SoftwareChinese Academy of SciencesBeijing 100080China State Key Laboratory of Computer Science Institute of SoftwareChinese Academy of SciencesBeijing 100080China Anhui Province-MOST Key Co-Lab of High Performance Computing and Its Applications Department of Computer Science and TechnologyUniversity of Science and Technology of ChinaHefei 230027China

In this paper,the state-of-the-art parallel computational model research is *** will introduce various models that were developed during the past *** to their targeting architecture features,especially memory organization,we classify these parallel computational models into three *** models and their characteristics are discussed based on three generations *** believe that with the ever increasing speed gap between the CPU and memory systems,incorporating non-uniform memory hierarchy into computational models will become *** the emergence of multi-core CPUs,the parallelism hierarchy of current computing platforms becomes more and more *** this complicated parallelism hierarchy in future computational models becomes more and more important.A semi-automatic toolkit that can extract model parameters and their values on real computers can reduce the model analysis complexity,thus allowing more complicated models with more parameters to be *** memory and hierarchical parallelism will be two very important features that should be considered in future model design and research.

关键词： parallel computational models hierarchicalmemory hierarchical parallelism three generations memorymodel

来源：评论

学校读者我要写书评

暂无评论

B-splines on 3-D tetrahedron partition in four-directional mesh

引用

science China Mathematics 2001年第4期44卷 491-496页

作者：孙家昶施锡泉 1. Parallel Computing Division and Laboratory of Computer Science Institute of Software Chinese Academy of Sciences 100080 Beijing China 2. Department of Applied Mathematics University of Dalian 116024 Dalian China

It is more difficult to construct 3-D splines than in 2-D case. Some results in the three directional meshes of bivariate case have been e xtended to 3-D case and corresponding tetrahedron partition has been constructed. The support of related Bsplines and their recurrent formulas on integration and differentiationdifference are obtained. The results of this paper can be extended into higher dimension spaces, and can be also used in wavelet analysis, because of the relationship between spline and wavelets.

关键词： high dimensional splines box splines tetrahedron partition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：