Bibliographic Details
| Title: |
Notation for mass parallel algorithms: computing Petri net state space on GPU case study. |
| Authors: |
Zaitsev, D. A., Zhang, Z., Liu, D., Shmeleva, T. R. |
| Source: |
International Journal of Parallel, Emergent & Distributed Systems; Apr2025, Vol. 40 Issue 2, p101-115, 15p |
| Subject Terms: |
GRAPH algorithms, TIME complexity, PARALLEL programming, ALGORITHMS, CUBES, PETRI nets |
| 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. [ABSTRACT FROM AUTHOR] |
|
Copyright of International Journal of Parallel, Emergent & Distributed Systems is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Complementary Index |
Full Text Finder 
Nájsť tento článok vo Web of Science