Heavy-Traffic Optimal Size- and State-Aware Dispatching

Author:

Xie Runhan1ORCID,Grosof Isaac2ORCID,Scully Ziv3ORCID

Affiliation:

1. Department of Industrial Engineering and Operations Research, University of California, Berkeley, Berkeley, CA, USA

2. Computer Science Department, Carnegie Mellon University & School of Industrial and Systems Engineering, Georgia Institute of Technology, Pittsburgh, PA, USA

3. School of Operations Research and Information Engineering, Cornell University, Ithaca, NY, USA

Abstract

We study the problem of dispatching jobs to multiple FCFS (First-Come, First-Served) queues. We consider the case where the dispatcher is size-aware, meaning it learns the size (i.e. service time) of each job as it arrives; and state-aware, meaning it always knows the amount of work (i.e. total remaining service time) at each queue. While size- and state-aware dispatching to FCFS queues has been extensively studied, little is known about optimal dispatching for the objective of minimizing mean delay. In this work, we propose the first size- and state-aware dispatching policy, called CARD (Controlled Asymmetry Reduces Delay), that provably minimizes mean delay in heavy traffic. This work summarizes our full paper.

Funder

National Science Foundation

Georgia Institute of Technology School of Industrial and Systems Engineering

Publisher

Association for Computing Machinery (ACM)

Reference15 articles.

1. Multi-layered round robin routing for parallel servers

2. Hanhua Feng, Vishal Misra, and Dan Rubenstein. 2005. Optimal state-free, sizeaware dispatching for heterogeneous M/G/-type systems. Performance evaluation 62, 1--4 (2005), 475--492.

3. Load Balancing Guardrails

4. On Choosing a Task Assignment Policy for a Distributed Server System

5. Surprising results on task assignment in server farms with high-variability workloads

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3