The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Multi-resource packing for cluster schedulers
Open accessAbstract
Tasks in modern data parallel clusters have highly diverse resource requirements, along CPU, memory, disk and network. Any of these resources may become bottlenecks and hence, the likelihood of wasting resources due to fragmentation is now larger. Today's schedulers do not explicitly reduce fragmentation. Worse, since they only allocate cores and memory, the resources that they ignore (disk and network) can be over-allocated leading to interference, failures and hogging of cores or memory that could have been used by other tasks. We present Tetris, a cluster scheduler that packs, i.e., matches multi-resource task requirements with resource availabilities of machines so as to increase cluster efficiency (makespan). Further, Tetris uses an analog of shortest-running-time-first to trade-off cluster efficiency for speeding up individual jobs. Tetris' packing heuristics seamlessly work alongside a large class of fairness policies. Trace-driven simulations and deployment of our prototype on a 250 node cluster shows median gains of 30% in job completion time while achieving nearly perfect fairness.
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Borg [25], the Kubernetes lineage [52], Tetris [26], Hawk [27], and Sparrow [28] pack stateless jobs; Gaia [22] optimizes geo-distributed training .”
From Janus: Joint Prefill/Decode Disaggregation with KV-Cache-Aware Multi-Cloud Routing for Edge-Adjacent LLM Serving (2026) · cites this paper as [26]
Experimental — accuracy not yet measured
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
Survivable Network Design (2011) · Springer eBooks · doi:10.1007/springerreference_57547 · Cited by 3,228
A scalable, commodity data center network architecture
Al-Fares, M., Loukissas, A., & Vahdat, A. M. (2008) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1402946.1402967 · Cited by 3,212
Isard, M., Budiu, M., Yu, Y., Birrell, A. D., & Fetterly, D. (2007) · European Conference on Computer Systems · doi:10.1145/1272996.1273005 · Cited by 2,433
Greenberg, A. G., Hamilton, J. R., Jain, N., Kandula, S., Kim, C., Lahiri, P., Maltz, D. A., Patel, P., & Sengupta, S. (2009) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/1592568.1592576 · Cited by 2,114
Self-citationA scalable, commodity data center network architecture
Al-Fares, M., Loukissas, A., & Vahdat, A. M. (2008) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/1402958.1402967 · Cited by 1,680
Thusoo, A., Sarma, J. S., Jain, N., Shao, Z., Chakka, P., Anthony, S., Liu, H., Wyckoff, P., & Murthy, R. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687553.1687609 · Cited by 1,559
Zaharia, M., Borthakur, D., Sarma, J. S., Elmeleegy, K., Shenker, S. J., & Stoica, I. G. (2010) · European Conference on Computer Systems · doi:10.1145/1755913.1755940 · Cited by 1,394
Guo, C., Lu, G., Li, D., Wu, H., Zhang, X., Shi, Y., Tian, C., Zhang, Y., & Lu, S. (2009) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/1592568.1592577 · Cited by 1,374
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,120
Vazirani, V. V. (2003) · Springer eBooks · doi:10.1007/978-3-662-04565-7 · Cited by 930
Isard, M., Prabhakaran, V., Currey, J., Wieder, U., Talwar, K., & Goldberg, A. V. (2009) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/1629575.1629601 · Cited by 856
Managing data transfers in computer clusters with orchestra
Chowdhury, M., Zaharia, M., Ma, J. H., Jordan, M. I., & Stoica, I. G. (2011) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/2018436.2018448 · Cited by 547
Beowulf Cluster Computing with Linux
(2001) · The MIT Press eBooks · doi:10.7551/mitpress/1556.001.0001 · Cited by 383
Condor: A Distributed Job Scheduler
Tannenbaum, T., Wright, D., Miller, K., & Livny, M. (2001) · The MIT Press eBooks · doi:10.7551/mitpress/1556.003.0019 · Cited by 380
Sharing the data center network
Shieh, A., Kandula, S., Greenberg, A. G., Kim, C., & Saha, B. (2011) · doi:10.5555/1972457.1972489 · Cited by 342
Self-citationKörte, B., & Vygen, J. (2002) · Algorithms and combinatorics · doi:10.1007/978-3-662-21711-5_16 · Cited by 287
Gulwani, S., Mehra, K. K., & Chilimbi, T. M. (2009) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/1480881.1480898 · Cited by 266
Heuristics for Vector Bin Packing
Panigrahy, R., Talwar, K., Uyeda, L., & Wieder, U. (2011) · Cited by 203
Connection Scheduling in Web Servers
Crovella, M. E., Frangioso, R., & Harchol‐Balter, M. (1999) · Cited by 200
Re-optimizing data-parallel computing
Agarwal, S., Kandula, S., Bruno, N., Wu, M.-C., Stoica, I. G., & Zhou, J. (2012) · Cited by 174
Self-citationClassifying scheduling policies with respect to unfairness in an M/GI/1
Wierman, A., & Harchol‐Balter, M. (2003) · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) · doi:10.1145/781027.781057 · Cited by 170
SCOPE: parallel databases meet MapReduce
Zhou, J., Bruno, N., Wu, M.-C., Larson, P.-Å., Chaiken, R., & Shakib, D. (2012) · The VLDB Journal · doi:10.1007/s00778-012-0280-z · Cited by 152
Leveraging endpoint flexibility in data-intensive clusters
Chowdhury, M., Kandula, S., & Stoica, I. G. (2013) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/2486001.2486021 · Cited by 150
Self-citationThere is no asymptotic PTAS for two-dimensional vector packing
Woeginger, G. J. (1997) · Information Processing Letters · doi:10.1016/s0020-0190(97)00179-8 · Cited by 124
Rasmussen, A., Lam, V. T., Conley, M., Porter, G., Kapoor, R., & Vahdat, A. M. (2012) · ACM Symposium on Cloud Computing (SoCC) · doi:10.1145/2391229.2391242 · Cited by 72
Tight bounds for online vector bin packing
Azar, Y., Cohen, I. R., Kamara, S., & Shepherd, F. B. (2013) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2488608.2488730 · Cited by 59
Predictive VM consolidation on multiple resources: Beyond load balancing
Lu, L., Zhang, H., Evgenia Smirni, A., Jiang, G., & Yoshihira, K. (2013) · International Workshop on Quality of Service · doi:10.1109/iwqos.2013.6550268 · Cited by 20
Tail asymptotics for policies favoring short jobs in a many-flows regime
Yang, C.-W., Wierman, A., Shakkottai, S., & Harchol‐Balter, M. (2006) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/1140103.1140290 · Cited by 15
Tail asymptotics for policies favoring short jobs in a many-flows regime
Yang, C.-W., Wierman, A., Shakkottai, S., & Harchol‐Balter, M. (2006) · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) · doi:10.1145/1140277.1140290 · Cited by 8
Flagged first, then by citations
Cited by
Sorted by citations
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
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
Self-citationLearning scheduling algorithms for data processing clusters
Mao, H., Schwarzkopf, M., Venkatakrishnan, S. B., Meng, Z., & Alizadeh, M. (2019) · ACM Special Interest Group on Data Communication · doi:10.1145/3341302.3342080 · Cited by 831
Optimus: an efficient dynamic resource scheduler for deep learning clusters
Peng, Y.-H., Bao, Y., Chen, Y.-R., Wu, C., & Guo, C.-X. (2018) · European Conference on Computer Systems · doi:10.1145/3190508.3190517 · Cited by 544
Pond: CXL-Based Memory Pooling Systems for Cloud Platforms
Li, H., Berger, D. S., Hsu, L., Ernst, D., Zardoshti, P., Novaković, S., Shah, M., Rajadnya, S., Lee, S., Agarwal, I., et al. (2023) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3575693.3578835 · Cited by 352
Metadata
- Authors
- Grandl, R., Ananthanarayanan, G., Kandula, S., Rao, S., & Akella, A.
- Affiliations
- Microsoft (United States) (US)
- Venue
- Proceedings of the 2014 ACM conference on SIGCOMM
- Publisher
- ACM
- Published
- 2014-08-17
- Pages
- 455-466
- OpenAlex
- W2133569115
- Cited by
- 421
- References
- 29
- Citations by year
- 2026: 13 · 2025: 13 · 2024: 19 · 2023: 28 · 2022: 25 · 2021: 54 · 2020: 44 · 2019: 59 · 2018: 56 · 2017: 42 · 2016: 32 · 2015: 34 · 2014: 2
- FWCI
- 28.55
- Type
- conference paper
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- ACM SIGCOMM Conference (SIGCOMM) (publishedVersion)
- Funders
- National Science Foundation (1302041, 1139158, 1040757)
- Defense Advanced Research Projects Agency
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Distributed and Parallel Computing Systems
- Physical Sciences › Computer Science › Information Systems › Cloud Computing and Resource Management
- Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques
- Keywords
- cluster scheduling, resource fragmentation, makespan, job completion time
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
