An Example of Deriving Performance Properties from a Visual Representation of Program Execution

Authors:
Marc Abrams
Affiliations:
-
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
1997

Citing 11
Cited 0

The geometry of semaphore programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Deterministic systems of sequential processes: theory and tools

International Conference on Concurrency on Concurrency 88
A Declarative Approach to Visualizing Concurrent Computations

Computer
JED: just an event display

Parallel computer systems
Algorithms in C

Algorithms in C
On vertical ray shooting in arrangements

Computational Geometry: Theory and Applications
The influence of random delays on parallel execution times

SIGMETRICS '93 Proceedings of the 1993 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Geometric performance analysis of periodic behavior

Journal of Parallel and Distributed Computing
System Deadlocks

ACM Computing Surveys (CSUR)
An optimal algorithm for testing for safety and detecting deadlocks in locked transaction systems

PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
An Example of Deriving Performance Properties from a VisualRepresentation of Program Execution

An Example of Deriving Performance Properties from a VisualRepresentation of Program Execution

Quantified Score

Hi-index	0.00

Visualization

Abstract

Through geometry, program visualization can yield performance properties. We derive all possible synchronization sequences and durations of blocking and concurrent execution for two process programs from a visualization mapping processes, synchronization, and program execution to Cartesian graph axes, line segments, and paths, respectively. Relationships to Petri nets are drawn.