Scalability in Computing and Robotics
Heiko Hamann, Andreagiovanni Reina

TL;DR
This paper introduces a general, first-principles-based model of system scalability that unifies various known laws and applies across disciplines like computing and robotics, enhancing understanding of performance dynamics.
Contribution
It proposes a novel decentralized interaction model that generalizes existing scalability laws and explains diverse system behaviors from a microscopic perspective.
Findings
The model can replicate known scalability laws such as Amdahl's and Gustafson's.
It applies to systems like supercomputers, robot swarms, and sensor networks.
Provides a unified framework for analyzing system performance and coordination overheads.
Abstract
Efficient engineered systems require scalability. A scalable system has increasing performance with increasing system size. In an ideal case, the increase in performance (e.g., speedup) corresponds to the number of units that are added to the system. However, if multiple units work on the same task, then coordination among these units is required. This coordination can introduce overheads with an impact on system performance. The coordination costs can lead to sublinear improvement or even diminishing performance with increasing system size. However, there are also systems that implement efficient coordination and exploit collaboration of units to attain superlinear improvement. Modeling the scalability dynamics is key to understanding efficient systems. Known laws of scalability, such as Amdahl's law, Gustafson's law, and Gunther's Universal Scalability Law, are minimalistic…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
