The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
A microeconomic approach to optimal resource allocation in distributed computer systems
Abstract
Decentralized algorithms are examined for optimally distributing a divisible resource in a distributed computer system. To study this problem in a specific context, the problem of optimal file allocation is considered. In this case, the optimization criteria include both the communication cost and average processing delay associated with a file access. The algorithms examined have their origins in the field of mathematical economics. They are shown to have several attractive properties, including their simplicity and distributed nature, the computation of feasible and increasingly better resource allocations as the result of each iteration, and, in the case of file allocation, rapid convergence. Conditions are formally derived under which the algorithms are guaranteed to coverage, and their convergence behavior is additionally examined through simulation.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Bertsekas, D. P., & Gallager, R. G. (1987) · Cited by 5,561
Arrow, K. J., & Hahn, F. H. (1971) · Medical Entomology and Zoology · Cited by 2,951
The notions of consistency and predicate locks in a database system
Eswaran, K. P., Gray, J. N., Lorie, R. A., & Traiger, I. L. (1976) · Communications of the ACM · doi:10.1145/360363.360369 · Cited by 1,956
Constrained minimization methods
Levitin, E. S., & Polyak, B. T. (1966) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(66)90114-5 · Cited by 846
A Minimum Delay Routing Algorithm Using Distributed Computation
Gallager, R. (1977) · IEEE Transactions on Communications · doi:10.1109/tcom.1977.1093711 · Cited by 651
The Design of Mechanisms for Resource Allocation
(2022) · The Collected Papers of Leonid Hurwicz · doi:10.1093/oso/9780199313280.003.0009 · Cited by 593
Comparative Models of the File Assignment Problem
Dowdy, L. W., & Foster, D. V. (1982) · ACM Computing Surveys · doi:10.1145/356876.356883 · Cited by 472
Optimal allocation of resources in distributed information networks
Mahmoud, S., & Riordon, J. S. (1976) · ACM Transactions on Database Systems · doi:10.1145/320434.320449 · Cited by 174
A survey of research and development in distributed database management
Rothnie, J. B., & Goodman, N. (1977) · Very Large Data Bases · Cited by 103
Heal, G. (1973) · doi:10.1007/978-1-349-15492-0_21 · Cited by 70
Cited by
The interdisciplinary study of coordination
Malone, T. W., & Crowston, K. (1994) · ACM Computing Surveys · doi:10.1145/174666.174668 · Cited by 3,504
A survey on networking games in telecommunications
Altman, E., Boulogne, T., El-Azouzi, R., Jiménez, T., & Wynter, L. (2006) · Computers & Operations Research · doi:10.1016/j.cor.2004.06.005 · Cited by 552
Wellman, M. P. (1993) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2 · Cited by 526
Optimal Scaling of a Gradient Method for Distributed Resource Allocation
Xiao, L., & Boyd, S. (2006) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-006-9080-1 · Cited by 326
Metadata
- Authors
- Kurose, J. F., & Simha, R.
- Venue
- IEEE Transactions on Computers
- Published
- 1989-05
- Volume
- 38
- Issue
- 5
- Pages
- 705-717
- ISSN
- 0018-9340 (ISSN-L)
- OpenAlex
- W2002482313
- Cited by
- 276
- References
- 11
- FWCI
- 3.98
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A microeconomic approach to optimal resource allocation in distributed computer systems. https://app.cochat.ai/papers/10.1109/12.24272
- The paper
- Kurose, J. F., & Simha, R. (1989). A microeconomic approach to optimal resource allocation in distributed computer systems. IEEE Transactions on Computers. https://doi.org/10.1109/12.24272
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.