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

RepoLike: a multi-feature-based personalized recommendation approach for open-source repositories

Frontiers of Information Technology & Electronic Engineering 2019年第2期20卷 222-237页

作者： Cheng YANG Qiang FAN Tao WANG Gang YIN Xun-hui ZHANG Yue YU Hua-min WANG Key Laboratory of Parallel and Distributed Computing National University of Defense Technology

With the deep integration of software collaborative development and social networking, social coding represents a new style of software production and creation paradigm. Because of their good flexibility and openness,a large number of external contributors have been attracted to the open-source communities. They are playing a significant role in open-source development. However, the open-source development online is a globalized and distributed cooperative work. If left unsupervised, the contribution process may result in inefficiency. It takes contributors a lot of time to find suitable projects or tasks from thousands of open-source projects in the communities to work on. In this paper, we propose a new approach called "RepoLike," to recommend repositories for developers based on linear combination and learning to rank. It uses the project popularity, technical dependencies among projects, and social connections among developers to measure the correlations between a developer and the given projects. Experimental results show that our approach can achieve over 25% of hit ratio when recommending 20 candidates, meaning that it can recommend closely correlated repositories to social developers.

关键词： Social coding Open-source software Personal recommendation GitHub

来源：评论

学校读者我要写书评

暂无评论

Minimizing transformer inference overhead using controlling element on Shenwei AI accelerator

引用

Frontiers of Information Technology and Electronic Engineering 2025年第4期26卷 605-622页

作者： Zhao, Yulong Wu, Chunzhi Wang, Yizhuo Zhang, Lufei Zhang, Yaguang Shen, Wenyuan Fan, Hao Fang, Hankang Qin, Yi Liu, Xin State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi214000 China School of Non-Commissioned Officer Space Engineering University Beijing100004 China National Supercomputing Center in Wuxi Wuxi214000 China Zhejiang Lab Hangzhou310000 China National Research Centre of Parallel Computer Engineering and Technology Beijing100081 China

Transformer models have become a cornerstone of various natural language processing (NLP) tasks. However, the substantial computational overhead during the inference remains a significant challenge, limiting their deployment in practical applications. In this study, we address this challenge by minimizing the inference overhead in transformer models using the controlling element on artificial intelligence (AI) accelerators. Our work is anchored by four key contributions. First, we conduct a comprehensive analysis of the overhead composition within the transformer inference process, identifying the primary bottlenecks. Second, we leverage the management processing element (MPE) of the Shenwei AI (SWAI) accelerator, implementing a three-tier scheduling framework that significantly reduces the number of host-device launches to approximately 1/10 000 of the original PyTorch-GPU setup. Third, we introduce a zero-copy memory management technique using segment-page fusion, which significantly reduces memory access latency and improves overall inference efficiency. Finally, we develop a fast model loading method that eliminates redundant computations during model verification and initialization, reducing the total loading time for large models from 22 128.31 ms to 1041.72 ms. Our contributions significantly enhance the optimization of transformer models, enabling more efficient and expedited inference processes on AI accelerators. © Zhejiang University Press 2025.

关键词： Transformer inference optimization Three-tier scheduling Zero-copy memory management Fast model loading

来源：评论

学校读者我要写书评

暂无评论

Social media in Git Hub: the role of @-mention in assisting software development

引用

Science China(Information Sciences) 2017年第3期60卷 50-67页

作者： Yang ZHANG Huaimin WANG Gang YIN Tao WANG Yue YU Key Laboratory of Parallel and Distributed Computing College of ComputerNational University of Defense Technology

Recently, many researches propose that social media tools can promote the collaboration among developers, which are beneficial to the software development. Nevertheless, there is little empirical evidence to confirm that using @-mention has indeed a beneficial impact on the issues in Git Hub. In order to begin investigating such claim, we examine data from two large and successful projects hosted on Git Hub, the Ruby on Rails and the Angular JS. By using qualitative and quantitative analysis, we give an in-depth understanding on how @-mention is used in the issues and the role of @-mention in assisting software development. Our statistical results indicate that, @-mention attracts more participants and tends to be used in the difficult issues. @-mention favors the solving process of issues by enlarging the visibility of issues and facilitating the developers' collaboration. Our study also build an @-network based on the @-mention database we *** the @-network, we investigate its evolution over time and prove that we certainly have the potential to mine the relationships and characteristics of developers by exploiting the knowledge from the @-network.

关键词： issues social media @-mention Git Hub software development

来源：评论

学校读者我要写书评

暂无评论

Why API documentation is insufficient for developers: an empirical study

引用

Science China(Information Sciences) 2021年第1期64卷 248-250页

作者： Qiang FAN Yue YU Tao WANG Gang YIN Huaimin WANG Key Laboratory of Parallel and Distributed Computing College of ComputerNational University of Defense Technology

Dear editor,Application programming interface (API) documentation plays an important role in software development and reuse [1] for both API maintainers and API *** documentation helps developers understand and reuse codes effectively [2] and focus their time on desired interfaces and functions instead of the entire system [3].Most high-quality open source projects maintain complete and informative official *** documentation typically conveys detailed specifications,such as class/inter face hierarchies and method descriptions,which can be of great benefit to developers [4].However,despite its authoritativeness and thoroughness,single-sourced official documentation does not always meet the developers'requirements [5].

关键词： Information Systems and Communication Service

来源：评论

学校读者我要写书评

暂无评论

A parallel simulated annealing algorithm with low communication overhead

引用

IEEE TRANSACTIONS ON parallel AND DISTRIBUTED SYSTEMS 1995年第12期6卷 1226-1233页

作者： Nabhan, TM Zomaya, AY Parallel Computing Research Laboratory Department of Electrical and Electronic Engineering University of Western Australia Perth Australia

In this paper, we propose a parallel simulated annealing algorithm based on the technique presented by Witte et al, [13] but with low communication overhead. The performance of our proposed algorithm is significantly better than the method presented in [13], particularly for optimization problems where the time required to communicate the solution is comparable to the evaluation time. The efficiency of the technique is demonstrated using two case studies with good results.

关键词： parallel algorithms simulated annealing speculative computation message passing systems task scheduling traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

A parallel computing engine for a class of time critical processes

引用

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS 1997年第5期27卷 774-786页

作者： Nabhan, TM Zomaya, AY Parallel Computing Research Laboratory Department of Electrical and Electronic Engineering University of Western Australia Perth WA Australia

This paper focuses on the efficient parallel implementation of systems of numerically intensive nature over loosely coupled multiprocessor architectures, These analytical models art of significant importance to many real-time systems that have to meet severe time constants, A parallel computing engine (PCE) has been developed in this work for the efficient simplification and the near optimal scheduling of numerical models over the different cooperating processors of the parallel computer, First, the analytical system is efficiently coded in its general form, The model is then simplified by using any available information (e.g., constant parameters). A task graph representing the interconnections among the different components (or equations) is generated, The graph can then be compressed to control the computation/communication requirements, The task scheduler employs a graph-based iterative scheme, based on the simulated annealing algorithm, to map the vertices of the task graph onto a Multiple-Instruction-stream Multiple-Data-stream (MIMD) type of architecture. The algorithm uses a nonanalytical cost function that properly considers the computation capability of the processors, the network topology, the communication time, and congestion possibilities, Moreover, the proposed technique is simple, flexible, and computationally viable, The efficiency of the algorithm is demonstrated by two case studies with good results.

关键词： parallel processing Engines Computer architecture Optimal scheduling Iterative algorithms Analytical models Real time systems Numerical models Concurrent computing Differential equations

来源：评论

学校读者我要写书评

暂无评论

A comparison of list scheduling heuristics for communication intensive task graphs

引用

CYBERNETICS AND SYSTEMS 1997年第7期28卷 535-546页

作者： Macey, BS Zomaya, AY Parallel Computing Research Laboratory Department of Electrical and Electronic Engineering University of Western Australia Perth WA Australia

List-based priority schedulers have long been the dominant class of static scheduling algorithms. Such heuristics have been predominantly based on the ''critical path, most immediate successors first'' (CP/MISF) priority. The ability of this type of scheduler to handle increased levels of communication overhead is examined in this paper. Three of the more popular list scheduling heuristics, Hu's LSH and Kruatrachue's ISH and DSH, are subjected to a performance-based comparison, with results demonstrating their inadequacies in communication-intensive cases. WINSCHED, a Microsoft Windows tool developed by the parallel computing Research laboratory, is also briefly presented. WINSCHED uses a number of list-based heuristics to schedule a parallel program represented as an enhanced directed acyclic graph (EDAG) on an arbitrary number of homogeneous parallel processors. It supports six distinct heuristics (with or without consideration of communication costs) and has six interconnection topologies built in.

关键词： Heuristic programming

来源：评论

学校读者我要写书评

暂无评论

Bipartite-Oriented Distributed Graph Partitioning for Big Learning

引用

Journal of Computer Science & Technology 2015年第1期30卷 20-29页

作者：陈榕施佳鑫陈海波臧斌宇 Shanghai Key Laboratory of Scalable Computing and Systems Institute of Parallel and Distributed Systems Shanghai Jiao Tong University Shanghai 200240 China

Many machine learning and data mining （MLDM] problems like recommendation, topic modeling, and medical diagnosis can be modeled as computing on bipartite graphs. However, inost distributed graph-parallel systems are oblivious to the unique characteristics in such graphs and existing online graph partitioning algorithms usually cause excessive repli- cation of vertices as well as significant pressure on network communication. This article identifies the challenges and oppor- tunities of partitioning bipartite graphs for distributed MLDM processing and proposes BiGraph, a set of bipartite-oriented graph partitioning algorithms. BiGraph leverages observations such as the skewed distribution of vertices, discriminated computation load and imbalanced data sizes between the two subsets of vertices to derive a set of optimal graph partition- ing algorithms that result in minimal vertex replication and network communication. BiGraph has been implemented on PowerGraph and is shown to have a performance boost up to 17.75X （from 1.16X） for four typical MLDM algorithnls, due to reducing up to 80% vertex replication, and up to 96% network traffic.

关键词： bipartite graph graph partitioning graph-parallel system

来源：评论

学校读者我要写书评

暂无评论

HARNESSING THE KILLER MICROS - APPLICATIONS FROM LLNLS MASSIVELY parallel computing INITIATIVE

引用

THEORETICA CHIMICA ACTA 1993年第4-5期84卷 315-323页

作者： BELAK, J Massively Parallel Computing Initiative University of California Lawrence Livermore National Laboratory Livermore USA

Recent developments in microprocessor technology have led to performance on scalar applications exceeding traditional supercomputers. This suggests that coupling hundreds or even thousands of these ''killer-micros'' (all working on a single physical problem) may lead to performance on vector applications in excess of vector supercomputers. Also, future generation killer-micros are expected to have vector floating point units as well. The purpose of this paper is to present an overview of the parallel computing environment at Lawrence Liver-more National laboratory. However, the perspective is necessarily quite narrow and most of the examples are taken from the author's implementation of a large-scale molecular dynamics code on the BBN-TC2000 at LLNL. parallelism is achieved through a geometric domain decomposition - each processor is assigned a distinct region of space and all atoms contained therein. As the atomic positions evolve, the processors must exchange ownership of specific atoms. This geometric domain decomposition proves to be quite general and we highlight its application to image processing and hydrodynamics simulations as well.

关键词： KILLER MICROS MPCI VECTOR APPLICATIONS

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：