> > I've a different query on this. As the response time depends on number of > concurrent users, and if there are parallel paths in the flow being > measured, you will need to measure scalability characteristics of each > path. Any thoughts on this? >
It is often the case that a number of parallel paths can exist making up a graph. If you map out the graph and determine the critical path you can then get the contention component for what cannot be parallel, you also can then get and service time for queuing theory. Even on a single thread this manifests as IPC (Instructions Per Cycle) as the CPU extras parallelism which is not constrained by data dependencies. -- You received this message because you are subscribed to the Google Groups "mechanical-sympathy" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/d/optout.
