Parallel algorithms and correctness in parallel programs (Q1079951)
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: Parallel algorithms and correctness in parallel programs |
scientific article; zbMATH DE number 3965430
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel algorithms and correctness in parallel programs |
scientific article; zbMATH DE number 3965430 |
Statements
Parallel algorithms and correctness in parallel programs (English)
0 references
1985
0 references
Parallel algorithms (PA) models represented are examined as an ''asynchronous'' generalization of sequential statement algorithms. Languages that allow non-deadlocking and uniqueness of parallel programs to be established in their text under the conditions of cycle completeness are proposed for writing and marking PAs.
0 references
non-deadlocking
0 references
