Models of Computations and Systems—Evaluation of Vertex Probabilities in Graph Models of Computations

Authors:
David Martin;Gerald Estrin
Affiliations:
Department of Engineering, University of California at Los Angeles, Los Angeles, California;Department of Engineering, University of California at Los Angeles, Los Angeles, California
Venue:
Journal of the ACM (JACM)
Year:
1967

Citing 1
Cited 18

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

Legality and Other Properties of Graph Models of Computations

Journal of the ACM (JACM)
A Survey of Some Theoretical Aspects of Multiprocessing

ACM Computing Surveys (CSUR)
Computation of page fault probability from program transition diagram

Communications of the ACM
An algorithm for the blocks and cutnodes of a graph

Communications of the ACM
Translator writing systems

Communications of the ACM
Analysis of boolean program models for time-shared, paged environments

Communications of the ACM
One way of estimating frequencies of jumps in a program

Communications of the ACM
Modeling for synthesis - the gap between intent and behavior

Proceedings of the Symposium on Design Automation and Microprocessors
Recognition and representation of parallel processable streams in computer programs-II (Task/process Parallelism)

ACM '69 Proceedings of the 1969 24th national conference
A system for network picture processing with interactive computer graphics

ACM '69 Proceedings of the 1969 24th national conference
A Dynamic Memory Allocation Algorithm

IEEE Transactions on Computers
Path Length Computations on Graph Models of Computations

IEEE Transactions on Computers
On Static Memory Allocation in Computer Systems

IEEE Transactions on Computers
Performance Analysis Using Stochastic Petri Nets

IEEE Transactions on Computers
Control of sequence and parallelism in modular programs

AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
A Comparison of Some Theoretical Models of Parallel Computation

IEEE Transactions on Computers
DRIVE: a tool for developing, deploying, and managing distributed sensor and actuator applications

IBM Systems Journal
Survey: A survey of state vectors

Computer Science Review

Quantified Score

Hi-index	0.11

Visualization

Abstract

This paper concerns itself with the modeling of computations and systems and the generation of a priori estimates of expected computation time for given problems on given processing systems. In particular, methods are discussed for determining the probabilities of reaching vertices in a graph model of computations.