An Evaluation of Massively Parallel Algorithms for DFA Minimization
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866929568487571456 |
|---|---|
| author | Martens, Jan Wijs, Anton |
| author_facet | Martens, Jan Wijs, Anton |
| contents | We study parallel algorithms for the minimization of Deterministic Finite Automata (DFAs). In particular, we implement four different massively parallel algorithms on Graphics Processing Units (GPUs). Our results confirm the expectations that the algorithm with the theoretically best time complexity is not practically suitable to run on GPUs due to the large amount of resources needed. We empirically verify that parallel partition refinement algorithms from the literature perform better in practice, even though their time complexity is worse. Lastly, we introduce a novel algorithm based on partition refinement with an extra parallel partial transitive closure step and show that on specific benchmarks it has better run-time complexity and performs better in practice.
|
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_22764 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | An Evaluation of Massively Parallel Algorithms for DFA Minimization Martens, Jan Wijs, Anton Distributed, Parallel, and Cluster Computing Logic in Computer Science D.1.3;F.4.3 We study parallel algorithms for the minimization of Deterministic Finite Automata (DFAs). In particular, we implement four different massively parallel algorithms on Graphics Processing Units (GPUs). Our results confirm the expectations that the algorithm with the theoretically best time complexity is not practically suitable to run on GPUs due to the large amount of resources needed. We empirically verify that parallel partition refinement algorithms from the literature perform better in practice, even though their time complexity is worse. Lastly, we introduce a novel algorithm based on partition refinement with an extra parallel partial transitive closure step and show that on specific benchmarks it has better run-time complexity and performs better in practice. |
| title | An Evaluation of Massively Parallel Algorithms for DFA Minimization |
| topic | Distributed, Parallel, and Cluster Computing Logic in Computer Science D.1.3;F.4.3 |
| url | https://arxiv.org/abs/2410.22764 |