A General Theory of Computational Scalability Based on Rational Functions

@article{Gunther2008AGT,
  title={A General Theory of Computational Scalability Based on Rational Functions},
  author={Neil J. Gunther},
  journal={CoRR},
  year={2008},
  volume={abs/0808.1431}
}
The universal scalability law of computational capacity is a rational function Cp = P (p)/Q(p) with P (p) a linear polynomial and Q(p) a second-degree polynomial in the number of physical processors p, that has been long used for statistical modeling and prediction of computer system performance. We prove that Cp is equivalent to the synchronous throughput bound for a machinerepairman with state-dependent service rate. Simpler rational functions, such as Amdahl’s law and Gustafson speedup, are… CONTINUE READING
Highly Cited
This paper has 33 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 3 times over the past 90 days. VIEW TWEETS
16 Extracted Citations
21 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 16 extracted citations

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 21 references

Break Amdahl’s law! www.ddj.com/hpc-high-performance-computing/ 205900309

  • H. Sutter
  • 2008
1 Excerpt

Fundamentals of Queueing Theory

  • D. Gross, C. Harris
  • Wiley
  • 1998
3 Excerpts

Similar Papers

Loading similar papers…