Programming semantics for multiprogrammed computations
Communications of the ACM
Renamings, Maximal Parallelism, and Space-Time Tradeoff in Program Schemata
Journal of the ACM (JACM)
Formal verification of parallel programs
Communications of the ACM
Safety and Liveness Properties for Real Traces and a Direct Translation from LTL to Monoids
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Safety and liveness properties for real traces and a direct translation from LTL to monoids
Formal and natural computing
Construction with parallel derivatives of the closure of a parallel program schema
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
A partial solution to the reachability-problem for vector-addition systems
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
On serializability of iterated transactions
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
From local to global temporal logics over Mazurkiewicz traces
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Pure future local temporal logics are expressively complete for Mazurkiewicz traces
Information and Computation
Polynomials, fragments of temporal logic and the variety DA over traces
Theoretical Computer Science
The analysis of the effects of concurrency control on distributed database system performance
VLDB '80 Proceedings of the sixth international conference on Very Large Data Bases - Volume 6
A Matrix Formalism for Asynchronous Implementation of Algorithms
IEEE Transactions on Computers
An Expression Model for Extraction and Evaluation of Parallelism in Control Structures
IEEE Transactions on Computers
Synthesis and Asynchronous Implementation of Algorithms Using a Generalized P-Function Concept
IEEE Transactions on Computers
Local temporal logic is expressively complete for cograph dependence alphabets
Information and Computation
On first-order fragments for words and Mazurkiewicz traces: a survey
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Alphabetical satisfiability problem for trace equations
Acta Cybernetica
Proceedings of the Third Symposium on Information and Communication Technology
| Hi-index | 0.03 |
The phenomenon of maximal parallelism is investigated in the framework of a class of parallel program schemata. Part I presents the basic properties of this model. Two types of equivalence relation on computations are presented, to each of which there corresponds a concept of determinacy and equivalence for schemata. The correspondence between these relations is shown and related to other properties of schemata. Then the concept of maximal parallelism using one of the relations as a basis is investigated. A partial order on schemata is defined which relates their inherent parallelism. The results presented are especially concerned with schemata which are maximal with respect to this order, i.e. maximally parallel schemata. Several other properties are presented and shown to be equivalent to the property of maximal parallelism. It is then shown that for any schema of a certain class, there exists a unique equivalent schema which is maximally parallel. We call such a schema the “closure” of the original schema.