Skip to main content
SpringerLink
Log in
Book cover

International Conference on Computational Science and Its Applications

ICCSA 2003: Computational Science and Its Applications — ICCSA 2003 pp 239–248Cite as

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

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2668))

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\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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. A. Chan and F. Dehne. A note on coarse grained parallel integer sorting. Parallel Processing Letters, 9(4):533–538, 1999.

    Article  Google Scholar 

  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. 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. 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.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Article  MATH  Google Scholar 

  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.

    Article  MathSciNet  Google Scholar 

  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. 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. 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. 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.

    Article  MATH  Google Scholar 

  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. 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. W. F. Smyth. Repetitive perhaps, but not boring. Theor. Comput. Sci., 249(5):343–355, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  15. L.G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8): 103–111, 1990.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LaRIA : Laboratoire de Recherche en Informatique d’Amiens, Université de Picardie Jules Verne, CURI, 5, rue du Moulin Neuf, 80000, Amiens, France

    Thierry Garcia & David Semé

Authors
  1. Thierry Garcia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. David Semé
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Army High Performance Computing Research Center, USA

    Vipin Kumar

  2. Department of Computer Science and Engineering, University of Minessota, MN, 55455, USA

    Vipin Kumar

  3. Department of Computer Science, University of Calgary, Calgary, AB, T2N1N4, Canada

    Marina L. Gavrilova

  4. Heuchera Technologies Inc., 122 9251-8 Yonge Street, Richmond Hill, ON, Canada, L4C 9T3

    Chih Jeng Kenneth Tan

  5. School of Computer Science, The Queen’s University of Belfast, Belfast, BT7 1NN, Northern Ireland, UK

    Chih Jeng Kenneth Tan

  6. Département d’informatique et de recherche opérationelle, Université de Montréal, Montréal, Québec, H3C 3J7, Canada

    Pierre L’Ecuyer

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Garcia, T., Semé, D. (2003). A Coarse-Grained Multicomputer Algorithm for the Longest Repeated Suffix Ending at Each Point in a Word. In: Kumar, V., Gavrilova, M.L., Tan, C.J.K., L’Ecuyer, P. (eds) Computational Science and Its Applications — ICCSA 2003. ICCSA 2003. Lecture Notes in Computer Science, vol 2668. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44843-8_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-44843-8_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40161-2

  • Online ISBN: 978-3-540-44843-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation