Document Open Access Logo

String Problems in the Congested Clique Model

Authors Shay Golan , Matan Kraus

PDF

File

Thumbnail PDF
PDF
LIPIcs.CPM.2025.6.pdf
  • Filesize: 1.01 MB
  • 23 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Distributed algorithms
Keywords
  • String Sorting
  • Pattern Matching
  • Suffix Array
  • Congested Clique
  • Sorting

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

In this paper we present algorithms for several string problems in the Congested Clique model. In the Congested Clique model, n nodes (computers) are used to solve some problem. The input to the problem is distributed among the nodes, and the communication between the nodes is conducted in rounds. In each round, every node is allowed to send an O(log n)-bit message to every other node in the network.
We consider three fundamental string problems in the Congested Clique model. First, we present an O(1) rounds algorithm for string sorting that supports strings of arbitrary length. Second, we present an O(1) rounds combinatorial pattern matching algorithm. Finally, we present an O(log log n) rounds algorithm for the computation of the suffix array and the corresponding Longest Common Prefix array of a given string.

Cite As Get BibTex

Shay Golan and Matan Kraus. String Problems in the Congested Clique Model. In 36th Annual Symposium on Combinatorial Pattern Matching (CPM 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 331, pp. 6:1-6:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.CPM.2025.6

Author Details

Shay Golan
  • Reichman University, Herzliya, Israel
  • University of Haifa, Israel
Matan Kraus
  • Bar-Ilan University, Ramat Gan, Israel

Funding

  • Golan, Shay: supported by Israel Science Foundation grant 810/21.
  • Kraus, Matan: supported by the BSF grant 2018364, and by the ERC grant MPM under the EU’s Horizon 2020 Research and Innovation Programme (grant no. 683064).

References

  1. Miklós Ajtai, János Komlós, and Endre Szemerédi. An o(n log n) sorting network. In Proceedings of the 15th Annual ACM Symposium on Theory of Computing, pages 1-9. ACM, 1983. URL: https://doi.org/10.1145/800061.808726.
  2. Alexandr Andoni, Aleksandar Nikolov, Krzysztof Onak, and Grigory Yaroslavtsev. Parallel algorithms for geometric graph problems. In David B. Shmoys, editor, Symposium on Theory of Computing, STOC 2014, pages 574-583. ACM, 2014. URL: https://doi.org/10.1145/2591796.2591805.
  3. Benny Applebaum, Dariusz R. Kowalski, Boaz Patt-Shamir, and Adi Rosén. Clique here: On the distributed complexity in fully-connected networks. Parallel Process. Lett., 26(1):1650004:1-1650004:12, 2016. URL: https://doi.org/10.1142/S0129626416500043.
  4. Lars Arge, Paolo Ferragina, Roberto Grossi, and Jeffrey Scott Vitter. On sorting strings in external memory (extended abstract). In Frank Thomson Leighton and Peter W. Shor, editors, Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, pages 540-548. ACM, 1997. URL: https://doi.org/10.1145/258533.258647.
  5. Paul Beame, Paraschos Koutris, and Dan Suciu. Communication steps for parallel query processing. In Richard Hull and Wenfei Fan, editors, Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2013, pages 273-284. ACM, 2013. URL: https://doi.org/10.1145/2463664.2465224.
  6. Soheil Behnezhad, Mahsa Derakhshan, and MohammadTaghi Hajiaghayi. Brief announcement: Semi-mapreduce meets congested clique. CoRR, abs/1802.10297, 2018. URL: https://doi.org/10.48550/arXiv.1802.10297.
  7. Jon Louis Bentley and Robert Sedgewick. Fast algorithms for sorting and searching strings. In Michael E. Saks, editor, Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 360-369. ACM/SIAM, 1997. URL: http://dl.acm.org/citation.cfm?id=314161.314321.
  8. Timo Bingmann. Scalable String and Suffix Sorting: Algorithms, Techniques, and Tools. PhD thesis, Karlsruhe Institute of Technology, Germany, 2018. URL: https://publikationen.bibliothek.kit.edu/1000085031.
  9. Robert S. Boyer and J. Strother Moore. A fast string searching algorithm. Commun. ACM, 20(10):762-772, 1977. URL: https://doi.org/10.1145/359842.359859.
  10. Dany Breslauer and Zvi Galil. An optimal o($$1log$$1logn) time parallel string matching algorithm. SIAM Journal on Computing, 19(6):1051-1058, 1990. URL: https://doi.org/10.1137/0219072.
  11. Dany Breslauer and Zvi Galil. Real-time streaming string-matching. ACM Transactions on Algorithms, 10(4):22:1-22:12, 2014. URL: https://doi.org/10.1145/2635814.
  12. Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, and Dean Leitersdorf. Fast approximate shortest paths in the congested clique. Distributed Comput., 34(6):463-487, 2021. URL: https://doi.org/10.1007/s00446-020-00380-5.
  13. Keren Censor-Hillel, Orr Fischer, Tzlil Gonen, François Le Gall, Dean Leitersdorf, and Rotem Oshman. Fast distributed algorithms for girth, cycles and small subgraphs. In Hagit Attiya, editor, 34th International Symposium on Distributed Computing, DISC 2020, October 12-16, 2020, Virtual Conference, volume 179 of LIPIcs, pages 33:1-33:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. URL: https://doi.org/10.4230/LIPIcs.DISC.2020.33.
  14. Charles J Colbourn and Alan CH Ling. Quorums from difference covers. Information Processing Letters, 75(1-2):9-12, 2000. URL: https://doi.org/10.1016/S0020-0190(00)00080-6.
  15. Jeffrey Dean and Sanjay Ghemawat. Mapreduce: Simplified data processing on large clusters. In Eric A. Brewer and Peter Chen, editors, 6th Symposium on Operating System Design and Implementation (OSDI 2004), pages 137-150. USENIX Association, 2004. URL: http://www.usenix.org/events/osdi04/tech/dean.html.
  16. Lester R Ford Jr and Selmer M Johnson. A tournament problem. The American Mathematical Monthly, 66(5):387-389, 1959. Google Scholar
  17. Zvi Galil. Optimal parallel algorithms for string matching. Information and Control, 67(1-3):144-157, 1985. URL: https://doi.org/10.1016/S0019-9958(85)80031-0.
  18. Mohsen Ghaffari, Christoph Grunau, and Slobodan Mitrovic. Massively parallel algorithms for b-matching. In Kunal Agrawal and I-Ting Angelina Lee, editors, SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, pages 35-44. ACM, 2022. URL: https://doi.org/10.1145/3490148.3538589.
  19. Shay Golan and Matan Kraus. String problems in the congested clique model, 2025. URL: https://doi.org/10.48550/arXiv.2504.08376.
  20. Torben Hagerup. Optimal parallel string algorithms: sorting, merging and computing the minimum. In Frank Thomson Leighton and Michael T. Goodrich, editors, Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 23-25 May 1994, Montréal, Québec, Canada, pages 382-391. ACM, 1994. URL: https://doi.org/10.1145/195058.195202.
  21. MohammadTaghi Hajiaghayi, Hamed Saleh, Saeed Seddighin, and Xiaorui Sun. String matching with wildcards in the massively parallel computation model. In Kunal Agrawal and Yossi Azar, editors, SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, pages 275-284. ACM, 2021. URL: https://doi.org/10.1145/3409964.3461793.
  22. Vaughan R. Pratt James H. Morris Jr. A linear pattern-matching algorithm. techreport 40, University of California, Berkeley, 1970. Google Scholar
  23. Tomasz Jurdzinski and Krzysztof Nowicki. MST in O(1) rounds of congested clique. In Artur Czumaj, editor, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pages 2620-2632. SIAM, 2018. URL: https://doi.org/10.1137/1.9781611975031.167.
  24. Juha Kärkkäinen, Dominik Kempa, and Simon J. Puglisi. Parallel external memory suffix sorting. In Ferdinando Cicalese, Ely Porat, and Ugo Vaccaro, editors, Proceedings of `Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, volume 9133 of Lecture Notes in Computer Science, pages 329-342. Springer, 2015. URL: https://doi.org/10.1007/978-3-319-19929-0_28.
  25. Juha Kärkkäinen and Tommi Rantala. Engineering radix sort for strings. In Amihood Amir, Andrew Turpin, and Alistair Moffat, editors, Proceedings of String Processing and Information Retrieval, 15th International Symposium, SPIRE 2008,, volume 5280 of Lecture Notes in Computer Science, pages 3-14. Springer, 2008. URL: https://doi.org/10.1007/978-3-540-89097-3_3.
  26. Juha Kärkkäinen, Peter Sanders, and Stefan Burkhardt. Linear work suffix array construction. Journal of the ACM, 53(6):918-936, 2006. URL: https://doi.org/10.1145/1217856.1217858.
  27. Richard M. Karp and Michael O. Rabin. Efficient randomized pattern-matching algorithms. IBM Journal of Research and Development, 31(2):249-260, 1987. URL: https://doi.org/10.1147/rd.312.0249.
  28. Toru Kasai, Gunho Lee, Hiroki Arimura, Setsuo Arikawa, and Kunsoo Park. Linear-time longest-common-prefix computation in suffix arrays and its applications. In Amihood Amir and Gad M. Landau, editors, Combinatorial Pattern Matching, 12th Annual Symposium, CPM 2001, volume 2089 of Lecture Notes in Computer Science, pages 181-192. Springer, 2001. URL: https://doi.org/10.1007/3-540-48194-X_17.
  29. Donald E. Knuth, James H. Morris, Jr., and Vaughan R. Pratt. Fast pattern matching in strings. SIAM Journal on Computing, 6(2):323-350, 1977. URL: https://doi.org/10.1137/0206024.
  30. Fabian Kulla and Peter Sanders. Scalable parallel suffix array construction. Parallel Comput., 33(9):605-612, 2007. URL: https://doi.org/10.1016/j.parco.2007.06.004.
  31. Christoph Lenzen. Optimal deterministic routing and sorting on the congested clique. In Panagiota Fatourou and Gadi Taubenfeld, editors, ACM Symposium on Principles of Distributed Computing, PODC '13, Montreal, QC, Canada, July 22-24, 2013, pages 42-50. ACM, 2013. URL: https://doi.org/10.1145/2484239.2501983.
  32. Zvi Lotker, Elan Pavlov, Boaz Patt-Shamir, and David Peleg. MST construction in o(log log n) communication rounds. In Arnold L. Rosenberg and Friedhelm Meyer auf der Heide, editors, SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, pages 94-100. ACM, 2003. URL: https://doi.org/10.1145/777412.777428.
  33. Udi Manber and Eugene W. Myers. Suffix arrays: A new method for on-line string searches. SIAM J. Comput., 22(5):935-948, 1993. URL: https://doi.org/10.1137/0222058.
  34. Krzysztof Nowicki. A deterministic algorithm for the MST problem in constant rounds of congested clique. In Samir Khuller and Virginia Vassilevska Williams, editors, STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, pages 1154-1165. ACM, 2021. URL: https://doi.org/10.1145/3406325.3451136.
  35. Matthew Felice Pace and Alexander Tiskin. Parallel suffix array construction by accelerated sampling. In Jan Holub and Jan Zdárek, editors, Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, September 2-4, 2013, pages 142-156. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, 2013. URL: http://www.stringology.org/event/2013/p13.html.
  36. Boaz Patt-Shamir and Marat Teplitsky. The round complexity of distributed sorting: extended abstract. In Cyril Gavoille and Pierre Fraigniaud, editors, Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, PODC, pages 249-256. ACM, 2011. URL: https://doi.org/10.1145/1993806.1993851.
  37. Simon J. Puglisi, William F. Smyth, and Andrew Turpin. A taxonomy of suffix array construction algorithms. ACM Comput. Surv., 39(2):4, 2007. URL: https://doi.org/10.1145/1242471.1242472.
  38. Tatiana Starikovskaya and Hjalte Wedel Vildhøj. Time-space trade-offs for the longest common substring problem. In Johannes Fischer and Peter Sanders, editors, Combinatorial Pattern Matching, 24th Annual Symposium, CPM, volume 7922 of Lecture Notes in Computer Science, pages 223-234. Springer, 2013. URL: https://doi.org/10.1007/978-3-642-38905-4_22.
  39. Uzi Vishkin. Optimal parallel pattern matching in strings. Inf. Control., 67(1-3):91-113, 1985. URL: https://doi.org/10.1016/S0019-9958(85)80028-0.
  40. Peter Weiner. Linear pattern matching algorithms. In 14th Annual Symposium on Switching and Automata Theory, SWAT 1973, pages 1-11. IEEE Computer Society, 1973. URL: https://doi.org/10.1109/SWAT.1973.13.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact