Execute Graph Model (EGM)

myunusov / pm

Performance Model Calculator

http://myunusov.github.io/pm/components/

2 stars 1 forks source link

Execute Graph Model (EGM) #28

Open myunusov opened 9 years ago

myunusov commented 9 years ago

Subtasks

[x] #8 Add editor and calculator for Execute Graph Model
[x] #29 sum of the probabilities of all possible cases of one switch must be 1 or less
[x] #30 The bottleneck node must be colored
[x] #31 The routine can be reordered
[ ] #32 Calculate speed-Up for EGM
[x] #83 Visualization D&D operation on tree

myunusov commented 9 years ago

For each key performance scenario we construct execution graph Execution graphs are based on elementary graph theory Nodes represent processing steps (program statements that perform a function) Arcs represent the order of execution Execution graphs are similar to program flowcharts but not the same; they show only those paths that are key to performance frequency of path execution