Legality and Other Properties of Graph Models of Computations

Authors:
J. L. Baer;D. P. Bovet;G. Estrin
Affiliations:
Computer Science Group, University of Washington, Seattle, Washington and Unviersity of California, Department of computer Science, Los Angles, California;Italsiel, Rome, Italy and Unviersity of California, Department of computer Science, Los Angles, California;University of California, Department of Computer Science, Los Angeles, California
Venue:
Journal of the ACM (JACM)
Year:
1970

Citing 7
Cited 7

A New Method of Checking the Consistency of Precedence Matrices

Journal of the ACM (JACM)
Models of Computations and Systems—Evaluation of Vertex Probabilities in Graph Models of Computations

Journal of the ACM (JACM)
Scheduling Parallel Computations

Journal of the ACM (JACM)
System performance evaluation: survey and appraisal

Communications of the ACM
Memory allocation in computer systems

Memory allocation in computer systems
Graph models of computations in computer systems

Graph models of computations in computer systems
Volume i. the automatic assignment and sequencing of computations on parallel processor systems. volume ii. program listings

Volume i. the automatic assignment and sequencing of computations on parallel processor systems. volume ii. program listings

A Survey of Some Theoretical Aspects of Multiprocessing

ACM Computing Surveys (CSUR)
Modelling “system independent” software resource demands

ANSS '75 Proceedings of the 3rd symposium on Simulation of computer systems
A Computer Resource Allocation Model with Some Measured and Simulation Results

IEEE Transactions on Computers
Bibliography

Record of the Project MAC conference on concurrent systems and parallel computation
A Comparison of Some Theoretical Models of Parallel Computation

IEEE Transactions on Computers
Bounds on the Number of Processors and Time for Multiprocessor Optimal Schedules

IEEE Transactions on Computers
Structured flowcharts for multiprocessing

Computer Languages

Quantified Score

Hi-index	0.01

Visualization

Abstract

Directed graphs having logical control associated with each vertex have been introduced as models of computational tasks for automatic assignment and sequencing on parallel processor systems. A brief review of their properties is given. A procedure to test the “legality” of graphs in this class is described, and leads to algorithms for counting the number of all possible executions (AND-type subgraphs), and for evaluating the probability of ever reaching a given vertex in the graph. Numerical results are given for some example graphs.