This paper presents a parallel algorithm for solving grounded range search in associative-function mode using the BSP-like Coarse Grained Multicomputer (CGM). Given a set S of n weighted points in the plane, the algor...
详细信息
In this paper, we consider parallel algorithms for shortest paths and related problems on trapezoid graphs under the CREW PRAM model. Given a trapezoid graph with its corresponding trapezoid diagram, we present parall...
详细信息
For solving systems of linear algebraic equations with block fivediagonal matrices arising in geoelectrics and diffusion problems, the parallel matrix square root method, conjugate gradient method with pre-conditioner...
详细信息
For solving systems of linear algebraic equations with block fivediagonal matrices arising in geoelectrics and diffusion problems, the parallel matrix square root method, conjugate gradient method with pre-conditioner, conjugate gradient method with regularization, and parallel matrix sweep algorithm are proposed and some of them are implemented numerically on multi-core CPU Intel. Investigation of efficiency and optimization of parallel algorithms for solving the problem with quasi-model data are performed. The problem with quasi-model data is solved.
Scalable parallel computer architectures provide the computational performance needed for advanced computing problems in molecular biology. Many scientific challenges in molecular biology have associated with them a c...
详细信息
Techniques for parallel algorithms on chordal graphs are developed. An NC algorithm for recognizing chordal graphs is developed, as are NC algorithms for finding the following objects in chordal graphs: all maximal cl...
详细信息
Techniques for parallel algorithms on chordal graphs are developed. An NC algorithm for recognizing chordal graphs is developed, as are NC algorithms for finding the following objects in chordal graphs: all maximal cliques, an intersection graph representation, an optimal coloring, a perfect elimination scheme, a weighted maximum independent set, and a minimum clique cover. The recognition algorithm presented in this paper is simpler than previous algorithms given by Edenbrandt and by Chandrasekharan and Iyengar; the other problems were apparently open. The known polynomial-time algorithms for these problems seem highly sequential, and therefore a different approach to find parallel algorithms is used.
Moments constitute an important set of parameters for image analysis. The low order moments contain significant information about a simple object. They have been used in finding the location and orientation of an obje...
详细信息
Moments constitute an important set of parameters for image analysis. The low order moments contain significant information about a simple object. They have been used in finding the location and orientation of an object. Moment invariants have been used as features for pattern recognition. To compute moments of a two-dimensional image, a large number of multiplications and additions are required in a direct approach. Multiplications, which are the most time-consuming operations in simple processors, can be completely avoided in the proposed algorithms for low order moments. In this paper, parallel algorithms are proposed for efficient implementation in processor arrays. The basic idea is to decompose a 2-D moment into many vertical moments and a horizontal moment and to use the data parallelism for the vertical moments and the task parallelism for the horizontal moment.
We present in this paper two parallel algorithms for the two-dimensional discrete wavelet transform. A mathematical model for the computation vs. communication tradeoff for these algorithms is presented and the scalab...
详细信息
We present two parallel algorithms for solving linear recurrence systems R where m is relatively small, which can be simply implemented on message passing multiprocessors. Theorems concerning their time complexity are...
详细信息
The OTIS (Optical Transpose Interconnection System) is one of the efficient models of optoelectronic parallel computers. The OTIS-Hypercube is one of the popular models for optoelectronic parallel computer. In this pa...
详细信息
ISBN:
(纸本)1601320841
The OTIS (Optical Transpose Interconnection System) is one of the efficient models of optoelectronic parallel computers. The OTIS-Hypercube is one of the popular models for optoelectronic parallel computer. In this paper, we present two parallel algorithms for polynomial interpolation on a 64-processor OTIS- Hypercube interconnection network. We have considered N-data point polynomial interpolation on the above network with N processors. The algorithm for Lagrange polynomial interpolation requires (1.5N05 + 0.25N + 3) electronic moves + (N0.5 + 2) optical moves. However, assuming the availability of initial data points, it requires (1.5N0.5 + 0.25N) electronic moves + N0.5 optical moves. We have also shown our algorithm to be better that those in [15] in terms of AT cost.
暂无评论