The DOI matches its Crossref record; 65 of the 65 references it cites were found in a registry or an index.
Learning scheduling algorithms for data processing clusters
Open accessAbstract
Efficiently scheduling data processing jobs on distributed compute clusters requires complex algorithms. Current systems use simple, generalized heuristics and ignore workload characteristics, since developing and tuning a scheduling policy for each workload is infeasible. In this paper, we show that modern machine learning techniques can generate highly-efficient policies automatically.
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
Adam: A Method for Stochastic Optimization
Kingma, D. P., & Ba, J. (2014) · arXiv · doi:10.48550/arxiv.1412.6980 · Cited by 98,946
Human-level control through deep reinforcement learning
Mnih, V., Kavukcuoglu, K., Silver, D., Rusu, A. A., Veness, J., Bellemare, M. G., Graves, A., Riedmiller, M., Fidjeland, A. K., Ostrovski, G., et al. (2015) · Nature · doi:10.1038/nature14236 · Cited by 30,357
Mastering the game of Go with deep neural networks and tree search
Silver, D., Huang, A., Maddison, C. J., Guez, A., Sifre, L., van den Driessche, G., Schrittwieser, J., Antonoglou, I., Panneershelvam, V., Lanctot, M., et al. (2016) · Nature · doi:10.1038/nature16961 · Cited by 15,612
Monte Carlo sampling methods using Markov chains and their applications.
Hastings, W. K. (1970) · Biometrika · doi:10.1093/biomet/57.1.97 · Cited by 15,195
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
TensorFlow: A system for large-scale machine learning
Abadi, M., Barham, P., Chen, J., Chen, Z., Davis, A., Dean, J., Devin, M., Ghemawat, S., Irving, G., Isard, M., et al. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1605.08695 · Cited by 11,822
Continuous control with deep reinforcement learning
Lillicrap, T. P., Hunt, J. J., Pritzel, A., Heess, N., Erez, T., Tassa, Y., Silver, D., & Wierstra, D. (2015) · arXiv · doi:10.48550/arxiv.1509.02971 · Cited by 10,782
Mastering the game of Go without human knowledge
Silver, D., Schrittwieser, J., Simonyan, K., Antonoglou, I., Huang, A., Guez, A., Hubert, T., Baker, L., Lai, M., Bolton, A., et al. (2017) · Nature · doi:10.1038/nature24270 · Cited by 9,084
Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks
Finn, C., Abbeel, P., & Levine, S. (2017) · arXiv · doi:10.48550/arxiv.1703.03400 · Cited by 8,512
Reinforcement Learning: An Introduction
Johnson, J. D., Li, J., & Chen, Z. (2000) · Neurocomputing · doi:10.1016/s0925-2312(00)00324-6 · Cited by 8,414
Proceedings of the 25th international conference on Machine learning - ICML '08
(2008) · doi:10.1145/1390156 · Cited by 6,680
Bengio, Y., Louradour, J., Collobert, R., & Weston, J. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553380 · Cited by 5,366 · cited 1×
“The concept of gradually increasing job sequence length—and therefore, problem complexity—during training is a realization of curriculum learning [8] for cluster scheduling.”
BackgroundHagan, M., Demuth, H. B., Beale, M. H., & Jes?s, O. D. (2016) · Institutional Repository of the National University Open and Distance UNAD (Universidad Nacional Abierta y a Distancia) · Cited by 5,133
Trust region policy optimization
Schulman, J., Levine, S., Moritz, P., Jordan, M. I., & Abbeel, P. (2015) · arXiv · doi:10.48550/arxiv.1502.05477 · Cited by 4,578
Resilient distributed datasets: a fault-tolerant abstraction for in-memory cluster computing
Zaharia, M., Chowdhury, M., Das, T., Dave, A., Ma, J. H., McCauley, M., Franklin, M. J. M., Shenker, S. J., & Stoica, I. G. (2012) · Cited by 3,622
Simple Statistical Gradient-Following Algorithms for Connectionist Reinforcement Learning
Williams, R. J. (1992) · Machine Learning · doi:10.1007/bf00992696 · Cited by 3,416
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
Apache Hadoop YARN: yet another resource negotiator
Vavilapalli, V. K., Murthy, A. C., Douglas, C., Agarwal, S., Konar, M., Evans, R., Graves, T., Lowe, J., Shah, H., Seth, S., et al. (2013) · Proceedings of the 4th annual Symposium on Cloud Computing · doi:10.1145/2523616.2523633 · Cited by 1,848
Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering
Defferrard, M., Bresson, X., & Vandergheynst, P. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1606.09375 · Cited by 1,673
(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 · cited 4×
“A good scheduling policy packs work tightly to reduce fragmentation [18; 19; 46], prioritizes jobs according to high-level metrics such as user-perceived latency [47], and avoids inefficiencies due to incorrect job configurations [14].”
BackgroundInfluentialResource 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 · cited 3×
“For example, if the objective is to minimize average JCT, Decima penalizes the agent −τ × J at each time step, where τ is the absolute time (in seconds) since last action and J is the number of jobs in the system [28].”
BackgroundMethodInfluentialSelf-citationScheduling multithreaded computations by work stealing
Blumofe, R. D., & Leiserson, C. E. (1999) · Journal of the ACM · doi:10.1145/324133.324234 · Cited by 1,336
Nguyen, T. T., Nguyen, N. D., & Nahavandi, S. (2020) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2020.2977374 · Cited by 1,306
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
Learning Combinatorial Optimization Algorithms over Graphs
Dai, H., Khalil, E. B., Zhang, Y., Dilkina, B., & Song, L. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1704.01665 · Cited by 1,007
Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence (UAI 2010)
Adams, R. P., Dahl, G. E., & Murray, I. (2010) · Cited by 966
Cooperative Multi-agent Control Using Deep Reinforcement Learning
Gupta, J. K., Egorov, M., & Kochenderfer, M. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-71682-4_5 · Cited by 874
Quincy: fair scheduling for distributed computing clusters
Isard, M., Prabhakaran, V., Currey, J., Wieder, U., Talwar, K., & Goldberg, A. (2009) · Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles · doi:10.1145/1629575.1629601 · Cited by 856
Constrained Policy Optimization
Achiam, J., Held, D., Tamar, A., & Abbeel, P. (2017) · arXiv · doi:10.48550/arxiv.1705.10528 · Cited by 804
Quasar: resource-efficient and QoS-aware cluster management
Delimitrou, C., & Kozyrakis, C. (2014) · Proceedings of the 19th international conference on Architectural support for programming languages and operating systems · doi:10.1145/2541940.2541941 · Cited by 702
Omega: flexible, scalable schedulers for large compute clusters
Schwarzkopf, M., Konwinski, A., Abd-El-Malek, M., & Wilkes, J. (2013) · Proceedings of the 8th ACM European Conference on Computer Systems · doi:10.1145/2465351.2465386 · Cited by 650
Self-citationParagon: QoS-aware scheduling for heterogeneous datacenters
Delimitrou, C., & Kozyrakis, C. (2013) · Proceedings of the eighteenth international conference on Architectural support for programming languages and operating systems · doi:10.1145/2451116.2451125 · Cited by 617
Critical-path planning and scheduling
Kelley, J. E., & Walker, M. R. (1959) · Papers presented at the December 1-3, 1959, eastern joint IRE-AIEE-ACM computer conference on - IRE-AIEE-ACM '59 (Eastern) · doi:10.1145/1460299.1460318 · Cited by 569
Robust adversarial reinforcement learning
Pinto, L., Davidson, J., Sukthankar, R., & Gupta, A. (2017) · arXiv · doi:10.48550/arxiv.1703.02702 · Cited by 507 · cited 1×
“To increase robustness of a scheduling policy against such changes, it may be helpful to train the agent on worst-case situations or adversarial workloads, drawing on the emerging literature on robust adversarial RL [64].”
BackgroundBarroso, L. A., Clidaras, J., & Hölzle, U. (2013) · Synthesis lectures on computer architecture · doi:10.2200/s00516ed2v01y201306cac024 · Cited by 489
Multi-resource packing for cluster schedulers
Grandl, R., Ananthanarayanan, G., Kandula, S., Rao, S., & Akella, A. (2014) · Proceedings of the 2014 ACM conference on SIGCOMM · doi:10.1145/2619239.2626334 · Cited by 421
Neuro-dynamic programming: an overview
Bertsekas, D. P., & Tsitsiklis, J. N. (2002) · Proceedings of 1995 34th IEEE Conference on Decision and Control · doi:10.1109/cdc.1995.478953 · Cited by 411
Making sense of performance in data analytics frameworks
Ousterhout, K., Rasti, R., Ratnasamy, S., Shenker, S. J., & Chun, B.-G. (2015) · Networked Systems Design and Implementation · Cited by 337
FlumeJava: easy, efficient data-parallel pipelines
Chambers, C., Raniwala, A., Perry, F., Adams, S., Henry, R. R., Bradshaw, R., & Weizenbaum, N. (2010) · Proceedings of the 31st ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1806596.1806638 · Cited by 331
Variance Reduction Techniques for Gradient Estimates in Reinforcement Learning
Greensmith, E., Bartlett, P. L., & Baxter, J. (2004) · doi:10.5555/1005332.1044710 · Cited by 300
Device Placement Optimization with Reinforcement Learning
Mirhoseini, A., Pham, H., Le, Q. V., Steiner, B., Larsen, R., Zhou, Y., Kumar, N., Norouzi, M., Bengio, S., & Dean, J. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1706.04972 · Cited by 299
The Optimal Reward Baseline for Gradient-Based Reinforcement LearningPreprint
Weaver, L., & Tao, N. (2001) · Conference on Uncertainty in Artificial Intelligence · doi:10.48550/arxiv.1301.2315 · Cited by 288
Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search
Li, Z., Chen, Q., & Koltun, V. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1810.10659 · Cited by 287
Jockey: guaranteed job latency in data parallel clusters
Ferguson, A. D., Bodik, P., Kandula, S., Boutin, E., & Fonseca, R. (2012) · Proceedings of the 7th ACM european conference on Computer Systems · doi:10.1145/2168836.2168847 · Cited by 286
Imbalance in the cloud: An analysis on Alibaba cluster trace
Lu, C., Ye, K., Xu, G., Xu, C.-Z., & Bai, T. (2017) · 2017 IEEE International Conference on Big Data (Big Data) · doi:10.1109/bigdata.2017.8258257 · Cited by 190
Basis Function Adaptation in Temporal Difference Reinforcement Learning
Menache, I., Mannor, S., & Shimkin, N. (2005) · Annals of Operations Research · doi:10.1007/s10479-005-5732-z · Cited by 184
Re-optimizing data-parallel computing
Agarwal, S., Kandula, S., Bruno, N., Wu, M.-C., Stoica, I. G., & Zhou, J. (2012) · Cited by 174
Choosy: max-min fair sharing for datacenter jobs with constraints
Ghodsi, A., Zaharia, M., Shenker, S., & Stoica, I. (2013) · Proceedings of the 8th ACM European Conference on Computer Systems · doi:10.1145/2465351.2465387 · Cited by 172
TetriSched: global rescheduling with adaptive plan-ahead in dynamic heterogeneous clusters
Tumanov, A., Zhu, T., Park, J. W., Kozuch, M. A., Harchol-Balter, M., & Ganger, G. R. (2016) · Proceedings of the Eleventh European Conference on Computer Systems · doi:10.1145/2901318.2901355 · Cited by 170
Firmament: fast, centralized cluster scheduling at scale
Gog, I., Schwarzkopf, M., Gleave, A., Watson, R. N. M., & Hand, S. (2016) · Operating Systems Design and Implementation · doi:10.5555/3026877.3026886 · Cited by 167
Self-citationGraphene: packing and dependency-aware scheduling for data-parallel clusters
Grandl, R., Kandula, S., Rao, S., Akella, A., & Kulkarni, J. (2016) · Operating Systems Design and Implementation · doi:10.5555/3026877.3026885 · Cited by 155
Altruistic scheduling in multi-resource clusters
Grandl, R., Chowdhury, M., Akella, A., & Ananthanarayanan, G. (2016) · Operating Systems Design and Implementation · doi:10.5555/3026877.3026884 · Cited by 139
Reinforcement Learning for MDPs with Constraints
Geibel, P. (2006) · Lecture notes in computer science · doi:10.1007/11871842_63 · Cited by 123
Hierarchical scheduling for diverse datacenter workloads
Bhattacharya, A., Culler, D., Friedman, E., Ghodsi, A., Shenker, S. J., & Stoica, I. G. (2013) · Symposium on Cloud Computing · doi:10.1145/2523616.2523637 · Cited by 112
A Hierarchical Model for Device Placement
Mirhoseini, A., Goldie, A., Pham, H., Steiner, B., Le, Q. V., & Dean, J. (2018) · International Conference on Learning Representations · Cited by 108
Efficient queue management for cluster scheduling
Rasley, J., Karanasos, K., Kandula, S., Fonseca, R., Vojnović, M., & Rao, S. (2016) · European Conference on Computer Systems · doi:10.1145/2901318.2901354 · Cited by 100
Multi-processor scheduling to minimize flow time with ε resource augmentation
Chekuri, C., Goel, A., Khanna, S., & Kumar, A. (2004) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1007352.1007411 · Cited by 97
Hillier, F. S., Lowe, T. J., & Chhajed, D. (2008) · International series in management science/operations research/International series in operations research & management science · doi:10.1007/978-0-387-73699-0 · Cited by 86
Variance Reduction for Reinforcement Learning in Input-Driven Environments
Mao, H., Venkatakrishnan, S. B., Schwarzkopf, M., & Alizadeh, M. (2018) · arXiv · doi:10.48550/arxiv.1807.02264 · Cited by 62 · cited 3×
“To resolve this problem, we build upon a recently-proposed variance reduction technique for “input-driven” environments [55], where”
BackgroundMethodInfluentialSelf-citationReal-world Video Adaptation with Reinforcement LearningPreprint
Mao, H., Chen, S., Dimmery, D., Singh, S., Blaisdell, D., Tian, Y., Alizadeh, M., & Bakshy, E. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2008.12858 · Cited by 61
Self-citationEvaluating job packing in warehouse-scale computing
Verma, A., Korupolu, M. R., & Wilkes, J. (2014) · Proceedings · doi:10.1109/cluster.2014.6968735 · Cited by 37
Placeto: Learning Generalizable Device Placement Algorithms for Distributed Machine LearningPreprint
Addanki, R., Venkatakrishnan, S. B., Gupta, S., Mao, H., & Alizadeh, M. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1906.08879 · Cited by 32
Self-citation
Cited by
Neo: a learned query optimizer
Marcus, R., Negi, P., Mao, H., Zhang, C., Alizadeh, M., Kraska, T., Papaemmanouil, O., & Tatbul, N. (2019) · Proceedings of the VLDB Endowment · doi:10.14778/3342263.3342644 · Cited by 389
Self-citationDeep reinforcement learning meets graph neural networks: Exploring a routing optimization use case
Almasan, P., Suárez-Varela, J., Rusek, K., Barlet-Ros, P., & Cabellos-Aparicio, A. (2022) · Computer Communications · doi:10.1016/j.comcom.2022.09.029 · Cited by 290
Deep reinforcement learning: a survey
Wang, H.-N., Liu, N., Zhang, Y.-Y., Feng, D.-W., Huang, F., Li, D.-S., & Zhang, Y.-M. (2020) · Frontiers of Information Technology & Electronic Engineering · doi:10.1631/fitee.1900533 · Cited by 274
NetLLM: adapting large language models for networking
Wu, D., Wang, X., Qiao, Y., Wang, Z., Jiang, J., Cui, S., & Wang, F. (2024) · Proceedings of the ACM SIGCOMM 2024 Conference · doi:10.1145/3651890.3672268 · Cited by 167
“• Cluster job scheduling (CJS) trains a RL scheduler to schedule incoming jobs within the distributed computing cluster [63, 78].”
BackgroundMethodInfluentialNetwork planning with deep reinforcement learning
Zhu, H., Gupta, V., Ahuja, S. S., Tian, Y., Zhang, Y., & Jin, X. (2021) · Proceedings of the 2021 ACM SIGCOMM 2021 Conference · doi:10.1145/3452296.3472902 · Cited by 112
Metadata
- Authors
- Mao, H., Schwarzkopf, M., Venkatakrishnan, S. B., Meng, Z., & Alizadeh, M.
- Venue
- Proceedings of the ACM Special Interest Group on Data Communication
- Publisher
- ACM
- Published
- 2019-08-19
- Pages
- 270-288
- OpenAlex
- W2968986602
- Cited by
- 723
- References
- 65
- FWCI
- 74.09
- Type
- conference paper
- Language
- en
- Open access
- gold
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.