Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing
From MaRDI portal
Cited in
(28)- A sufficient condition for the liveness of weighted event graphs
- Minimizing place capacities of weighted event graphs for enforcing liveness
- A connection between circular colorings and periodic schedules
- A survey of scheduling methods for multiprocessor systems
- Methods and means of parallel processing of information
- Regularity and firing sequences of computation graphs
- Data flow analysis of program nets
- Stationary deterministic flows in discrete systems. I
- Decoupling the dimensions of a system of affine recurrence equations
- A new approach to parallel computing
- A note on transition systems
- Functional behavior in data spaces
- (A-)synchronous (non)-deterministic cell spaces simulating each other
- Homomorphisms between models of parallel computation
- Parallel program schemata
- Marked directed graphs
- Optimal systolic array algorithms for tensor product
- Execution termination and computation determinacy of data-flow program nets
- Toward a formal semantic framework for deterministic parallel programming
- Modeling for Verification
- On Flows in Stochastic Marked Graphs
- Implementation of Deadlock Analysis in Data Flow Graphs
- Applications of graph theory in computer systems
- Complexity results for weighted timed event graphs
- PROCESSOR-TIME-OPTIMAL SYSTOLIC ARRAYS
- Semantic Foundations for Deterministic Dataflow and Stream Processing
- Processor lower bound formulas for array computations and parametric Diophantine systems
- A proof of the determinacy property of the data flow schema
This page was built for publication: Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5528155)
