{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T18:19:04Z","timestamp":1774030744695,"version":"3.50.1"},"reference-count":50,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Performance Evaluation"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.peva.2026.102551","type":"journal-article","created":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T14:15:48Z","timestamp":1771510548000},"page":"102551","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Dispatching policies in data center clusters: Insights from Google and Alibaba workloads"],"prefix":"10.1016","volume":"172","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-3624-0190","authenticated-orcid":false,"given":"Mert","family":"Yildiz","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8699-1084","authenticated-orcid":false,"given":"Alexey","family":"Rolich","sequence":"additional","affiliation":[]},{"given":"Andrea","family":"Baiocchi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.peva.2026.102551_b1","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF02024743","article-title":"Numerical performance of approximate queuing formulae with application to flexible manufacturing systems","volume":"3","author":"Marchal","year":"1985","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.peva.2026.102551_b2","series-title":"Performance Modeling and Design of Computer Systems: Queueing Theory in Action","author":"Harchol-Balter","year":"2013"},{"issue":"2","key":"10.1016\/j.peva.2026.102551_b3","doi-asserted-by":"crossref","DOI":"10.1145\/3154498","article-title":"Designing low-complexity heavy-traffic delay-optimal load balancing schemes: Theory to algorithms","volume":"1","author":"Zhou","year":"2017","journal-title":"Proc. ACM Meas. Anal. Comput. Syst."},{"key":"10.1016\/j.peva.2026.102551_b4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jnca.2019.06.006","article-title":"A comprehensive survey for scheduling techniques in cloud computing","volume":"143","author":"Kumar","year":"2019","journal-title":"J. Netw. Comput. Appl."},{"issue":"1","key":"10.1016\/j.peva.2026.102551_b5","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1109\/COMST.2023.3329027","article-title":"A survey on scheduling techniques in computing and network convergence","volume":"26","author":"Tang","year":"2024","journal-title":"IEEE Commun. Surv. & Tutorials"},{"issue":"12","key":"10.1016\/j.peva.2026.102551_b6","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s11134-020-09684-6","article-title":"Open problems in queueing theory inspired by datacenter computing","volume":"97","author":"Harchol-Balter","year":"2021","journal-title":"Queueing Syst. Theory Appl."},{"key":"10.1016\/j.peva.2026.102551_b7","series-title":"2020 32nd International Teletraffic Congress","first-page":"81","article-title":"STAR and RATS: Multi-level dispatching policies","author":"Hyyti\u00e4","year":"2020"},{"key":"10.1016\/j.peva.2026.102551_b8","series-title":"Proceedings of the Twenty-Second International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing","first-page":"181","article-title":"Job dispatching policies for queueing systems with unknown service rates","author":"Choudhury","year":"2021"},{"issue":"3","key":"10.1016\/j.peva.2026.102551_b9","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/s11134-021-09713-y","article-title":"Dispatching to parallel servers","volume":"99","author":"Bilenne","year":"2021","journal-title":"Queueing Syst."},{"issue":"3\u20134","key":"10.1016\/j.peva.2026.102551_b10","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/s11134-022-09736-z","article-title":"A general \u2019power-of-d\u2019 dispatching framework for heterogeneous systems","volume":"102","author":"Jaleel","year":"2022","journal-title":"Queueing Syst."},{"key":"10.1016\/j.peva.2026.102551_b11","series-title":"Cluster-data\/ClusterData2011","author":"Wilkes","year":"2011"},{"key":"10.1016\/j.peva.2026.102551_b12","series-title":"Proceedings of the Tenth European Conference on Computer Systems","article-title":"Large-scale cluster management at Google with Borg","author":"Verma","year":"2015"},{"key":"10.1016\/j.peva.2026.102551_b13","series-title":"Cluster-data\/clusterdata2019","author":"Wilkes","year":"2019"},{"key":"10.1016\/j.peva.2026.102551_b14","series-title":"Proceedings of the Fifteenth European Conference on Computer Systems","article-title":"Borg: the next generation","author":"Tirmazi","year":"2020"},{"key":"10.1016\/j.peva.2026.102551_b15","series-title":"Trace-Based Workload Generation and Execution","first-page":"37","author":"Sfakianakis","year":"2021"},{"key":"10.1016\/j.peva.2026.102551_b16","series-title":"2024 IEEE 25th International Conference on High Performance Switching and Routing","first-page":"143","article-title":"Data-driven workload generation based on google data center measurements","author":"Yildiz","year":"2024"},{"key":"10.1016\/j.peva.2026.102551_b17","series-title":"2025 36th International Teletraffic Congress","first-page":"1","article-title":"Dispatching Odyssey: Exploring performance in computing clusters under real-world workloads","author":"Yildiz","year":"2025"},{"key":"10.1016\/j.peva.2026.102551_b18","series-title":"2025 23rd Mediterranean Communication and Computer Networking Conference","first-page":"1","article-title":"\u201cTwo-stagification\u201d: Job dispatching in large-scale clusters via a two-stage architecture","author":"Yildiz","year":"2025"},{"key":"10.1016\/j.peva.2026.102551_b19","series-title":"IEEE INFOCOM 2025 - IEEE Conference on Computer Communications Workshops","first-page":"1","article-title":"The merit of simple policies: Buying performance with parallelism and system architecture","author":"Yildiz","year":"2025"},{"issue":"1","key":"10.1016\/j.peva.2026.102551_b20","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1145\/277858.277942","article-title":"Task assignment in a distributed system (extended abstract): improving performance by unbalancing load","volume":"26","author":"Crovella","year":"1998","journal-title":"SIGMETRICS Perform. Eval. Rev."},{"key":"10.1016\/j.peva.2026.102551_b21","series-title":"Network Analysis Without Exponentiality Assumptions","author":"Harchol-Balter","year":"1996"},{"key":"10.1016\/j.peva.2026.102551_b22","first-page":"13","article-title":"Exploiting process lifetime distributions for dynamic load balancing","author":"Harchol-Balter","year":"1996"},{"key":"10.1016\/j.peva.2026.102551_b23","unstructured":"M. Harchol-Balter, The effect of heavy-tailed job size distributions on computer system design, in: Proceedings of ASA-IMS Conference on Applications of Heavy Tailed Distributions in Economics, Engineering and Statistics, Washington, DC, 1999."},{"issue":"2","key":"10.1016\/j.peva.2026.102551_b24","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1145\/762483.762486","article-title":"Size-based scheduling to improve web performance","volume":"21","author":"Harchol-Balter","year":"2003","journal-title":"ACM Trans. Comput. Syst."},{"issue":"2","key":"10.1016\/j.peva.2026.102551_b25","doi-asserted-by":"crossref","first-page":"406","DOI":"10.2307\/3213411","article-title":"On the optimal assignment of customers to parallel servers","volume":"15","author":"Weber","year":"1978","journal-title":"J. Appl. Probab."},{"issue":"1","key":"10.1016\/j.peva.2026.102551_b26","doi-asserted-by":"crossref","first-page":"181","DOI":"10.2307\/3213271","article-title":"Optimality of the shortest line discipline","volume":"14","author":"Winston","year":"1977","journal-title":"J. Appl. Probab."},{"key":"10.1016\/j.peva.2026.102551_b27","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0304-4149(87)90208-0","article-title":"Certain optimality properties of the first-come first-served discipline for G\/G\/s queues","volume":"25","author":"Daley","year":"1987","journal-title":"Stochastic Process. Appl."},{"issue":"6","key":"10.1016\/j.peva.2026.102551_b28","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1007\/BF00968472","article-title":"Approximation of multichannel queueing systems","volume":"21","author":"Foss","year":"1980","journal-title":"Sib. Math. J."},{"key":"10.1016\/j.peva.2026.102551_b29","series-title":"On the Optimality of FCFS for Networks of Multi-Server Queues","author":"Koole","year":"1992"},{"issue":"3","key":"10.1016\/j.peva.2026.102551_b30","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1239\/aap\/1377868534","article-title":"Partial flexibility in routeing and scheduling","volume":"45","author":"Akgun","year":"2013","journal-title":"Adv. in Appl. Probab."},{"key":"10.1016\/j.peva.2026.102551_b31","series-title":"Proceedings of the 11th EAI International Conference on Performance Evaluation Methodologies and Tools","first-page":"198","article-title":"Size-based routing to balance performance of the queues","author":"Abidini","year":"2017"},{"issue":"4","key":"10.1016\/j.peva.2026.102551_b32","first-page":"635","article-title":"Performance balancing size-interval routing policies","volume":"58","author":"Doncel","year":"2020","journal-title":"INFOR Inf. Syst. Oper. Res."},{"issue":"2","key":"10.1016\/j.peva.2026.102551_b33","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/j.peva.2009.09.007","article-title":"Analysis of SITA policies","volume":"67","author":"Bachmat","year":"2010","journal-title":"Perform. Eval."},{"issue":"1","key":"10.1016\/j.peva.2026.102551_b34","doi-asserted-by":"crossref","DOI":"10.1145\/3639035","article-title":"Heavy-traffic optimal size- and state-aware dispatching","volume":"8","author":"Xie","year":"2024","journal-title":"Proc. ACM Meas. Anal. Comput. Syst."},{"issue":"2","key":"10.1016\/j.peva.2026.102551_b35","doi-asserted-by":"crossref","first-page":"466","DOI":"10.2307\/3215039","article-title":"Optimality of the round-robin routing policy","volume":"31","author":"Liu","year":"1994","journal-title":"J. Appl. Probab."},{"issue":"4","key":"10.1016\/j.peva.2026.102551_b36","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1287\/opre.46.4.563","article-title":"Optimal load balancing on distributed homogeneous unreliable processors","volume":"46","author":"Liu","year":"1998","journal-title":"Oper. Res."},{"issue":"4","key":"10.1016\/j.peva.2026.102551_b37","doi-asserted-by":"crossref","first-page":"690=","DOI":"10.1109\/TAC.1980.1102445","article-title":"A simple dynamic routing problem","volume":"25","author":"Ephremides","year":"1980","journal-title":"IEEE Trans. Autom. Control"},{"key":"10.1016\/j.peva.2026.102551_b38","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.jpdc.2023.01.001","article-title":"Exploring job running path to predict runtime on multiple production supercomputers","volume":"175","author":"Yang","year":"2023","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/j.peva.2026.102551_b39","series-title":"Proceedings. International Conference on Parallel Processing Workshop","first-page":"514","article-title":"Characterization of backfilling strategies for parallel job scheduling","author":"Srinivasan","year":"2002"},{"key":"10.1016\/j.peva.2026.102551_b40","first-page":"55","article-title":"The application of backfilling in cluster systems","volume":"vol. 3","author":"Wang","year":"2009"},{"key":"10.1016\/j.peva.2026.102551_b41","series-title":"2019 19th IEEE\/ACM International Symposium on Cluster, Cloud and Grid Computing","first-page":"1","article-title":"One can only gain by replacing EASY backfilling: A simple scheduling policies case study","author":"Carastan-Santos","year":"2019"},{"issue":"1","key":"10.1016\/j.peva.2026.102551_b42","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/s11227-019-03004-3","article-title":"A hybrid scheduling platform: a runtime prediction reliability aware scheduling platform to improve HPC scheduling performance","volume":"76","author":"Naghshnejad","year":"2020","journal-title":"J. Supercomput."},{"key":"10.1016\/j.peva.2026.102551_b43","series-title":"European Conference on Parallel Processing","first-page":"120","article-title":"Plan-based job scheduling for supercomputers with shared burst buffers","author":"Kopanski","year":"2021"},{"issue":"12","key":"10.1016\/j.peva.2026.102551_b44","doi-asserted-by":"crossref","first-page":"4903","DOI":"10.1109\/TPDS.2022.3205325","article-title":"DRAS: Deep reinforcement learning for cluster scheduling in high performance computing","volume":"33","author":"Fan","year":"2022","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10.1016\/j.peva.2026.102551_b45","series-title":"Workshop on Job Scheduling Strategies for Parallel Processing","first-page":"3","article-title":"Architecture of the slurm workload manager","author":"Jette","year":"2023"},{"key":"10.1016\/j.peva.2026.102551_b46","series-title":"2024 19th Conference on Computer Science and Intelligence Systems","first-page":"385","article-title":"HPC operation with time-dependent cluster-wide power capping","author":"Kammeyer","year":"2024"},{"key":"10.1016\/j.peva.2026.102551_b47","series-title":"Proceedings of the 39th ACM International Conference on Supercomputing","first-page":"884","article-title":"ORA: Job runtime prediction for high-performance computing platforms using the online retrieval-augmented language model","author":"Liu","year":"2025"},{"key":"10.1016\/j.peva.2026.102551_b48","series-title":"Alibaba cluster trace v2018: Trace documentation","author":"Alibaba Group","year":"2018"},{"key":"10.1016\/j.peva.2026.102551_b49","series-title":"Proceedings of the International Symposium on Quality of Service","article-title":"Who limits the resource efficiency of my datacenter: an analysis of Alibaba datacenter traces","author":"Guo","year":"2019"},{"key":"10.1016\/j.peva.2026.102551_b50","series-title":"Proceedings of the 13th Symposium on Cloud Computing","first-page":"210","article-title":"Workload consolidation in Alibaba clusters: the good, the bad, and the ugly","author":"Zhang","year":"2022"}],"container-title":["Performance Evaluation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166531626000118?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166531626000118?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T17:29:24Z","timestamp":1774027764000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166531626000118"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":50,"alternative-id":["S0166531626000118"],"URL":"https:\/\/doi.org\/10.1016\/j.peva.2026.102551","relation":{},"ISSN":["0166-5316"],"issn-type":[{"value":"0166-5316","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Dispatching policies in data center clusters: Insights from Google and Alibaba workloads","name":"articletitle","label":"Article Title"},{"value":"Performance Evaluation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.peva.2026.102551","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"102551"}}