Algorithms for analyzing uniqueness and nondeadlocking in parallel programs having statements for individual interactions (Q1111005)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithms for analyzing uniqueness and nondeadlocking in parallel programs having statements for individual interactions |
scientific article; zbMATH DE number 4074448
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for analyzing uniqueness and nondeadlocking in parallel programs having statements for individual interactions |
scientific article; zbMATH DE number 4074448 |
Statements
Algorithms for analyzing uniqueness and nondeadlocking in parallel programs having statements for individual interactions (English)
0 references
1987
0 references
Algorithms based on partial loops development and having polynomial complexity are examined. These algorithms reveal the uniqueness and nondeadlocking of parallel programs according to their text.
0 references
partial loops
0 references
polynomial complexity
0 references
nondeadlocking
0 references
parallel programs
0 references
