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

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

作者： Wenjing LI Zhong-ming Lin Ying PAN Ze-yu Tang School of Logistics Management and Engineering Guangxi Teachers Education University College of Computer and Information Engineering Guangxi Teachers Education University

The parallel algorithm of Petri net based on multi-core clusters is put forward in order to make the Petri net system with concurrent synchronous function realize parallel control and running. First, select different Petri net structures and conduct transformation, and give the partitioning method of the subnets of place invariant-based Petri net system. Then, put forward the parallel algorithm of Petri net based on multicore clusters according to the MPI+Open MP+STM(STM, Software Transactional Memory and transactional memory) three-level parallel programming model and combining with the parallelized analysis of the changes of internal subnets and among the subnets. The experiment results show that the algorithm can better reflect the actual running process of Petri net system, and it is a feasible and effective method of realizing the parallel control and running of Petri net system.

关键词： Multicore clusters Petri net Petri net structure and transformation Subnet partitioning MPI+OpenMP+STM parallel model parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

A parallel Finite Element Discretization algorithm Based on Grad-Div Stabilization for the Navier-Stokes Equations

引用

JOURNAL OF MATHEMATICAL FLUID MECHANICS 2024年第3期26卷 42-42页

作者： Shang, Yueqiang Zhu, Jiali Zheng, Bo Southwest Univ Sch Math & Stat Chongqing 400715 Peoples R China

We present and study a parallel grad-div stabilized finite element discretization algorithm based on entire-overlapping domain decomposition for the numerical simulation of Navier-Stokes equations. The algorithm is easy to implement on top of existing sequential software, in which each subproblem used to calculate a local solution in its designated subregion is actually a global problem with vast of degrees of freedom coming from its own subregion, and hence, can be solved independently with other subproblems. We derive error bounds of the approximate solution by employing the technical tool of local a priori estimate, and investigate the effect of grad-div stabilization term on the approximation solutions. Numerical comparisons, with both inf-sup stable and unstable mixed finite elements pairs for the velocity and pressure, show that our present algorithm has an amazing superiority to its counterpart without stabilization in the sense that accuracy of the approximate velocities could be improved by two orders of magnitude when the viscosity nu\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\nu $$\end{document} is small. While compared with the usual standard serial grad-div stabilized finite element method, our algorithm saves lots of CPU time in computing a solution with comparable accuracy.

关键词： Navier-Stokes equations Finite element parallel algorithm Grad-div stabilization

来源：评论

学校读者我要写书评

暂无评论

An Active Radio Frequency Identification System Based on parallel Anti-Collision algorithm for Massive Tags 3

An Active Radio Frequency Identification System Based on Par...

引用

3rd International Conference on Electronics and Communication;Network and Computer Technology (ECNCT)

作者： Yu, Lei Jiang, Bin Chen, Haijin Nantong Univ Sch Informat Sci & Technol Nantong 226019 Peoples R China

ISBN: (数字)9781510652118

ISBN: (纸本)9781510652118;9781510652101

Aiming at the tag collision problem in the actual application of the radio frequency identification system (RFID), this paper proposes an active radio frequency identification method and system supporting parallel anti-collision. The active tags work in parallel and the conversion time of adjacent active tags is partially overlapped. Significantly parallel anti-collision system shorten the identification time of the entire system, while ensuring that only one active tag sends data to the reader at the same time, which can effectively improve the anti-collision performance of the radio frequency identification system. It makes the averaged delay 5.83% of that of the traditional dual-channel system. The more tags, the more obvious the superiority of the parallel anti-collision system. The system has good engineering practical value and can be used in applications that have strict requirements on reading speed.

关键词： Radio frequency identification anti-collision parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

parallel social behavior-based algorithm for identification of influential users in social network

引用

APPLIED INTELLIGENCE 2021年第10期51卷 7365-7383页

作者： Mnasri, Wassim Azaouzi, Mehdi Ben Romdhane, Lotfi Univ Sousse MARS Res Lab LR17ES05 Sousse Tunisia La Rochelle Univ L3i La Rochelle France

Influence maximization in social networks refers to the process of finding influential users who make the most of information or product adoption. The social networks is prone to grow exponentially, which makes it difficult to analyze. Critically, most of approaches in the literature focus only on modeling structural properties, ignoring the social behavior in the relations between users. For this, we tend to parallelize the influence maximization task based on social behavior. In this paper, we introduce a new parallel algorithm, named PSAIIM, for identification of influential users in social network. In PSAIIM, we uses two semantic metrics: the user's interests and the dynamically-weighted social actions as user interactive behaviors. In order to overcome the size of actual real-world social networks and to minimize the execution time, we used the community structure to apply perfect parallelism to the CPU architecture of the machines to compute an optimal set of influential nodes. Experimental results on real-world networks reveal effectiveness of the proposed method as compared to the existing state-of-the-art influence maximization algorithms, especially in the speed of calculation.

关键词： Social networks analysis Influence analysis parallel algorithm CPU architecture Behavior attributes Common interest

来源：评论

学校读者我要写书评

暂无评论

A parallel multi-objective evolutionary algorithm for community detection in large-scale complex networks

引用

INFORMATION SCIENCES 2021年 576卷 374-392页

作者： Su, Yansen Zhou, Kefei Zhang, Xingyi Cheng, Ran Zheng, Chunhou Anhui Univ Sch Artif Intelligence Key Lab Intelligent Comp Signal Proc Minist Educ Hefei 230601 Peoples R China Southern Univ Sci & Technol Dept Comp Sci & Engn Shenzhen Key Lab Computat Intelligence Shenzhen 518055 Peoples R China

Community detection in large-scale complex networks has recently received significant attention as the volume of available data is becoming larger. The use of evolutionary algorithms (EAs) for community detection in large-scale networks has gained considerable popularity because these algorithms are fairly effective in networks with a relatively small number of nodes. In this paper, we propose a parallel multi-objective EA, called PMOEA, for community detection in large-scale networks, where the communities associated with key network nodes are detected in parallel. Specifically, we develop a multi-objective and a single-objective EA. The former is used to detect the communities of a key node instead of all communities in the network. The latter obtains the communities in the entire network using the previously detected communities of each key node. The performance of the proposed method was verified on both large-scale synthetic benchmark networks and real-world networks. The results demonstrated the superiority of PMOEA over six EA-based and two non-EA-based community-detection algorithms for large-scale networks. (c) 2021 Elsevier Inc. All rights reserved.

关键词： Evolutionary algorithm Multi-objective optimization Community detection Complex network parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

parallel algorithm Study of Petri net Based on Multi-core Clusters

Parallel Algorithm Study of Petri net Based on Multi-core Cl...

引用

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

作者： Wenjing LI Zhong-ming Lin Ying PAN Ze-yu Tang School of Logistics Management and Engineering Guangxi Teachers Education University Nanning China College of Computer and Information Engineering Guangxi Teachers Education University Nanning China

The parallel algorithm of Petri net based on multicore clusters is put forward in order to make the Petri net system with concurrent synchronous function realize parallel control and ***,select different Petri net structures and conduct transformation,and give the partitioning method of the subnets of place invariant-based Petri net ***,put forward the parallel algorithm of Petri net based on multicore clusters according to the MPI+OpenMP+STM(STM,Software Transactional Memory and transactional memory)three-level parallel programming model and combining with the parallelized analysis of the changes of internal subnets and among the *** experiment results show that the algorithm can better reflect the actual running process of Petri net system,and it is a feasible and effective method of realizing the parallel control and running of Petri net system.

关键词： Multicore clusters Petri net Petri net structure and transformation Subnet partitioning MPI+OpenMP+STM parallel model parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

CA3DMM: A New algorithm Based on a Unified View of parallel Matrix Multiplication

CA3DMM: A New Algorithm Based on a Unified View of Parallel ...

引用

International Conference for High Performance Computing, Networking, Storage and Analysis (HPC)

作者： Huang, Hua Chow, Edmond Georgia Inst Technol Sch Computat Sci & Engn Atlanta GA 30332 USA

ISBN: (纸本)9781665454445

This paper presents the Communication-Avoiding 3D Matrix Multiplication (CA3DMM) algorithm, a simple and novel algorithm that has optimal or near-optimal communication cost. CA3DMM is based on a unified view of parallel matrix multiplication. Such a view generalizes 1D, 2D, and 3D matrix multiplication algorithms to reduce the data exchange volume for different shapes of input matrices. CA3DMM further minimizes the actual communication costs by carefully organizing its communication patterns. CA3DMM is much simpler than some other generalized 3D algorithms, and CA3DMM does not require low-level optimization. Numerical experiments show that CA3DMM has good parallel scalability and has similar or better performance when compared to state-of-the-art PGEMM implementations for a wide range of matrix dimensions and number of processes.

关键词： matrix multiplication communication optimization parallel algorithm high-performance computing

来源：评论

学校读者我要写书评

暂无评论

An Evolutionary Profile Guided Greedy parallel Replica-Exchange Monte Carlo Search algorithm for Rapid Convergence in Protein Design

引用

IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS 2021年第2期18卷 489-499页

作者： Banerjee, Anupam Pal, Kuntal Mitra, Pralay Indian Inst Technol Kharagpur Adv Technol Dev Ctr Kharagpur 721302 West Bengal India Synopsys Chennai Tamil Nadu India Indian Inst Technol Kharagpur Dept Comp Sci & Engn Kharagpur 721302 W Bengal India

Protein design, also known as the inverse protein folding problem, is the identification of a protein sequence that folds into a target protein structure. Protein design is proved as an NP-hard problem. While researchers are working on designing heuristics with an emphasis on new scoring functions, we propose a replica-exchange Monte Carlo (REMC) search algorithm that ensures faster convergence using a greedy strategy. Using biological insights, we construct an evolutionary profile to encode the amino acid variability in different positions of the target protein from its structural homologs. The evolutionary profile guides the REMC search, and the greedy approach confirms appreciable exploration and exploitation of the sequence-structure fitness surface. We allow termination of a simulation trajectory once stagnant situation is detected. A series of sequence and structure level validations establish the goodness of our design. On a benchmark dataset, our algorithm reports an average root-mean-square deviation of 1.21 angstrom between the target and the design proteins when modeled with an existing protein folding software. Besides, our algorithm assures 6.16 times overall speedup. In Molecular Dynamics simulations, we observe that four out of selected five design proteins report better to comparable stability to the corresponding target proteins.

关键词： Proteins Amino acids Trajectory Convergence Monte Carlo methods Search problems Heuristic algorithms Computational protein design evolutionary profile REMC search greedy approach parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

A parallel sparse triangular solve algorithm based on dependency elimination of the solution vector

引用

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2021年第2期24卷 1317-1330页

作者： Jin, Song Pei, Songwei Wang, Yu Qi, Yincheng North China Elect Power Univ Dept Elect & Commun Engn Sch Elect & Elect Engn Baoding Peoples R China Beijing Univ Posts & Telecommun Sch Comp Sci Beijing Peoples R China

Sparse triangular solve (SpTRSV) is an important kernel in many scientific computing applications. In traditional viewpoints, accelerating SpTRSV by parallelizing the solution process is a challenging task. Dependencies among the variables that exist in the solution process not only restrict the parallelism that can be achieved, but also introduce large synchronization overhead among the parallel tasks. Moreover, a time-consuming pre-processing phase is commonly required to identify calculations that can be parallelized. However, we have observed that a large number of dependencies among the variables can be eliminated if we only calculate partial values of the variables first and add them together to obtain the final values later. By using such a strategy, starting to solve a variable does not need to wait for all of its prerequisite variables having been solved. In consequence, parallelism of the SpTRSV can be increased significantly. In this paper, we transform above mentioned observations into a subtree-based parallel algorithm to accelerate SpTRSV. The proposed algorithm calculates partial values of the variable along with an implicit subtree traversal and utilizes hardware atomic operation to implement accumulation of the partial values. This not only introduces no pre-processing overhead, but also avoids any barrier synchronization among the parallel threads. We evaluate the proposed algorithm on 2135 matrices from SuiteSparse Matrix Collection based on a generic GPU platform. Experimental results demonstrate that our scheme outperforms the state-of-the-art GPU and CPU vendor libraries in 1949 and 1782 matrices, respectively. Compared with the latest synchronization-free method, our scheme outperforms in 1779 matrices.

关键词： Sparse triangular solve parallel algorithm Dependency elimination

来源：评论

学校读者我要写书评

暂无评论

A parallel full domain partition method for Stokes and Navier-Stokes type variational inequalities with damping

引用

COMMUNICATIONS IN NONLINEAR SCIENCE AND NUMERICAL SIMULATION 2025年 143卷

作者： Zheng, Bo Shang, Yueqiang Guizhou Normal Univ Sch Math Sci Guiyang 550025 Peoples R China Southwest Univ Sch Math & Stat Chongqing 400715 Peoples R China

Motivated by reducing the computational time and computer storage requirements in the numerical simulations, we present a parallel full domain partition method based on finite element approximations for Stokes and Navier-Stokes type variational inequalities with damping in this paper. Within this parallel method, each subproblem used to calculate an approximate solution is actually a global problem defined in the whole domain with the vast majority of the degrees of freedom associated with the particular subdomain that it is responsible for, making the present method easily implementable on the basis of existing black-box sequential solver without massive effort in recoding on the top of existing serial software. Errors of the approximate velocity in L2 norm and pressure in H-1 norm for the serial method are estimated. Based on these error estimate results and the theoretical tool of local a priori estimate for finite element solution, error estimates of the approximate solutions from the proposed method are derived. Correctness of the theoretical predictions and promise of the present method are illustrated by some results of numerics. It is numerically shown that by choosing suitable algorithmic parameters, our proposed parallel method can yield an approximate solution with an accuracy comparable to that of the one calculated by the serial method, and the computational time is reduced.

关键词： Stokes and Navier-Stokes equations Damping Variational inequality parallel algorithm Full domain partition Finite element

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：