A coarse-grained multicomputer algorithm for the longest repeated suffix ending at each point in a word

Authors:
Thierry Garcia;David Semé
Affiliations:
Laboratoire de Recherche en Informatique d’Amiens, Université de Picardie Jules Verne, Amiens, France;Laboratoire de Recherche en Informatique d’Amiens, Université de Picardie Jules Verne, Amiens, France
Venue:
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartII
Year:
2003

Citing 8
Cited 5

A bridging model for parallel computation

Communications of the ACM
LogP: towards a realistic model of parallel computation

PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
A randomized parallel 3D convex hull algorithm for coarse grained multicomputers

Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Towards efficiency and portability: programming with the BSP model

Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Scalable 2D convex hull and triangulation algorithms for coarse grained multicomputers

Journal of Parallel and Distributed Computing
Repetitive perhaps, but certainly not boring

Theoretical Computer Science
Fully scalable fault-tolerant simulations for BSP and CGM

Journal of Parallel and Distributed Computing
Coarse Grained Parallel Maximum Matching In Convex Bipartite Graphs

IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing

A Coarse-Grained multicomputer algorithm for the detection of repetitions

Information Processing Letters
A Coarse-Grained Multicomputer algorithm for the detection of repetitions

Information Processing Letters
Accelerating the requirement space exploration through coarse-grained parallel execution

NPC'11 Proceedings of the 8th IFIP international conference on Network and parallel computing
A CGM algorithm solving the longest increasing subsequence problem

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V
Efficient longest common subsequence computation using bulk-synchronous parallelism

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper presents a Coarse-Grained Multicomputer algorithm that solves the problem of finding the longest repeated suffix ending at each point in a word. This algorithm can be implemented in the CGM with p processors in O(N2/P) in time and O(P) communication steps. It is the first CGM algorithm for this problem. We present also experimental results showing that the CGM algorithm is very efficient.