Finding the bottleneck on paper
On This Lesson 4 topics
This lesson is planned. The outline below lists the topics it will cover. The full lesson has not been published yet.
In this lesson
locate the limiting resource before testing.
Planned topics
- For each resource compute demand (requests per second x time per request) and capacity.
- The resource with the highest utilization is the bottleneck candidate.
- Candidates: CPU, DB connections, thread pool, lock, network, downstream rate limit.
- Make a prediction you can falsify with a test.
Draft outline details
Demonstration
a table: resource, demand, capacity, utilization; the connection pool at 92% is highlighted.
Check your understanding
How do you find the bottleneck on paper?
Show answer
Compute utilization per resource; the highest is the candidate.
Practice
Apply this lesson with the module's lab, exercises and quiz.
Marking a lesson complete is optional and you can undo it any time. Your progress stays in this browser.