Notation for mass parallel algorithms: computing Petri net state space on GPU case study
Journal article
| Authors | Zaitsev, D., Zhang, Z., Liu, D. and Shmeleva, T. R. |
|---|---|
| Abstract | We introduce a novel notation for mass parallel algorithms, in particular, algorithms for GPU, which is based on graphical specification of the cube of threads combined with textual expressions, specifying a thread algorithm. We abstract from the peculiarities of a definite GPU preserving basic features of mass-parallel computations. As a case study for the notation, we developed, and implemented in CUDA, a reachability graph algorithm for Petri nets. Parallel hash tables have been introduced to reduce the time complexity. About a hundred time speed-up has been obtained, compared with the best known toolset Tina. |
| Keywords | Mass parallel algorithm; Petri net; reachability graph |
| Year | 2024 |
| Journal | International Journal of Parallel, Emergent and Distributed Systems |
| Journal citation | pp. 1-15 |
| Publisher | Taylor & Francis (Routledge) |
| ISSN | 1744-5779 |
| Digital Object Identifier (DOI) | https://doi.org/10.1080/17445760.2024.2431545 |
| Web address (URL) | https://www.tandfonline.com/doi/full/10.1080/17445760.2024.2431545 |
| Publisher's version | License File Access Level Open |
| Output status | Published |
| Publication dates | |
| Online | 22 Nov 2024 |
| Publication process dates | |
| Deposited | 28 Nov 2024 |
https://repository.derby.ac.uk/item/qv26w/notation-for-mass-parallel-algorithms-computing-petri-net-state-space-on-gpu-case-study
Download files
Publisher's version
| Notation for mass parallel algorithms computing Petri net state space on GPU case study.pdf | ||
| License: CC BY 4.0 | ||
| File access level: Open | ||
30
total views14
total downloads9
views this month7
downloads this month