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

PCR algorithm for parallel computing minimum-norm (T) least-squares (S) solution of inconsistent linear equations

APPLIED MATHEMATICS AND COMPUTATION 2002年第2-3期133卷 547-557页

作者： Wei, YM Wang, GR Fudan Univ Dept Math Shanghai 200433 Peoples R China Shanghai Normal Univ Dept Math Shanghai Peoples R China

This paper presents a new highly parallel algorithm for computing the minimum-norm (T) least-squares (S) solution of inconsistent linear equations Ax = b(A is an element of R-r(mxn), b is an element of R(A)). By this algorithm the solution x = A(S,T)(+)b is obtained in T = (1 + m)(1 + log(2) m) + n (6 + log(2)(n - r + 1) + log(2) m + log(2) n) - r(1 + log(2) n) steps with P = mn processors when m greater than or equal to 2(n - 1) and with P = 2n(n - 1) processors otherwise. (C) 2002 Elsevier Science Inc. All rights reserved.

关键词： parallel algorithm the minimum-norm (T) least-squares (S) solution inconsistent linear equations weighted Moore-Penrose inverse time complexity

来源：评论

学校读者我要写书评

暂无评论

A parallel domain decomposition algorithm of mixed element equation for second-order elliptic Dirichlet boundary value problem

引用

APPLIED MATHEMATICS AND COMPUTATION 2002年第2-3期129卷 375-389页

作者： Yang, DP Shandong Univ Dept Math Jinan 250100 Shandong Peoples R China

A parallel domain decomposition algorithm of Schwarz type is introduced to solve the mixed finite element equation for the Dirichlet boundary value problem of a second-order partial differential equation of elliptic t... 详细信息

关键词： parallel algorithm mixed finite element equation domain decomposition convergence analysis

来源：评论

学校读者我要写书评

暂无评论

A parallel algorithm for simulation of large neural networks

引用

JOURNAL OF NEUROSCIENCE METHODS 2000年第2期98卷 123-134页

作者： Thomas, EA Univ Melbourne Dept Physiol Parkville Vic 3010 Australia

The simulation of biologically realistic neural networks requires the numerical solution of very large systems of differential equations. Variables within the system can be changing at rates that vary by orders of magnitude, not only at different times of the solution, but at the same time in different parts of the network. Therefore, an efficient implementation must be able to vary the solution step size, and do so independently in different subsystems. A single processor algorithm is presented in which each neuron can be solved with its own step size by using a priority queue to integrate them in the correct order. But this leaves the problem of how communication and synchronisation between neurons should be managed when executing in parallel. The proposed solution uses an algorithm based on waveform relaxation, which allows groups of neurons on different processors to be solved independently and hence in parallel, for substantial parts of the computation. Realistic test problems were run on a distributed memory parallel computer and results show that speedups of 10 using 16 processors are achievable, and indicate that further speedups may be possible. (C) 2000 Elsevier Science B.V. All rights reserved.

关键词： computer simulation neural networks neural simulation parallel algorithm waveform relaxation

来源：评论

学校读者我要写书评

暂无评论

A New parallel algorithm in Power Flow Calculation:Dynamic Asynchronous parallel algorithm

引用

Journal of Modern Transportation 2000年第2期17卷 145-151页

作者：刘学军钱清泉刘军 Institute of Railway Electrification and Automation Southwest Jiaotong University Chengdu610031 China

Based on the general methods in power flow calculation of power system and on conceptions and classifications of parallel algorithm, a new approach named Dynamic Asynchronous parallel algorithm that applies to the online analysis and real-time dispatching and controlling of large-scale power network was put forward in this paper. Its performances of high speed and dynamic following have been verified on IEEE-14 bus system.

关键词： power flow calculation parallel algorithm MAT

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of a parallel Cascade Semijoin Alogrithm for Computing Path Expressions in Object Database Systems

引用

Journal of Computer Science & Technology 2002年第2期17卷 140-151页

作者：王国仁于戈 SchoolofInformationScienceandEngineering NortheasternUniversityShenyang110006P.R.China

With the emerging of new applications,especially in Web,Such as E-Commerce,Digital Library and DNA Bank,object database systems show their stronger funcitons than other kinds of database systems due to their powerful representation ability on complex semantics and *** distinguished feature of object database systems is path expression,and most queries on an object database ar based on path expression because it is the most natural and convenient way to access the object databse,for example,to navigate the hyper-links in a web-based database,The execution of path expression is usually extremely expensive on a very large ***,the improvement of path expression eecution efficiency is critical for the performance ofobject *** an importan approach realizing high-performance query processing ,the parallel processing of path expression on distributed object databases is explored in this *** to now,some algorithms about how to compute path expressions and how to optimize path expression processing have been proposed for ***,few approaches have been presented for computing path expressions in *** this paper,a new paralle algorithm for computing path expression named parallel Cascade Semijoin(PCSJ)is ***,a new scheduling strategy called right-deep zigzag tree is designed to further improve the performance of the PCSJ *** exper-iments have been implemented in an NOW distributed and parallel *** results show that the PCSJ algorithm outperforms the other two parallel algorithms(the parallel version of forward pointer chasing algorithm(PFPC)and the index splitting parallel algorithm(IndexSplit) when computing path expressions with restrictive predicates and that the right-deep zigzage tree scheduling strategy has better performance than the right-deep tree scheduling strategy.

关键词： object database path expression parallel algorithm scheduling strategy

来源：评论

学校读者我要写书评

暂无评论

parallel mining of outliers in large database

引用

DISTRIBUTED AND parallel DATABASES 2002年第1期12卷 5-26页

作者： Hung, E Cheung, DW Univ Hong Kong Dept Comp Sci & Informat Syst Hong Kong Hong Kong Peoples R China

Data mining is a new, important and fast growing database application. Outlier (exception) detection is one kind of data mining, which can be applied in a variety of areas like monitoring of credit card fraud and criminal activities in electronic commerce. With the ever-increasing size and attributes (dimensions) of database, previously proposed detection methods for two dimensions are no longer applicable. The time complexity of the Nested-Loop (NL) algorithm (Knorr and Ng, in Proc. 24th VLDB, 1998) is linear to the dimensionality but quadratic to the dataset size, inducing an unacceptable cost for large dataset. A more efficient version (ENL) and its parallel version (PENL) are introduced. In theory, the improvement of performance in PENL is linear to the number of processors, as shown in a performance comparison between ENL and PENL using Bulk Synchronization parallel (BSP) model. The great improvement is further verified by experiments on a parallel computer system IBM 9076 SP2. The results show that it is a very good choice to mine outliers in a cluster of workstations with a low-cost interconnected by a commodity communication network.

关键词： data mining outlier detection parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

parallel prefix computation on extended multi-mesh network

引用

INFORMATION PROCESSING LETTERS 2002年第6期84卷 295-303页

作者： Jana, PK Naidu, BD Kumar, S Arora, M Sinha, BP Indian Sch Mines Dept Comp Sci & Engn Dhanbad 826004 Bihar India CReWMaN Lab Arlington TX 76019 USA Indian Stat Inst Adv Comp & Microelect Unit Kolkata 700035 W Bengal India

A parallel algorithm for prefix computation of N = n(4) elements on an n x n extended multi-mesh network is presented. The A parallel algorithm for prefix computation of N = n(4) network is a modified version of an earlier multi-mesh network with a 4-regular structure. The algorithm takes O(N-1/4) time on N processors (13N(1/4)-5 communication steps and log N + 4 arithmetic/logic steps). (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： prefix computation multi-mesh network parallel algorithm time complexity associative binary operation

来源：评论

学校读者我要写书评

暂无评论

New method for parallel computation of Hessian matrix of conformational energy function in internal coordinates

引用

JOURNAL OF COMPUTATIONAL CHEMISTRY 2002年第4期23卷 463-469页

作者： Nakamura, S Kyono, D Ikeguchi, M Shimizu, K Univ Tokyo Dept Biotechnol Bunkyo Ku Tokyo 1138657 Japan Yokohama City Univ Grad Sch Integrated Sci Sci Biol Supermol Syst Kanagawa 2300045 Japan

A new algorithm for parallel calculation of the second derivatives (Hessian) of the conformational energy function of biomolecules in internal coordinates is proposed. The basic scheme of this algorithm is the division of the entire calculation of the Hessian matrix (called "task") into subtasks and the optimization of the assignment of processors to each subtask by considering both the load balancing and reduction of the communication cost. A genetic algorithm is used for this optimization considering the dependencies between subtasks. We applied this method to a glutaminyl transfer RNA (Gln-tRNA) molecule for which the scalability of our previously developed parallel algorithm was significantly decreased when the large number of processors was used. The speedup for the calculation was 32.6 times with 60 processors, which is considerably better than the speedup for our previously reported parallel algorithm. The elapsed time for the calculation of subtasks, data sending, and data receiving was analyzed, and the effect of the optimization using the genetic algorithm is discussed. (C) 2002 John Wiley Sons, Inc.

关键词： internal coordinates Hessian parallel algorithm genetic algorithm optimization of processor assignment

来源：评论

学校读者我要写书评

暂无评论

A parallel residue-to-binary converter for the moduli set {2^m-1,2^20m+1,2^21m+1, ..., 2^2km+1}

引用

VLSI DESIGN 2002年第2期14卷 183-191页

作者： Wang, W Swamy, MNS Ahmad, MO Wang, YK Concordia Univ Dept Elect & Comp Engn Ctr Commun & Signal Proc Montreal PQ H3G 1M8 Canada Univ Texas Dept Comp Sci Richardson TX 75083 USA

In this paper, a high-speed parallel residue-to-binary converter is proposed for a recently introduced moduli set S(k) = {2(m) - 1, 2(20m) + 1, 2(21m) + 1, ..., 2(2km) + 1} for a general value of k. The proposed converter uses simple cyclic shift and concatenation operations and does not require any multiplier. Individual converters for the cases of k = 0 and k = 1 are derived from the general architecture and compared with those existing in the literature. The converter for S(0) is twice as fast requiring only one-half of the hardware, while that of S(1) is three times as fast, but requiring only 60% of the hardware, as compared to the corresponding ones existing in the literature. Furthermore, the proposed converters are implemented using 0.5-micron CMOS VLSI technology. Based on S(0), the layouts for 8-bit, 16-bit, 32-bit and 64-bit converters are generated, and the corresponding simulation results obtained.

关键词： VLSI implementation computer arithmetic parallel algorithm residue number system Chinese remainder theorem digital signal processing

来源：评论

学校读者我要写书评

暂无评论

parallel implementation of the fluid particle model for simulating complex fluids in the mesoscale

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2002年第2期14卷 137-161页

作者： Boryczko, K Dzwinel, W Yuen, DA AGH Univ Sci & Technol Inst Comp Sci PL-30059 Krakow Poland Univ Minnesota Minnesota Supercomp Inst Minneapolis MN 55415 USA

Dissipative particle dynamics (DPD) and its generalization-the fluid particle model (FPM)-represent the 'fluid particle' approach for simulating fluid-like behavior in the mesoscale. Unlike particles from the molecular dynamics (MD) method, the 'fluid particle' can be viewed as a 'droplet' consisting of liquid molecules. In the FPM, 'fluid particles' interact by both central and non-central, short-range forces with conservative, dissipative and Brownian character. In comparison to MD, the FPM method in three dimensions requires two to three times more memory load and a three times greater communication overhead. Computational load per step per particle is comparable to MD due to the shorter interaction range allowed between 'fluid particles' than between MD atoms. The classical linked-cells technique and decomposing the computational box into strips allow for rapid modifications of the code and for implementing non-cubic computational boxes. We show that the efficiency of the FPM code depends strongly on the number of particles simulated, the geometry of the box and the computer architecture. We give a few examples from long FPM simulations involving up to 8 million fluid particles and 32 processors. Results from FPM simulations in three dimensions of the phase separation in binary fluid and dispersion of the colloidal slab are presented. A scaling law for symmetric quench in phase separation has been properly reconstructed. We also show that the microstructure of dispersed fluid depends strongly on the contrast between the kinematic viscosities of this fluid phase and the bulk phase. This FPM code can be applied for simulating mesoscopic flow dynamics in capillary pipes or critical flow phenomena in narrow blood vessels. Copyright (C) 2002 John Wiley Sons, Ltd.

关键词： fluid particles parallel algorithm checkerboard periodic boundary conditions phase separation dispersion blood flow simulation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：