A Coarse Grained Parallel Algorithm for Closest Larger Ancestors in Trees with Applications to Single Link Clustering

2005 ◽  
pp. 856-865
Author(s):  
Albert Chan ◽  
Chunmei Gao ◽  
Andrew Rau-Chaplin
Keyword(s):  
Parallel Algorithm ◽  
Coarse Grained ◽  
Single Link

Parallel Solution of Magnetotelluric Occam Inversion Algorithm Based on Hybrid MPI/OpenMP Model

2014 ◽  
Vol 602-605 ◽  
pp. 3751-3754
Author(s):  
Yu Liu ◽  
Yi Xiao
Keyword(s):  
Parallel Algorithm ◽  
High Efficiency ◽  
Programming Model ◽  
Operation Time ◽  
Coarse Grained ◽  
Inversion Algorithm ◽  
Parallel Solution ◽  
Fine Grained ◽  
Parallel Programming Model ◽  
Occam Inversion

In order to improve the efficiency of magnetotelluric Occam inversion algorithm (MT Occam), a parallel algorithm is implemented on a hybrid MPI/OpenMP parallel programming model to increase its convergence speed and to decrease the operation time. MT Occam is partitioned to map the task on the parallel model. The parallel algorithm implements the coarse-grained parallelism between computation nodes and fine-grained parallelism between cores within each node. By analyzing the data dependency, the computing tasks are accurately partitioned so as to reduce transmission time. The experimental results show that with the increase of model scale, higher speedup can be obtained. The high efficiency of the parallel partitioning strategy of the model can improve the scalability of the parallel algorithm.

A Coarse-Grained Parallel Algorithm for the All-Substrings Longest Common Subsequence Problem

Algorithmica ◽  
2006 ◽  
Vol 45 (3) ◽  
pp. 301-335 ◽  
Author(s):  
Carlos E.R. Alves ◽  
Edson N. Caceres ◽  
Siang Wun Song
Keyword(s):  
Parallel Algorithm ◽  
Longest Common Subsequence ◽  
Coarse Grained ◽  
Longest Common Subsequence Problem ◽  
Common Subsequence

PARALLEL PATTERN MATCHING WITH SCALING

2001 ◽  
Vol 11 (01) ◽  
pp. 125-138 ◽  
Author(s):  
H. MONGELLI ◽  
S. W. SONG
Keyword(s):  
Parallel Algorithms ◽  
Parallel Algorithm ◽  
Pattern Matching ◽  
Computing Time ◽  
Parallel Machine ◽  
Experimental Results ◽  
Coarse Grained ◽  
Matching Problem ◽  
Communication Round ◽  
Parallel Pattern

Given a text and a pattern, the problem of pattern matching consists of determining all the positions of the text where the pattern occurs. When the text and the pattern are matrices, the matching is termed bidimensional. There are variations of this problem where we allow the matching using a somehow modified pattern. A modification that we will allow is that the pattern can be scaled. We propose a new parallel algorithm for this problem, under the CGM (Coarse Grained Multicomputer) model. This algorithm requires linear local computing time in the input, linear memory and uses only one communication round, during which at most a linear amount of data is exchanged. To be the best of our knowledge, there are no known parallel algorithms for the bidimensional pattern matching problem with scaling in the literature. This proposed algorithm was implemented in C, using the PVM interface and was executed on a Parsytec PowerXplorer parallel machine. The experimental results obtained were very promising and showed significant speedups.

Sign in / Sign up

Export Citation Format

Share Document