Parallel Longest Common SubSequence Analysis In Chapel

One of the most critical problems in the field of string algorithms is the longest common subsequence problem (LCS). The problem is NP-hard for an arbitrary number of strings but can be solved in polynomial time for a fixed number of strings. In this paper, we select a typical parallel LCS algorithm...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE Conference on High Performance Extreme Computing (Online) s. 1 - 6
Hlavní autori: Vahidi, Soroush, Schieber, Baruch, Du, Zhihui, Bader, David A.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 25.09.2023
Predmet:
Chapel programming language
High performance computing
Libraries
parallel computing
Parallel languages
Python
string algorithms
ISSN:2643-1971
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:One of the most critical problems in the field of string algorithms is the longest common subsequence problem (LCS). The problem is NP-hard for an arbitrary number of strings but can be solved in polynomial time for a fixed number of strings. In this paper, we select a typical parallel LCS algorithm and integrate it into our large-scale string analysis algorithm library to support different types of large string analysis. Specifically, we take advantage of the high-level parallel language, Chapel, to integrate Lu and Liu's parallel LCS algorithm into Arkouda, an open-source framework. Through Arkouda, data scientists can easily handle large string analytics on the back-end high-performance computing resources from the front-end Python interface. The Chapel-enabled parallel LCS algorithm can identify the longest common subsequences of two strings, and experimental results are given to show how the number of parallel resources and the length of input strings can affect the algorithm's performance.
ISSN:2643-1971
DOI:10.1109/HPEC58863.2023.10363472