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

International Conference on Information Technology and Computer Science

作者： Yang, Linfeng Jian, Jinbao Li, Taoshen Guangxi Univ Sch Elect Engn Nanning 530004 Peoples R China

ISBN: (纸本)9780769536880

This paper presents the huge but useful formulation of expected security cost optimal power flow (ESC-OPF). Corrector equation, which has special structure, of interior-point method (IPM) for ESC-OPF has been given. A novel parallel IPM based on Multiple Centrality Weighted Correctors (MCWC) has been proposed to solve the formulation of this ESC-OPF model. In our novel algorithm, with the cooperation of MCWC and parallel solver for corrector equation, iterative times can be reduced and CPU time can be shut down because of the good speedup.

关键词： Interior-point method expected security cost-OPF parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

Finite Difference parallel Schemes Based on Follow-flow Scheme for KdV Equation

Finite Difference Parallel Schemes Based on Follow-flow Sche...

引用

The 2010 International Conference on Computer Application and System Modeling(2010计算机应用与系统建模国际会议 ICCASM 2010)

作者： Ruimin Zhao Wenzhang He Geyang Guo Department of Mathematics Tianjin University of Technology and Education Tianjin China

ISBN: (纸本)9781424472352

A group of Saul'yev asymmetric difference schemes based on follow-flow scheme to approach KdV equation is given here. Using these new asymmetric difference schemes, we construct the parallel alternating group schemes based on follow-flow scheme, which are absolutely stable by analysis of linearization procedure. Numerical experiments for the cases of single soliton solution and double soliton solution are performed, which show that the accuracy and stability of the schemes are better than parallel algorithms existed.

关键词： KdV equationt follow-flow scheme parallel algorithm absolutely stable

来源：评论

学校读者我要写书评

暂无评论

Research on parallel HW/SW Partitioning Based on Hybrid PSO algorithm

引用

9th International Conference on algorithms and Architectures for parallel Processing

作者： Wu, Yue Zhang, Hao Yang, Hongbin Shanghai Univ Sch Engn & Comp Sci Shanghai 200072 Peoples R China

ISBN: (纸本)9783642030949

Generally, Hardware/Software (HW/SW) partitioning can be approximately resolved through some kinds of optimal algorithms. Based oil both characteristics of HW/SW partitioning and Particle Swarm Optimization (PSO) algorithm, a novel parallel FlW/SW partitioning method is proposed in this paper. A model of parallel HW/SW partitioning on the basis of PSO algorithm is established after analyzing the particularity of HW/SW partitioning. A hybrid strategy of PSO and Tabu Search (TS) is proposed in this paper, which uses the intrinsic parallelism of PSO and the memory function of TS to speed tip and improve the performance of PSO. To settle the problem of premature convergence, the reproduction and crossover operation of genetic algorithm (GA) is also introduced into procedure of PSO. Experimental results indicate that the parallel PSO algorithm can efficiently reduce the running time even for large task graphs.

关键词： SoC HW/SW partitioning particle swarm optimization algorithm Tabu search parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

An Effective Scheduling algorithm for Linear Makespan Minimization on Unrelated parallel Machines

An Effective Scheduling Algorithm for Linear Makespan Minimi...

引用

16th International Conference on High Performance Computing (HiPC 2009)

作者： Fan, Liya Zhang, Fa Wang, Gongming Liu, Zhiyong Chinese Acad Sci Comp Technol Inst Beijing Peoples R China

ISBN: (纸本)9781424449217

A simple yet common scheduling problem is identified, as a special case of the R parallel to C-max problem. We name it Linear Makespan Minimization on Unrelated parallel Machines (LMMUPM). A novel algorithm, MOBSA (Multi-Objective Based Scheduling algorithm), is presented to solve it. Two auxiliary problems are introduced as the basis of our algorithm. The first one can be reduced to a Multi-Objective Integer Program, while the second is constructed based on the solution of the first one. Results on random datasets revealed that MOBSA produced smaller and more stable makespans than other scheduling algorithms. Additionally, the makespan produced by MOBSA was within 1% of the optimum for every case. Presently, MOBSA has been applied to parallelize EMAN, one of the most popular software packages for cryo-electron microscopy single particle reconstruction. High speedups and ideal load balancing have been obtained. It is expected that MOBSA is also applicable to other similar applications.

关键词： load balancing scheduling algorithm parallel algorithm makespan minimization

来源：评论

学校读者我要写书评

暂无评论

Fractal Graphics parallel Design and Analysis

Fractal Graphics Parallel Design and Analysis

引用

The Ninth International Symposium on Distributed Computing and Applications to Business,Engineering and Science

作者： Wenjing LI,Zhenxiong LAN,Ruliang WANG, Weizhi LIAO (College of Computer and Information Engineering, Guangxi Teachers Education University,Nanning, 530001,China)

The paper introduced recursive algorithm of fractal graphics,put forward fractal graphics parallel algorithm. Analyzing recursive algorithmic time complexity and speedup rate of the parallel *** experimental results of PC cluster show that the theoretical analysis and the experimental results of fractal graphics parallel algorithm are consistency with a marked speedup rate.

关键词： Fractal Graphics Recursive algorithm parallel algorithm Complexity Analysis Speedup rate

来源：评论

学校读者我要写书评

暂无评论

OpenMP parallel Optimal Path algorithm and Its Performance Analysis

OpenMP Parallel Optimal Path Algorithm and Its Performance A...

引用

World Congress on Software Engineering

作者： Cao, Han Wang, Fei Fang, Xin Tu, Hong-lei Shi, Jun Shaanxi Normal Univ Dept Comp Sci Xian Peoples R China Beijing Normal Univ Coll Informat Tech Beijing 100875 Peoples R China

ISBN: (纸本)9780769535708

With the research and application of Intelligent Transportation System, there is a higher requirement for solving the optimal path problem in large scale transportation networks in real time. In order to get the effective optimal path algorithms for the actual transportation networks, three optimal path algorithms are chosen to be parallelized. The parallel optimal path algorithms are then implemented based on dual-core processor and the speed-up ratio and efficiency of parallel algorithms are tested and analyzed in actual Xi'an road networks with 4525 nodes and 6616 paths. The experiment results show that the parallel algorithms devised in this paper are efficient and the speed-up ratio of the three parallel algorithms are satisfied in solving optimal path problems in large scale networks.

关键词： Dijkstra algorithm A* algorithm parallel algorithm openMP multi-core

来源：评论

学校读者我要写书评

暂无评论

A new parallel algorithm of MP2 energy calculations

引用

JOURNAL OF COMPUTATIONAL CHEMISTRY 2006年第4期27卷 407-413页

作者： Ishimura, K Pulay, P Nagase, S Inst Mol Sci Dept Theoret Mol Sci Okazaki Aichi 4448585 Japan Univ Arkansas Dept Chem & Biochem Fayetteville AR 72701 USA

A new parallel algorithm has been developed for second-order Moller-Plesset perturbation theory (MP2) energy calculations. Its main projected applications are for large molecules, for instance, for the calculation of dispersion interaction. Tests on a moderate number of processors (2-16) show that the program has high CPU and parallel efficiency. Timings are presented for two relatively large molecules, taxol (C47H51NO14) and luciferin (C11H8N2O3S2), the former with the 6-31G* and 6-311G** basis sets (1032 and 1484 basis functions, 164 correlated orbitals), and the latter with the aug-cc-pVDZ and aug-cc-pVTZ basis sets (530 and 1198 basis functions, 46 correlated orbitals). An MP2 energy calculation on C130H10 (1970 basis functions, 265 con-elated orbitals) completed in less than 2 h on 128 processors. (c) 2006 Wiley Periodicals, Inc.

关键词： MP2 energy parallel algorithm large molecule

来源：评论

学校读者我要写书评

暂无评论

Novel algorithm for simulation of 3 D quantum reactive atom-diatom scattering

引用

Procedia Computer Science 2010年第1期1卷 1195-1201页

作者： A.S. Gevorkyan G.G. Balint-Kurti G. Nyman Institute for Informatics and Automation Problems NAS of Armenia 1 P. Sevak Str. 0014 Yerevan Armenia Joint Institute for Nuclear Research 141980 Dubna Moscow reg. Russia Center for Computational Chemistry School of Chemistry University of Bristol Bristol BS8 1TS UK University of Gothenburg Department of Chemistry SE-412 96 Gothenburg Sweden

A new approach is described to the evaluation of the quantum scattering S-matrix in 3 D atom-diatom reactive collision. The theory is developed in terms of natural collision coordinates where the coordinate reaction fulfills the same role as a time in a time-dependent scattering formulation. Having written the full wavefunction of the particles system in the coupled-channel representation we have proved that the 3 D multi-channel scattering problem can be reduced to the inelastic single-arrangement problem which is described by system of ordinary dierential equations (ODE) of second order. The system of coupled-channel second order ODEs exactly is reduced to the system of integro-dierential equations (IDE) of first order which is solved with the initial conditions. The problem of Koshi for the system of IDEs is proposed to be solved by the method of Runge-Kutta of fourth order. The detailed algorithm for parallel simulation of initial 3 D scattering problem is proposed. In result of simulation of IDEs the full wavefunction and all S-matrix elements of reactive transitions and state-to-state cross section are obtained simultaneously without other extra calculations.

关键词： 3 D quantum reactive scattering S-matrix elements Coupled-channel dierential equation Integro-dierential equations Runge-Kutta method parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

A parallel algorithm for 3D dislocation dynamics

引用

JOURNAL OF COMPUTATIONAL PHYSICS 2006年第2期219卷 608-621页

作者： Wang, Zhiqiang Ghoniem, Nasr Swaminarayan, Sriram LeSar, Richard Univ Calif Los Angeles Los Angeles CA 90095 USA Los Alamos Natl Lab Los Alamos NM 87545 USA

Dislocation dynamics (DD), a discrete dynamic simulation method in which dislocations are the fundamental entities, is a powerful tool for investigation of plasticity, deformation and fracture of materials at the micron length scale. However, severe computational difficulties arising from complex, long-range interactions between these curvilinear line defects limit the application of DD in the study of large-scale plastic deformation. We present here the development of a parallel algorithm for accelerated computer simulations of DD. By representing dislocations as a 3D set of dislocation particles, we show here that the problem of an interacting ensemble of dislocations can be converted to a problem of a particle ensemble, interacting with a long-range force field. A grid using binary space partitioning is constructed to keep track of node connectivity across domains. We demonstrate the computational efficiency of the parallel micro-plasticity code and discuss how O(N) methods map naturally onto the parallel data structure. Finally, we present results from applications of the parallel code to deformation in single crystal fee metals. (c) 2006 Elsevier Inc. All rights reserved.

关键词： 3D dislocation dynamics parallel algorithm single crystal plasticity large scale simulation

来源：评论

学校读者我要写书评

暂无评论

A parallel algorithm for band linear systems

引用

APPLIED MATHEMATICS AND COMPUTATION 2006年第1期181卷 40-47页

作者： Cui Xining Lu Quanyi Northwestern Polytech Univ Dept Appl Math Xian 710072 Peoples R China Xian Inst Finance & Econ Sch Stat Xian 710061 Peoples R China

The work presented in this paper focuses on parallel iterative algorithm for solving band linear systems. With suitable decomposition of coefficient matrix and using the form of the iterative formula of the BSOR serial method, a parallel algorithm on distributed-memory multi-computer is established. Then Eq. (7) and (8) are provided for carrying out computation required by our parallel algorithm. Furthermore, convergence is proved when the coefficient matrix A is Hermite positive definite matrix or M-matrix, and the sufficient condition is given. According to theoretical analysis, this algorithm has the same convergent velocity as BSOR method, and has the same parallelism as BJ method. In the end, two illustrative examples implemented on HP rx2600 cluster show that our algorithm's parallel acceleration rates and efficiency are higher. (c) 2006 Elsevier Inc. All rights reserved.

关键词： parallel algorithm band linear systems BSOR method HP rx2600 cluster

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：