Reducibility of synchronization structures (Q1085606)
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: Reducibility of synchronization structures |
scientific article; zbMATH DE number 3982503
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reducibility of synchronization structures |
scientific article; zbMATH DE number 3982503 |
Statements
Reducibility of synchronization structures (English)
0 references
1985
0 references
This paper is concerned with synchronization structures (or 'purely parallel' control structures), i.e., control structures with (2-way) forks and (2-way) joins as only control nodes. A synchronization structure is reducible iff it can be converted into an equivalent structured version, obtainable from a set of simpler ('primitive') structures. This paper derives necessary and sufficient conditions for a synchronization structure to be reducible and exhibits infinite families of irreducible synchronization structures. Posets associated with synchronization structures and a particular type of homomorphism ('structuring function') between posets play an important role in this paper.
0 references
structured programming
0 references
parallel programming
0 references
parallel processing
0 references
synchronization structures
0 references
control structures
0 references
posets
0 references