Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing

DOI10.1137/0114108zbMath0149.12501OpenAlexW2031144446MaRDI QIDQ5528155

Publication date: 1966

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0114108

zbMATH Keywords

numerical analysis

Related Items (28)

PROCESSOR-TIME-OPTIMAL SYSTOLIC ARRAYS ⋮ Semantic Foundations for Deterministic Dataflow and Stream Processing ⋮ Modeling for Verification ⋮ Execution termination and computation determinacy of data-flow program nets ⋮ Implementation of Deadlock Analysis in Data Flow Graphs ⋮ Complexity results for weighted timed event graphs ⋮ 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 ⋮ Applications of graph theory in computer systems ⋮ 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 ⋮ A sufficient condition for the liveness of weighted event graphs ⋮ Minimizing place capacities of weighted event graphs for enforcing liveness ⋮ Parallel program schemata ⋮ Toward a Formal Semantic Framework for Deterministic Parallel Programming ⋮ A connection between circular colorings and periodic schedules ⋮ Marked directed graphs ⋮ Homomorphisms between models of parallel computation ⋮ On Flows in Stochastic Marked Graphs ⋮ PROCESSOR LOWER BOUND FORMULAS FOR ARRAY COMPUTATIONS AND PARAMETRIC DIOPHANTINE SYSTEMS ⋮ Optimal systolic array algorithms for tensor product ⋮ 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