an approximation to an n-server capacity planner

an approximation to an n-server capacity planner - A little...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
A little elaboration of capacity planning Dennis Shasha
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Capacity Planning Arrival Rate A1 is given as an assumption A2 = (0.4 A1) + (0.5 A2) A3 = 0.1 A2 Service Time (S) S1, S2, S3 are measured Utilization U = A x S Response Time R = U/(A(1-U)) = S/(1-U) (assuming Poisson arrivals) Entry (S1) 0.4 Search (S2) Checkout (S3) 0.5 0.1 Getting the demand assumptions right is what makes capacity planning hard
Background image of page 2
How to Handle Multiple Servers Suppose one has n servers for some task that requires S time for a single server to perform. The perfect parallelism model is that it is as if one has a single server that is n times as fast. However, this overstates the advantage of parallelism, because even if there were no waiting, single tasks require S time.
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Servers There are two components to response time: waiting time + service time. In the parallel setting, the service time is
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 7

an approximation to an n-server capacity planner - A little...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online