Using Petri nets to design parallel applications
A set of CAA-M schemes corresponding to the most common workflow templates has been created. This makes it possible to use both approaches in order to transform the representations of the algorithm and use their features and advantages (modelling or a set of formal transformations). Using the consid...
Збережено в:
| Дата: | 2025 |
|---|---|
| Автори: | , |
| Формат: | Стаття |
| Мова: | Українська |
| Опубліковано: |
PROBLEMS IN PROGRAMMING
2025
|
| Теми: | |
| Онлайн доступ: | https://pp.isofts.kiev.ua/index.php/ojs1/article/view/776 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Problems in programming |
| Завантажити файл: |  |
Репозитарії
Problems in programming| Резюме: | A set of CAA-M schemes corresponding to the most common workflow templates has been created. This makes it possible to use both approaches in order to transform the representations of the algorithm and use their features and advantages (modelling or a set of formal transformations). Using the considered templates, a generalised Petri net of the Floyd-Warschall algorithm for a set of parallel threads is constructed. This network is valid for a number of architectures (SMP, MPP, GPGPU technology architectures: Fermi, G80), but requires some specification of its elements for each of them, which is partially considered in the paper.Prombles in programming 2013; 2: 32-40 |
|---|