The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Comparative Models of the File Assignment Problem
Abstract
article Free Access Share on Comparative Models of the File Assignment Problem Authors: Lawrence W. Dowdy Department of Computer Science, Vanderbilt University, Nashville, Tennessee Department of Computer Science, Vanderbilt University, Nashville, TennesseeView Profile , Derrell V. Foster Department of Computer Science, Vanderbilt University, Nashville, Tennessee Department of Computer Science, Vanderbilt University, Nashville, TennesseeView Profile Authors Info & Claims ACM Computing SurveysVolume 14Issue 2June 1982 pp 287–313https://doi.org/10.1145/356876.356883Online:01 June 1982Publication History 391citation1,578DownloadsMetricsTotal Citations391Total Downloads1,578Last 12 Months45Last 6 weeks7 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
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
Task Allocation in Distributed Data Processing
Chu, Holloway, Lan, M.-T., & Efe (1980) · Computer · doi:10.1109/mc.1980.1653419 · Cited by 357
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
Cited by
Maddah-Ali, M. A., & Niesen, U. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2306938 · Cited by 1,726
Distributed Caching Algorithms for Content Distribution Networks
Borst, S., Gupta, V., & Walid, A. (2010) · 2010 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2010.5461964 · Cited by 681
Decentralized Coded Caching Attains Order-Optimal Memory-Rate Tradeoff
Maddah-Ali, M. A., & Niesen, U. (2015) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2014.2317316 · Cited by 626
The Exact Rate-Memory Tradeoff for Caching With Uncoded Prefetching
Yu, Q., Maddah-Ali, M. A., & Avestimehr, A. S. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2785237 · Cited by 278
A microeconomic approach to optimal resource allocation in distributed computer systems
Kurose, J. F., & Simha, R. (1989) · IEEE Transactions on Computers · doi:10.1109/12.24272 · Cited by 276
Metadata
- Authors
- Dowdy, L. W., & Foster, D. V.
- Venue
- ACM Computing Surveys
- Published
- 1982-06
- Volume
- 14
- Issue
- 2
- Pages
- 287-313
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2026102701
- Cited by
- 472
- References
- 3
- FWCI
- 8.23
- 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: Comparative Models of the File Assignment Problem. https://app.cochat.ai/papers/10.1145/356876.356883
- The paper
- Dowdy, L. W., & Foster, D. V. (1982). Comparative Models of the File Assignment Problem. ACM Computing Surveys. https://doi.org/10.1145/356876.356883
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.