The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Evaluating the scalability of distributed systems
Abstract
Many distributed systems must be scalable, meaning that they must be economically deployable in a wide range of sizes and configurations. This paper presents a scalability metric based on cost-effectiveness, where the effectiveness is a function of the system's throughput and its quality of service. It is part of a framework which also includes a sealing strategy for introducing changes as a function of a scale factor, and an automated virtual design optimization at each scale factor. This is an adaptation of concepts for scalability measures in parallel computing. Scalability is measured by the range of scale factors that give a satisfactory value of the metric, and good scalability is a joint property of the initial design and the scaling strategy. The results give insight into the scaling capacity of the designs, and into how to improve the design. A rapid simple bound on the metric is also described. The metric is demonstrated in this work by applying it to some well-known idealized systems, and to real prototypes of communications software.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Simulated annealing: theory and applications.
(1988) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(88)90023-7 · Cited by 2,966
Simulated Annealing: Theory and Applications
van Laarhoven, P. J. M., & Aarts, E. H. L. (1987) · Springer eBooks · doi:10.1007/978-94-015-7744-1 · Cited by 2,385
(1984) · Prentice-Hall, Inc eBooks · Cited by 1,141
Simulated annealing: Practice versus theory
Ingber, L. (1993) · Mathematical and Computer Modelling · doi:10.1016/0895-7177(93)90204-c · Cited by 1,008
Scalable Problems and Memory-Bounded Speedup
Sun, X. H., & Ni, L. M. (1993) · Journal of Parallel and Distributed Computing · doi:10.1006/jpdc.1993.1087 · Cited by 163
U-Net: A User-Level Network Interface for Parallel and Distributed Computing
Basu, A. (1997) · Cited by 104
Optimization of functions with many minima
Bilbro, G. L., & Snyder, W. E. (1991) · IEEE Transactions on Systems Man and Cybernetics · doi:10.1109/21.108301 · Cited by 89
Performance considerations of shared virtual memory machines
Sun, X., & Jianping, Z. (1995) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.476190 · Cited by 24
Cited by
A survey: Control plane scalability issues and approaches in Software-Defined Networking (SDN)
Karakus, M., & Durresi, A. (2017) · Computer Networks · doi:10.1016/j.comnet.2016.11.017 · Cited by 373
Ruzanski, E., Chandrasekar, V., & Wang, Y. (2011) · Journal of Atmospheric and Oceanic Technology · doi:10.1175/2011jtecha1496.1 · Cited by 95
A Survey on Blockchain-Based Identity Management Systems for the Internet of Things
Zhu, X., & Badr, Y. (2018) · 2018 IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData) · doi:10.1109/cybermatics_2018.2018.00263 · Cited by 66
Metadata
- Authors
- Jogalekar, P., & Woodside, M.
- Venue
- IEEE Transactions on Parallel and Distributed Systems
- Published
- 2000-06
- Volume
- 11
- Issue
- 6
- Pages
- 589-603
- ISSN
- 1045-9219 (ISSN-L)
- OpenAlex
- W2085410041
- Cited by
- 283
- References
- 8
- FWCI
- 8.26
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.