λ = L/ W ( λ = throughout, L=Average number of customer in a stable system, W=Average time spent in the system)
λ = 1/ W (Since a lock will only allow one thread to execute)
λ = 1/10 micros (Supposed average time taken to acquire the lock)
λ = 100,000 per second
Therefore, just by using a lock, the throughput of my system is capped at 100,000 per second.
Is my reasoning correct?
Thanks
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?
Can the critical path itself change based on concurrent load if each of the paths making up the graph has different serialised characteristics? I'm postulating that the path having minimum service time at N=1 but higher contention may never appear to be the critical path at lower concurrency but it will manifest at higher concurrency.