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

第25届中国控制与决策会议

作者： Qingxia Li Wenhong Wei Department of Computer City College of Dongguan University of Technology School of Computer Dongguan University of Technology

ISBN: (纸本)9781467355339

This paper focuses on the proposed bucket structure, using communication mechanisms and data structures of parallel Boost Graph Library and parallel algorithm.design method, to propose a parallel single-source shortest path algorithm.based on bucket structure. In this algorithm. bucket structure is designed by bucket width parameter, the storage structure is designed by graph partition, information packets are transmitted by asynchronous parallel communication strategy, which makes our algorithm.has good parallel speedup ratio and scalability in solving all the single-source shortest path problems. At last the conclusions are verified by experiments.

关键词： Bucket Structure Single-Source Shortest Path parallel algorithm.

来源：评论

学校读者我要写书评

暂无评论

Improved parallel algorithm.for Minimum Cost Submodular Cover Problem 35

Improved Parallel Algorithm for Minimum Cost Submodular Cove...

引用

35th Conference on Learning Theory (COLT)

作者： Ran, Yingli Zhang, Zhao Tang, Shaojie Zhejiang Normal Univ Coll Math & Comp Sci Jinhua Zhejiang Peoples R China Univ Texas Dallas Naveen Jindal Sch Management Richardson TX 75083 USA

In the minimum cost submodular cover problem (MinSMC), we are given a monotone nondecreasing submodular function f : 2(V) -> Z(+), a linear cost function c : V -> R+, and an integer k <= f(V), the goal is to find a subset A subset of V with the minimum cost such that f(A) >= k. The MinSMC can be found at the heart of many machine learning and data mining applications. In this paper, we design a parallel algorithm.for the MinSMC that takes at most O(log(km) log k(logm+log log(mk))/epsilon(4)) adaptive rounds, and it achieves an approximation ratio of H(min{Delta,k})/1-5 epsilon with probability at least 1 - 3 epsilon, where Delta = max(v subset of V) f(v), H(center dot) is the Harmonic number, m = vertical bar V vertical bar, and epsilon is a constant in (0, 1/5).

关键词： minimum cost submodular cover approximation algorithm parallel algorithm.

来源：评论

学校读者我要写书评

暂无评论

The parallel 3D magnetotelluric forward modeling algorithm

引用

Applied Geophysics 2006年第4期3卷 197-202页

作者： Tan Handong Tong Tuo Lin Changhong State Key Laboratory of Geological Processes and Mineral Resources China University of Geosciences Beijing 100083China School of Geophysics and Information Technology China University of Geosciences Beijing 100083 China

The workload of the 3D magnetotelluric forward modeling algorithm.is so large that the traditional serial algorithm.costs an extremely large compute time. However, the 3D forward modeling algorithm.can process the data in the frequency domain, which is very suitable for parallel computation. With the advantage of MPI and based on an analysis of the flow of the 3D magnetotelluric serial forward algorithm. we suggest the idea of parallel computation and apply it. Three theoretical models are tested and the execution efficiency is compared in different situations. The results indicate that the parallel 3D forward modeling computation is correct and the efficiency is greatly improved. This method is suitable for large size geophysical computations.

关键词： Magnetotelluric 3D forward modeling MPI parallel programming design 3D staggered-grid finite difference method parallel algorithm.

来源：评论

学校读者我要写书评

暂无评论

A parallel Approach for Real-Time Power Flow in Distribution Networks

引用

Journal of Energy and Power Engineering 2013年第3期7卷 589-595页

作者： Rafael G. Milbradt Luciane N. Canha Pedro B. Zorrilla Alzenira R. Abaide Paulo R. Pereira Sandro R.Schmaedecke Centre of Studies in Energy and Power Systems Federal University of Santa Maria Santa Maria 97105-900 Brazil State Company of Electric Power Distribution of Rio Grande do Sul Porto Alegre 91410-900 Brazil

The new reality of smart distribution systems with use of generation sources of small and medium sizes brings new challenges for the operation of these systems. The complexity and the large number of nodes requires use of methods which can reduce the processing time of algorithm. such as power flow, allowing its use in real time. This paper presents a known methodology for calculating the power flow in three phases using backward/forward sweep method, and also considering other network elements such as voltage regulators, shunt capacitors and sources of dispersed generation of types PV （active power and voltage） and PQ （active and reactive power）. After that, new elements are introduced that allow the parallelization of this algorithm.and an adequate distribution of work between the available processors. The algorithm.was implemented using a multi-tiered architecture; the processing times were measured in many network configurations and compared with the same algorithm.in the serial version.

关键词： Distribution power flow real-time power flow distribution automation dispersed generation parallel algorithm.

来源：评论

学校读者我要写书评

暂无评论

Implementation of K-shortest Path algorithm.in GPU Using CUDA

引用

Procedia Computer Science 2015年 48卷 5-13页

作者： Avadhesh Pratap Singh Dhirendra Pratap Singh M. Tech Scholar MANIT Bhoapl MP India Assistant Professor MANIT Bhoapl MP India

K-shortest path algorithm.is generalization of the shortest path algorithm. K-shortest path is used in various fields like sequence alignment problem in molecular bioinformatics, robot motion planning, path finding in gene network where speed to calculate paths plays a vital role. parallel implementation is one of the best ways to fulfill the requirement of these applications. A GPU based parallel algorithm.is developed to find k number of shortest path in a positive edge-weighted directed large graph. In calculated shortest path repetition of the vertices is not allowed. Implemented algorithm.calculates a k-shortest path between two pair of vertices of a graph with n nodes and m vertices. This approach is based on Yen's algorithm.to find k-shortest loopless path. We implemented our algorithm. in Nvidia's GPU using Compute Unified Device Architecture (CUDA). This paper presents comparative analysis between CPU and GPU based implementation of Yen's algorithm. Our approach achieves the 6 time speed up in comparison of serial algorithm.

关键词： Compute Unified Device Architecture (CUDA) Graphical Processing Unit (GPU) Shortest path algorithm parallel algorithm.

来源：评论

学校读者我要写书评

暂无评论

非奇异M矩阵的判定及并行算法

引用

高等学校计算数学学报 2001年第4期23卷 357-362页

作者：郭希娟王常武王永茂孔令富燕山大学信息工程学院燕山大学信息工程学院秦皇岛066004

In this paper effective method to judge a M-matrix is presented. Its parallel algorithm.and realization problem are also studied.

关键词： M-matrix positive definite matrix parallel algorithm.

来源：评论

学校读者我要写书评

暂无评论

奇异H-矩阵并行算法

引用

高等学校计算数学学报 2000年第1期22卷 10-15页

作者：王川龙张来成山西大学师范学院数学系!太原030012 山西财经大学信息工程系!太原030006

In this paper, we discuss the sign characteristics and the splittings of singular H-matrix. Based on these results, parallel multisplitting algorithm. for singular linear systems of algebraic equations are established... 详细信息

关键词： Singular H-matrix multisplitting parallel algorithm.

来源：评论

学校读者我要写书评

暂无评论

模拟退火算法的原理及实现

引用

高等学校计算数学学报 1999年第3期21卷 212-218页

作者：谢云荆州师范学院计算机系!湖北荆州434104

In this paper, a summary on principle, realizable form, asymptotic convergence, applications, and parallel tactics of the simulated annealing algorithm.is given. A concise, overall, objective, summarily appraisal on t... 详细信息

关键词： Simulated annealing algorithm combinatorial optimization problem nondeterministic polynomial complete problem parallel algorithm.

来源：评论

学校读者我要写书评

暂无评论

Rescue Robot Navigation in Grid Computing Environment

Rescue Robot Navigation in Grid Computing Environment

引用

The 2011 International Conference on Materials Engineering for Advanced Technologies(ICMEAT 2011)

作者： Wei Wang Huiyan Wang Shenjie Jia Shimin Wei Department of Instrument Institute of Disaster Prevention Science and Technology

.To obtain the optimal path in a unknown disaster field,a rescue robot needs to build an environment mapThe information of the disaster field is collected by the sonsors of different robots, all signal from sensors(mounted on all robots and signal form GPS) are sent to the bakeside parllel processors with wireless networkA grid computing environment serves as the backside parallel processors with Globus Toolkit, the grid computing processor process all the signals and construct the global map to help robot for navigation path *** rescue robot get control signal from the grid computing processor with wireless network,thus, the robot is not necessary to be sophisticatedNew computing methods are given for parallel algorithm.on grid environmentThe navigation control is implemented with the cooperation among heterogeneous agents, the advantages of large seale computing on grid are shown.

关键词： grid computing globus Toolkit rescue robot wireless network parallel algorithm.

来源：评论

学校读者我要写书评

暂无评论

关于二分法的一点注记

引用

华中科技大学学报(自然科学版) 1988年第5期 153-155页

作者：王能超华中理工大学数学系

1.文献[1]、[2]提出了设计并行算法的一种基本技术——所谓二分技术。在设计二分算法时,我们曾假设“处理机台数不受限制,即可按算法并行化需要提供足够多台处理机”。这似乎是一项理想化的假设,因为实际并行机系统所提供的处理机台数... 详细信息

1.文献[1]、[2]提出了设计并行算法的一种基本技术——所谓二分技术。在设计二分算法时,我们曾假设“处理机台数不受限制,即可按算法并行化需要提供足够多台处理机”。这似乎是一项理想化的假设,因为实际并行机系统所提供的处理机台数总是确定的,不一定能达到算法所要求的“处理机台数界”。因之可能认为:上述关于处理机台数界不受限制的假设限制了二分法的应用范围。其实这是一种误解。我们知道,传统的串行算法之所以不一定适应新一代的计算机,是因为其并行性差。譬如递推计算只能由单处理机承担。为了充分发挥多台处理机的作用,就必须大力开发算

关键词： Bisection method parallel algorithm.

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：