Conflict graph is used as the major tool in various algorithms [14]-[18] for solving the phylogenetic network problem. The over all time complexity of these algorithms mainly depends on the construction of the conflic...
详细信息
ISBN:
(纸本)9783540770459
Conflict graph is used as the major tool in various algorithms [14]-[18] for solving the phylogenetic network problem. The over all time complexity of these algorithms mainly depends on the construction of the conflict graph. In this paper, we present a parallel algorithm for building a conflict graph. Given a set of n binary sequences, each of size m, our algorithm is mapped on a triangular array in O(n) time using O(m) processors.
A new approach for fast parallel reductions on trees over distributed memory environments is proposed. By employing serialized trees as the data representation, our algorithm has a communication-efficient BSP implemen...
详细信息
ISBN:
(纸本)9783540725855
A new approach for fast parallel reductions on trees over distributed memory environments is proposed. By employing serialized trees as the data representation, our algorithm has a communication-efficient BSP implementation regardless of the shapes of inputs. The prototype implementation supports its real efficacy.
We develop an MPI-based parallel algorithm to implement the real space Green's function technique for calculating the vibrational density of states corresponding to a solid. The Hamiltonian describing the interact...
详细信息
We develop an MPI-based parallel algorithm to implement the real space Green's function technique for calculating the vibrational density of states corresponding to a solid. The Hamiltonian describing the interactions between the atoms within the system is obtained from the embedded atom method. The parallel implementation speeds up calculation by an order of magnitude. The parallel implementation details and results are presented in this paper.
This paper proposes a new parallel algorithm for the maximal elements problem with no constraints. It is proposed for a Linear Array with Reconfigurable Pipellned Bus System (LARPBS) model and on its latest variant, L...
详细信息
ISBN:
(纸本)9781424407156
This paper proposes a new parallel algorithm for the maximal elements problem with no constraints. It is proposed for a Linear Array with Reconfigurable Pipellned Bus System (LARPBS) model and on its latest variant, LARPBS(p) model also. It runs in O(log log n . log n) time with O(n) processors. Its significance is that it works for any instance of the problem with no constraint laid in [2].
Suffix arrays are a simple and powerful data structure for text processing that can be used for full text indexes, data compression, and many other applications in particular in bioinformatics. We describe the first i...
详细信息
ISBN:
(纸本)354039110X
Suffix arrays are a simple and powerful data structure for text processing that can be used for full text indexes, data compression, and many other applications in particular in bioinformatics. We describe the first implementation and experimental evaluation of a scalable parallel algorithm. for suffix array construction. The implementation works on distributed memory computers using MPI, Experiments with up to 512 processors show good constant factors and make it look likely that the algorithm could also be adapted to even larger systems. This makes it possible to build suffix arrays for huge inputs very quickly. Our algorithm is a parallelization of the linear time DC3 algorithm. (C) 2007 Elsevier B.V. All rights reserved.
This paper is devoted to a novel stochastic generalized cellular automata (GCA) for self-organizing data clustering in enterprise computing. The GCA transforms the data clustering process into a stochastic process ove...
详细信息
This paper is devoted to a novel stochastic generalized cellular automata (GCA) for self-organizing data clustering in enterprise computing. The GCA transforms the data clustering process into a stochastic process over the configuration space on a GCA array. The GCA-based approach to data clustering has many advantages in terms of the real-time performance and the ability to effectively deal with a variety of data sets, including noise data, dynamical data, multi-type and multi-distribution data, high-dimensional and large-scale data set. The GCA clustering approach also has the learning ability, and the better feasibility for hardware implementation with VLSI systolic technology. The simulations and comparisons have shown the effectiveness of the proposed GCA for the data clustering in enterprise computing. (c) 2006 Elsevier B.V. All rights reserved.
We propose implementing a parallel EA on consumer graphics cards, which we can find in many PCs. This lets more people use our parallel algorithm to solve large-scale, real-world problems such as data mining. parallel...
详细信息
We propose implementing a parallel EA on consumer graphics cards, which we can find in many PCs. This lets more people use our parallel algorithm to solve large-scale, real-world problems such as data mining. parallel evolutionary algorithms run on consumer-grade graphics hardware achieve better execution times than ordinary evolutionary algorithms and offer greater accessibility than those run on high-performance computers
In this paper, we solve the k-dimensional all nearest neighbor (kD_ANN) problem, where k = 2 or 3, on a linear array with a reconfigurable pipelined bus system (LARPBS) from image processing perspective. First, for a ...
详细信息
In this paper, we solve the k-dimensional all nearest neighbor (kD_ANN) problem, where k = 2 or 3, on a linear array with a reconfigurable pipelined bus system (LARPBS) from image processing perspective. First, for a two-dimensional (2D) binary image of size N x N, we devise an algorithm for solving the 2D_ANN problem using a LARPBS of size N2+epsilon, where 0 < epsilon << 1. Then, for a three-dimensional (3D) binary image of size N x N x N, we devise an algorithm for solving the 3D_ANN problem using a LARPBS of size N3+epsilon, where 0 < epsilon < 1. To the best of our knowledge, all results derived above are the best O(1) time 2D_ANN and 3D_ANN algorithms on the LARPBS model known. (C) 2007 Elsevier Inc. All rights reserved.
Let {T-i}(i = 1)(N) be N strict pseudo-contractions defined on a closed convex subset C of a real Hilbert space H. Consider the problem of finding a common fixed point of these mappings and consider the parallel and c...
详细信息
Let {T-i}(i = 1)(N) be N strict pseudo-contractions defined on a closed convex subset C of a real Hilbert space H. Consider the problem of finding a common fixed point of these mappings and consider the parallel and cyclic algorithms for solving this problem. We will prove the weak convergence of these algorithms. Moreover, by applying additional projections, we further prove that these algorithms can be modified to have strong convergence. (C) 2006 Elsevier Ltd. All rights reserved.
暂无评论