An example of deriving performance properties from a visual representation of program execution

Author

Abrams, Marc

Author_Institution

Dept. of Comput. Sci., Virginia Polytech. Inst. & State Univ., Blacksburg, VA, USA

Volume

8

Issue

6

fYear

1997

fDate

6/1/1997 12:00:00 AM

Firstpage

658

Lastpage

666

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

Keywords

Petri nets; computational geometry; data visualisation; parallel programming; reachability analysis; software performance evaluation; Cartesian graph axes; Petri nets; blocking; computational geometry; concurrent execution; line segments; mutual exclusion; parallel computation; paths; performance evaluation; performance properties; program execution; program visualization; ray shooting; reachability analysis; synchronization; synchronization sequences; timed progress graphs; visual representation; visualization mapping processes; Computational geometry; Computer displays; History; Particle measurements; Petri nets; Reachability analysis; Rendering (computer graphics); Safety; Time measurement; Visualization;

fLanguage

English

Journal_Title

Parallel and Distributed Systems, IEEE Transactions on

Publisher

ieee

ISSN

1045-9219

Type

jour

DOI

10.1109/71.595584

Filename

595584