The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Quincy: fair scheduling for distributed computing clusters
Abstract
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations close to their data is crucial for performance, is increasingly common and arises in systems such as MapReduce, Hadoop, and Dryad as well as many grid-computing environments. We argue that data-intensive computation benefits from a fine-grain resource sharing model that differs from the coarser semi-static resource allocations implemented by most existing cluster computing architectures. The problem of scheduling with locality and fairness constraints has not previously been extensively studied under this resource-sharing model.
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
MapReduce: simplified data processing on large clusters
Dean, J., & Ghemawat, S. (2008) · Communications of the ACM · doi:10.1145/1327452.1327492 · Cited by 18,476
Ghemawat, S., Gobioff, H., & Leung, S.-T. (2003) · ACM SIGOPS Operating Systems Review · doi:10.1145/1165389.945450 · Cited by 4,984
Ford, D. R., & Fulkerson, D. R. (1962) · Cited by 4,072
Approximation Algorithms for NP-Hard Problems
(1997) · ACM SIGACT News · doi:10.1145/261342.571216 · Cited by 3,103
Dryad: distributed data-parallel programs from sequential building blocks
Isard, M., Budiu, M., Yu, Y., Birrell, A., & Fetterly, D. (2007) · Proceedings of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems 2007 · doi:10.1145/1272996.1273005 · Cited by 2,432
Self-citationDistributed computing in practice: the Condor experience
Thain, D., Tannenbaum, T., & Livny, M. (2005) · Concurrency and Computation: Practice and Experience · doi:10.1002/cpe.938 · Cited by 1,886
Improving MapReduce performance in heterogeneous environments
Zaharia, M., Konwinski, A., Joseph, A. D., Katz, R. H., & Stoica, I. G. (2008) · doi:10.5555/1855741.1855744 · Cited by 1,588
Ghemawat, S., Gobioff, H., & Leung, S.-T. (2003) · Proceedings of the nineteenth ACM symposium on Operating systems principles · doi:10.1145/945445.945450 · Cited by 1,423
Matchmaking: distributed resource management for high throughput computing
Raman, R., Livny, M., & Solomon, M. (2002) · Proceedings. The Seventh International Symposium on High Performance Distributed Computing (Cat. No.98TB100244) · doi:10.1109/hpdc.1998.709966 · Cited by 747
Yu, Y., Isard, M., Fetterly, D., Budiu, M., Erlingsson, Ú., Gunda, P. K., & Currey, J. (2008) · doi:10.5555/1855741.1855742 · Cited by 689
Self-citationMultiprocessor Scheduling with the Aid of Network Flow Algorithms
Stone, H. S. (1977) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1977.233840 · Cited by 680
Finding Minimum-Cost Circulations by Successive Approximation
Goldberg, A. V., & Tarjan, R. E. (1990) · Mathematics of Operations Research · doi:10.1287/moor.15.3.430 · Cited by 394
Self-citationAn Efficient Implementation of a Scaling Minimum-Cost Flow Algorithm
Goldberg, A. V. (1997) · Journal of Algorithms · doi:10.1006/jagm.1995.0805 · Cited by 382
Self-citationJob Scheduling for Multi-User MapReduce Clusters
Zaharia, M., Borthakur, D., Sarma, J. S., Elmeleegy, K., Shenker, S. J., & Stoica, I. G. (2009) · UC Berkeley · Cited by 357
Kay, J., & Lauder, P. (1988) · Communications of the ACM · doi:10.1145/35043.35047 · Cited by 254
Models of machines and computation for mapping in multicomputers
Norman, M. G., & Thanisch, P. (1993) · ACM Computing Surveys · doi:10.1145/158439.158908 · Cited by 168
Explicit control a batch-aware distributed file system
Bent, J., Thain, D., Arpaci-Dusseau, A. C., Arpaci-Dusseau, R. H., & Livny, M. (2004) · Cited by 115
A scheduling philosophy for multi-processing systems
Lampson, B. (1967) · doi:10.1145/800001.811677 · Cited by 18
Cited by
(2011) · doi:10.5555/1972457.1972488 · Cited by 1,619
Large-scale cluster management at Google with Borg
Verma, A., Pedrosa, L., Korupolu, M., Oppenheimer, D., Tune, E., & Wilkes, J. (2015) · Proceedings of the Tenth European Conference on Computer Systems · doi:10.1145/2741948.2741964 · Cited by 1,468
Delay scheduling: a simple technique for achieving locality and fairness in cluster scheduling
Zaharia, M., Borthakur, D., Sen Sarma, J., Elmeleegy, K., Shenker, S., & Stoica, I. (2010) · Proceedings of the 5th European conference on Computer systems · doi:10.1145/1755913.1755940 · Cited by 1,393
Resource Management with Deep Reinforcement Learning
Mao, H., Alizadeh, M., Menache, I., & Kandula, S. (2016) · Proceedings of the 15th ACM Workshop on Hot Topics in Networks · doi:10.1145/3005745.3005750 · Cited by 1,353
Dominant resource fairness: fair allocation of multiple resource types
Ghodsi, A., Zaharia, M., Hindman, B., Konwinski, A., Shenker, S. J., & Stoica, I. G. (2011) · doi:10.5555/1972457.1972490 · Cited by 1,049
Metadata
- Authors
- Isard, M., Prabhakaran, V., Currey, J., Wieder, U., Talwar, K., & Goldberg, A.
- Venue
- Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles
- Publisher
- ACM
- Published
- 2009-10-11
- Pages
- 261-276
- OpenAlex
- W2022678927
- Cited by
- 856
- References
- 18
- FWCI
- 39.95
- Type
- conference paper
- 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.