A General Theory of Computational Scalability Based on Rational Functions¶
Gunther, N. J. (2008). A General Theory of Computational Scalability Based on Rational Functions. arXiv.
Cited by¶
2 citations across 2 artifacts.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Amdahl's Law
- Classical Amdahl speedup is monotone in (N) under its assumptions.
This sourcePrimary derivation used only for the Universal Scalability Law boundary.
- Classical Amdahl speedup is monotone in (N) under its assumptions.
Mechanisms¶
- Workload Scaling Test
- Throughput can even decline past a certain concurrency as coordination and contention overheads dominate — the retrograde region the Universal Scalability Law describes — so the highest load you can push is not always the most you can serve.
This sourceThroughput can even decline past a certain concurrency; coordination and contention overheads dominate; retrograde region the Universal Scalability Law describes; highest load you can push is not always the most you can serve
- Throughput can even decline past a certain concurrency as coordination and contention overheads dominate — the retrograde region the Universal Scalability Law describes — so the highest load you can push is not always the most you can serve.
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. Neither this nor any other of the 2 citations of this work carries a recorded support check.
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.
Registry ID ref:8e94f7ea65e5 · see in the full table