A Coarse-Grained Multicomputer Algorithm for the Longest Repeated Suffix Ending at Each Point in a Word

  • Thierry Garcia
  • David Semé
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2668)


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\left( {\frac{{N^2 }} {P}} \right) \) 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.


Local Computation Communication Time Sequential Algorithm Communication Step Longe Common Subsequence 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    P. Bose, A. Chan, F. Dehne, and M. Latzel. Coarse grained parallel maximum matching in convex bipartite graph. Proc. 13th International Parallel Processing Symposium (IPPS’99), pages 125–129, 1999.Google Scholar
  2. [2]
    A. Chan and F. Dehne. A note on coarse grained parallel integer sorting. Parallel Processing Letters, 9(4):533–538, 1999.CrossRefGoogle Scholar
  3. [3]
    D. Culler, R. Karp, D. Patterson, A. Sahay, K. Schauser, E. Santos, R. Subramonian, and T. Von Eicken. LogP:towards a realistic model of parallel computation. 4-th ACM SIGPLAN Symp. on Principles and Practices of Parallel Programming, pages 1–12, 1996.Google Scholar
  4. [4]
    F. Dehne, X. Deng, P. Dymond, A. Fabri, and A. Khokhar. A randomized parallel 3d convex hull algorithm for coarse grained multicomputers. Proc. 7th ACM Symp. on Parallel Algorithms and Architectures, pages 27–33, 1995.Google Scholar
  5. [5]
    F. Dehne, A. Fabri, and A. Rau-Chaplin. Scalable parallel computational geometry for coarse grained multicomputers. International Journal on Computational Geometry, 6(3):379–400, 1996.zbMATHCrossRefMathSciNetGoogle Scholar
  6. [6]
    M. Diallo, A. Ferreira, A. Rau-Chaplin, and S. Ubeda. Scalable 2d convex hull and triangulation algorithms for coarse grained multicomputers. Journal of Parallel and Distributed Computing, 56(1):47–70, 1999.zbMATHCrossRefGoogle Scholar
  7. [7]
    A. Ferreira and N. Schabanel. A randomized bsp/cgm algorithm for the maximal independant set problem. Parallel Processing Letters, 9(3):411–422, 1999.CrossRefMathSciNetGoogle Scholar
  8. [8]
    T. Garcia, J.F. Myoupo, and D. Semé. A work-optimal cgm algorithm for the longest increasing subsequence problem. International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA’ 01), 2001.Google Scholar
  9. [9]
    T. Garcia, J.F. Myoupo, and D. Semé. A coarse-grained multicomputer algorithm for the longest common subsequence problem. 11-th Euromicro Conference on Parallel Distributed and Network based Processing (PDP’ 03), 2003.Google Scholar
  10. [10]
    M. Goudreau, S. Rao K. Lang, T. Suel, and T. Tsantilas. Towards efficiency and portability: Programming with the bsp model. 8th Annual ACM Symp. on Parallel Algorithms and Architectures (SPAA’96), pages 1–12, 1996.Google Scholar
  11. [11]
    S.R. Kim and K. Park. Fully scalable fault-tolerant simulations for bsp and cgm. Journal of Parallel and Distributed Computing, 60:1531–1560, 2000.zbMATHCrossRefGoogle Scholar
  12. [12]
    T. Lecroq, J.-F. Myoupo, and D. Semé. Exact computations of the longest repeated suffix ending at each point in a word. In R. Gantenbein and S. Shin, editors, Proceedings of the 17th International Conference on Computers and Their Applications, pages 18–21, 2002.Google Scholar
  13. [13]
    A. Lefebvre and T. Lecroq. Computing repeated factors with a factor oracle. In L. Brankovic and J. Ryan, editors, Proceedings of the 11th Australasian Workshop On Combinatorial Algorithms, pages 145–158, 2000.Google Scholar
  14. [14]
    W. F. Smyth. Repetitive perhaps, but not boring. Theor. Comput. Sci., 249(5):343–355, 2000.zbMATHCrossRefMathSciNetGoogle Scholar
  15. [15]
    L.G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8): 103–111, 1990.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Thierry Garcia
    • 1
  • David Semé
    • 1
  1. 1.LaRIA : Laboratoire de Recherche en Informatique d’AmiensUniversité de Picardie Jules VerneAmiensFrance

Personalised recommendations