A synchronised parallel algorithm for the strong connectivity augmentation problem is presented. Its depth is 0(logn) using 0(n3) processors on a concurrent read, concurrent write parallel random access machine.
A synchronised parallel algorithm for the strong connectivity augmentation problem is presented. Its depth is 0(logn) using 0(n3) processors on a concurrent read, concurrent write parallel random access machine.
This paper discusses microplane models from the computational point of view. The basic introduction to microplane based models will be given. The computational aspects of these models will be discussed in details and ...
详细信息
This paper discusses microplane models from the computational point of view. The basic introduction to microplane based models will be given. The computational aspects of these models will be discussed in details and an efficient parallel algorithm for explicit time integration will be proposed. The efficiency of the algorithm will be presented. (C) 2002 Civil-Comp Ltd. and Elsevier Science Ltd. All rights reserved:
In this paper, we show a simple parallel algorithm for polynomial evaluation. By this method, we only need 2N/p + log(2) p steps on p processors (where p less than or equal to O(N-1/2)) to evaluate a polynomial of deg...
详细信息
In this paper, we show a simple parallel algorithm for polynomial evaluation. By this method, we only need 2N/p + log(2) p steps on p processors (where p less than or equal to O(N-1/2)) to evaluate a polynomial of degree N on an SIMD computer or an MIMD computer, which is a decrease of log(2) p steps as compared with the p-order Homer method [S. Lakshmivarahan and S. K. Dhall, Analysis and Design of parallel algorithms, McGraw-Hill, New York, 1990], and also a decrease of (2log(2) p)1/2 steps as compared with some other algorithms on an MIMD computer [J. I. Munro and M. Paterson, J. Comput. System Sci., 7 (1973), pp. 189-198, K. Maruyama, IEEE Trans. Comput., C-22 (1973), pp. 2-5]. The new algorithm is simple in structure and easy to implement.
The paper proposes a parallel algorithm for solving the graph-subgraph isomorphism problem and makes an experimental study of its efficiency. The problem is one of the most well-known NP-complete problems. Its solutio...
详细信息
The paper proposes a parallel algorithm for solving the graph-subgraph isomorphism problem and makes an experimental study of its efficiency. The problem is one of the most well-known NP-complete problems. Its solution may be required when solving many practical problems associated with the study of complex structures. We solve the problem in a formulation that requires finding all the existing isomorphic substitutions or proving their absence. Due to the complexity of the problem, it is natural to want to speed up its solution by parallelizing the algorithm. We use the RPM_ParLib library, developed by the author, as the main tool to program the algorithm. This library allows us to develop effective applications for parallel computing on a local network under the control of the runtime environment .NET Framework. Due to this library, the applications have the ability to generate parallel branches of computation directly during program execution and dynamically redistribute work between computing modules. Any language with support of the .NET Framework can be used as a programming language in conjunction with this library. For the numerical experiment, an open database from the Internet was used, which was specially developed to study algorithms for searching for isomorphic substitutions. The author has also developed a special application in C# for generating additional sets of initial data with the specified characteristics. The aim of the experiment is to study the speedup achieved due to the recursively parallel organization of computations. This paper provides a detailed description of the proposed algorithm and the results obtained during the experiment.
A parallel algorithm is proposed in this paper for solving the problem $\min \{ q(x)|x \in C_1 \cap \cdots \cap C_m \} $ where q is an uniformly convex function and $C_i$ are closed convex sets in $R^n$. In each it...
详细信息
A parallel algorithm is proposed in this paper for solving the problem $\min \{ q(x)|x \in C_1 \cap \cdots \cap C_m \} $ where q is an uniformly convex function and $C_i$ are closed convex sets in $R^n$. In each iteration of the method, we solve in parallel m independent subproblems, each minimizing a definite quadratic function over an individual set $C_i$. The method has attractive convergence properties and can be implemented as parallel algorithms for tackling definite quadratic programs, linear programs, systems of linear equations and systems of generalized nonlinear inequalities.
In this paper a parallel algorithm to solve the stable marriage problem is given. The worst case performance of this algorithm is stated. A theoretical analysis shows that the probability of the occurrence of this wor...
详细信息
In this paper a parallel algorithm to solve the stable marriage problem is given. The worst case performance of this algorithm is stated. A theoretical analysis shows that the probability of the occurrence of this worst case is extremely small. For instance, if there are sixteen men and sixteen women involved, then the probability that the worst case occurs is only 10−45. Possible future research is also discussed in this paper.
parallelization of the P-complete problem is known to be difficult. In this paper, we consider the parallelizability of a stack breadth-first search (stack BFS) problem, which is proved to be P-complete. We first prop...
详细信息
parallelization of the P-complete problem is known to be difficult. In this paper, we consider the parallelizability of a stack breadth-first search (stack BFS) problem, which is proved to be P-complete. We first propose the longest path length (LPL) as a measure for the P-completeness of the stack BFS. Next, using this measure, we propose an efficient parallel algorithm for the stack BFS. Assuming the size and LPL of an input graph are n and 1, respectively, the complexity of the algorithm indicates that the stack BFS is in the class NCk+1 if l = O(log(k) n), where k is a positive integer. In addition, the algorithm is cost optimal if l = O(n(is an element of)), where 0 < is an element of < 1.
For a linear control system, we introduce a parallel algorithm to assign a desired subset of eigenvalues to a single-input linear invariant dynamic system. We obtain a sequential algorithm as a particular case. The pr...
详细信息
For a linear control system, we introduce a parallel algorithm to assign a desired subset of eigenvalues to a single-input linear invariant dynamic system. We obtain a sequential algorithm as a particular case. The proposed algorithms are conceptually simple and are based on the computation of left eigenvectors of the state matrix. In addition, the parallel algorithmparallelizes easily as the numerical examples show.
The comparison of sets of genome intervals (e.g., genes, repeats, ChIP-seq peaks) is essential to genome research, especially as modern sequencing technologies enable ever larger and more complex experiments. Relation...
详细信息
The comparison of sets of genome intervals (e.g., genes, repeats, ChIP-seq peaks) is essential to genome research, especially as modern sequencing technologies enable ever larger and more complex experiments. Relationships between genomic features are commonly identified by their intersection: that is, if feature sets contain overlapping intervals then it is inferred that they share a common biological function or origin. Using this technique, researchers identify genomic regions that are common among multiple (or unique to individuals) data sets. While there have been recent advances in algorithms for pairwise intersections between two sets of genomic intervals, few advances have been made to the intersection of many sets of genomic intervals. Identifying intersections among many interval sets is particularly important when attempting to distill biological insights from the massive, multidimensional data sets that are common to modern genome research. For such analyses, speed and efficiency are crucial, given the size and sheer number of data sets involved. To solve this problem, we present a novel ``slice-then-sweep'' algorithm that, given N interval sets, efficiently reveals the subset of intervals that are common to all N sets. We demonstrate that our algorithm is more efficient in the sequential case and has a vastly higher capacity for parallelization with a 19x speedup over the existing algorithm.
In this paper, we develop a stationary iterative method to find the solution vector x for the invertible n×nn×nn \times n linear system <span class="MathJax" id="MathJax-Element-2-Frame&quo...
详细信息
In this paper, we develop a stationary iterative method to find the solution vector x for the invertible n×n linear system
暂无评论