Guerrilla Capacity Planning¶
Gunther, N. J. (2007). Guerrilla Capacity Planning: A Tactical Approach to Planning for Highly Scalable Applications and Services. Springer.
Cited by¶
5 citations across 5 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Bottleneck
This sourceCapacity-planning treatment including the Universal Scalability Law (contention and coherency as scaling bottlenecks). Biblio reference. approach to achieving large scale computing capabilities." In AFIPS Conference Proceedings, Vol. 30, 483–485. [^ref-5ff94f87dd3f]: Tanenbaum, A. S., & Van Steen, M. (2007). Distributed Systems: Principles and Paradigms (2nd ed.). Prentice Hall. [^ref-d7bc84ffb4cb]: Awerbuch, B. (1985). "Complexity of network synchronization." Journal of the ACM, 32(4), 804–823. [^ref-4cf817d1d508]: Coulouris, G., Kindberg, T., & Dollimore, J. (2011). Distributed Systems: Concepts and Design (5th ed.). Addison-Wesley. [^ref-242cd6e40d2a]: Silberschatz, A., Galvin, P. B., & Gagne, G. (2013). Operating System Concepts (9th ed.). Wiley.
- Concurrency
This sourceDevelops the Universal Scalability Law for contention/coherency cost under load. DOI verified.
- Interference and Contention
- (4) Cost measurement—What is the latency increase, throughput loss, or quality degradation under contention, calibrated against the load-curve framework Gunther (2007) develops for production capacity planning?
Supported in partVerified against the publisher's abstract
Publisher abstract confirms Gunther 2007 is a practitioner capacity-planning text built on his Universal Law of Computational Scaling, but it names no "load-curve framework" and no latency or throughput contention cost.
“Another unique Guerrilla tool is Virtual Load Testing, based on Dr. Gunther's "Universal Law of Computational Scaling", which provides a highly cost-effective method for assessing application scalability.”
- (4) Cost measurement—What is the latency increase, throughput loss, or quality degradation under contention, calibrated against the load-curve framework Gunther (2007) develops for production capacity planning?
- Scalability
- The mechanism works because it converts vague ambitions ("we'll handle 10M users") into specific, testable hypotheses ("request rate scales linearly with database shards up to 100 shards; beyond that, coordination overhead dominates")
Supported in partVerified against the publisher's abstract
The publisher abstract describes capacity planning and Virtual Load Testing for assessing application scalability, backing the load-testing frame but not validation of scaling claims as such.
“Another unique Guerrilla tool is Virtual Load Testing, based on Dr. Gunther's "Universal Law of Computational Scaling", which provides a highly cost-effective method for assessing application scalability.”
- The mechanism works because it converts vague ambitions ("we'll handle 10M users") into specific, testable hypotheses ("request rate scales linearly with database shards up to 100 shards; beyond that, coordination overhead dominates")
Mechanisms¶
- Cloud Scaling Pattern
- And elastic capacity papers over a serialized bottleneck rather than removing it: past a point, adding units buys almost nothing because a shared, non-parallel resource caps the achievable throughput — the ceiling the Universal Scalability Law describes.
This sourceUses the Universal Scalability Law to show how serialized contention imposes diminishing returns and a maximum on throughput as more units are added.
- And elastic capacity papers over a serialized bottleneck rather than removing it: past a point, adding units buys almost nothing because a shared, non-parallel resource caps the achievable throughput — the ceiling the Universal Scalability Law describes.
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Read against the text for 2 of 5 citations: 2 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Links previously used in the corpus¶
Before the registry existed this work was also linked 1 other way.
Registry ID ref:7d11f960bb46 · see in the full table