Rate Analysis on Process Graphs with Multiple SCCs
Find strongly connected components
- component graph (in linear time)
For each SCC determine achievable lower and upper bounds on the rate of execution
Compute effective rate intervals using the following result:
- Let P and C be two SCCs in a process graph with enabling edge(s) from P to C. Let [pl, pu] and [cl, cu] be rate intervals for P and C respectively. The effective rate interval for C is then given as:
cl’ = min{pl, cl] and cu’ = min{pu, cu}