Mor Harchol-Balter

SIGMETRICS Perform. Evaluation Rev., September, 2023

Invited Paper: ServerFilling: A better approach to packing multiserver jobs.

[BibT_eX]

[DOI]

Proceedings of the 5th workshop on Advanced tools, 2023

2022

The most common queueing theory questions asked by computer systems practitioners.

[BibT_eX]

[DOI]

SIGMETRICS Perform. Evaluation Rev., 2022

The Case for Phase-Aware Scheduling of Parallelizable Jobs.

[BibT_eX]

[DOI]

SIGMETRICS Perform. Evaluation Rev., 2022

The multiserver job queueing model.

[BibT_eX]

[DOI]

Queueing Syst. Theory Appl., 2022

WCFS: a new framework for analyzing multiserver systems.

[BibT_eX]

[DOI]

Queueing Syst. Theory Appl., 2022

2021

Correction to: Multi-server queueing systems with multiple priority classes.

[BibT_eX]

[DOI]

Queueing Syst. Theory Appl., 2021

Open problems in queueing theory inspired by datacenter computing.

[BibT_eX]

[DOI]

Queueing Syst. Theory Appl., 2021

The M/M/k with Deterministic Setup Times.

[BibT_eX]

[DOI]

Jalani Williams

Weina Wang

Proc. ACM Meas. Anal. Comput. Syst., 2021

Zero Queueing for Multi-Server Jobs.

[BibT_eX]

[DOI]

Weina Wang

Qiaomin Xie

Proc. ACM Meas. Anal. Comput. Syst., 2021

Nudge: Stochastically Improving upon FCFS.

[BibT_eX]

[DOI]

Proc. ACM Meas. Anal. Comput. Syst., 2021

Optimal Scheduling in the Multiserver-job Model under Heavy Traffic.

[BibT_eX]

[DOI]

Proc. ACM Meas. Anal. Comput. Syst., 2021

To clean or not to clean: Malware removal strategies for servers under load.

[BibT_eX]

[DOI]

Sherwin Doroudi

Thanassis Avgerinos

Eur. J. Oper. Res., 2021

How to Schedule Near-Optimally under Real-World Constraints.

[BibT_eX]

[DOI]

CoRR, 2021

The Finite-Skip Method for Multiserver Analysis.

[BibT_eX]

[DOI]

CoRR, 2021

The Gittins Policy in the M/G/1 Queue.

[BibT_eX]

[DOI]

Proceedings of the 19th International Symposium on Modeling and Optimization in Mobile, 2021

Load balancing guardrails: keeping your heavy traffic on the road to low response times (invited paper).

[BibT_eX]

[DOI]

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Computing the Death Rate of COVID-19.

[BibT_eX]

[DOI]

Naveen Pai

Sean Zhang

Proceedings of the Computer Science Protecting Human Society Against Epidemics, 2021

2020

Optimal Multiserver Scheduling with Unknown Job Sizes in Heavy Traffic.

[BibT_eX]

[DOI]

SIGMETRICS Perform. Evaluation Rev., 2020

heSRPT: Parallel Scheduling to Minimize Mean Slowdown.

[BibT_eX]

[DOI]

Rein Vesilo

SIGMETRICS Perform. Evaluation Rev., 2020

Simple Near-Optimal Scheduling for the M/G/1.

[BibT_eX]

[DOI]

Proc. ACM Meas. Anal. Comput. Syst., 2020

The Gittins Policy is Nearly Optimal in the M/G/k under Extremely General Conditions.

[BibT_eX]

[DOI]

Proc. ACM Meas. Anal. Comput. Syst., 2020

Stability for Two-class Multiserver-job Systems.

[BibT_eX]

[DOI]

CoRR, 2020

Optimal Resource Allocation for Elastic and Inelastic Jobs.

[BibT_eX]

[DOI]

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

The CacheLib Caching Engine: Design and Experiences at Scale.

[BibT_eX]

[DOI]

Proceedings of the 14th USENIX Symposium on Operating Systems Design and Implementation, 2020

Borg: the next generation.

[BibT_eX]

[DOI]

Proceedings of the EuroSys '20: Fifteenth EuroSys Conference 2020, 2020

2019

heSRPT: Optimal Scheduling of Parallel Jobs with Known Sizes.

[BibT_eX]

[DOI]

Rein Vesilo

SIGMETRICS Perform. Evaluation Rev., 2019

Delay asymptotics and bounds for multitask parallel jobs.

[BibT_eX]

[DOI]

Queueing Syst. Theory Appl., 2019

Load Balancing Guardrails: Keeping Your Heavy Traffic on the Road to Low Response Times.

[BibT_eX]

[DOI]

Proc. ACM Meas. Anal. Comput. Syst., 2019

heSRPT: Optimal Parallel Scheduling of Jobs With Known Sizes.

[BibT_eX]

[DOI]

Rein Vesilo

CoRR, 2019

2018

Delay Asymptotics and Bounds for Multi-Task Parallel Jobs.

[BibT_eX]

[DOI]

SIGMETRICS Perform. Evaluation Rev., 2018

SRPT for Multiserver Systems.

[BibT_eX]

[DOI]

SIGMETRICS Perform. Evaluation Rev., 2018

SOAP: One Clean Analysis of All Age-Based Scheduling Policies.

[BibT_eX]

[DOI]

Proc. ACM Meas. Anal. Comput. Syst., 2018

Practical Bounds on Optimal Caching with Variable Object Sizes.

[BibT_eX]

[DOI]

Daniel S. Berger

Nathan Beckmann

Proc. ACM Meas. Anal. Comput. Syst., 2018

Optimal Scheduling and Exact Response Time Analysis for Multistage Jobs.

[BibT_eX]

[DOI]

CoRR, 2018

Towards Optimality in Parallel Job Scheduling.

[BibT_eX]

[DOI]

Jan-Pieter L. Dorsman

Proceedings of the Abstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer Systems, 2018

RobinHood: Tail Latency Aware Caching - Dynamic Reallocation from Cache-Rich to Cache-Poor.

[BibT_eX]

[DOI]

Proceedings of the 13th USENIX Symposium on Operating Systems Design and Implementation, 2018

SOAP Bubbles: Robust Scheduling Under Adversarial Noise.

[BibT_eX]

[DOI]

Proceedings of the 56th Annual Allerton Conference on Communication, 2018

2017

A Better Model for Job Redundancy: Decoupling Server Slowdown and Job Size.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2017

Optimally Scheduling Jobs with Multiple Tasks.

[BibT_eX]

[DOI]

SIGMETRICS Perform. Evaluation Rev., 2017

Towards Optimality in Parallel Scheduling.

[BibT_eX]

[DOI]

Jan-Pieter L. Dorsman

Proc. ACM Meas. Anal. Comput. Syst., 2017

Scheduling for efficiency and fairness in systems with redundancy.

[BibT_eX]

[DOI]

Perform. Evaluation, 2017

Redundancy-d: The Power of d Choices for Redundancy.

[BibT_eX]

[DOI]

Oper. Res., 2017

Asymptotic response time analysis for multi-task parallel jobs.

[BibT_eX]

[DOI]

CoRR, 2017

AdaptSize: Orchestrating the Hot Object Memory Cache in a Content Delivery Network.

[BibT_eX]

[DOI]

Daniel S. Berger

Ramesh K. Sitaraman

Proceedings of the 14th USENIX Symposium on Networked Systems Design and Implementation, 2017

WorkloadCompactor: reducing datacenter cost while providing tail latency SLO guarantees.

[BibT_eX]

[DOI]

Timothy Zhu

Michael A. Kozuch

Proceedings of the 2017 Symposium on Cloud Computing, SoCC 2017, Santa Clara, CA, USA, 2017

2016

Understanding Response Time in the Redundancy-d System.

[BibT_eX]

[DOI]

SIGMETRICS Perform. Evaluation Rev., 2016

Queueing with redundant requests: exact analysis.

[BibT_eX]

[DOI]

Queueing Syst. Theory Appl., 2016

A Better Model for Task Assignment in Server Farms: How Replication can Help.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science, 2016

The Power of d Choices for Redundancy.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science, 2016

A Better Model for Job Redundancy: Decoupling Server Slowdown and Job Size.

[BibT_eX]

[DOI]

Kristen Gardner

Proceedings of the 24th IEEE International Symposium on Modeling, 2016

TetriSched: global rescheduling with adaptive plan-ahead in dynamic heterogeneous clusters.

[BibT_eX]

[DOI]

Proceedings of the Eleventh European Conference on Computer Systems, 2016

SNC-Meister: Admitting More Tenants with Tail Latency SLOs.

[BibT_eX]

[DOI]

Timothy Zhu

Daniel S. Berger

Proceedings of the Seventh ACM Symposium on Cloud Computing, 2016

2015

Reducing Latency via Redundant Requests: Exact Analysis.

[BibT_eX]

[DOI]

Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2015

Optimal scheduling for jobs with progressive deadlines.

[BibT_eX]

[DOI]

Kristen Gardner

Sem C. Borst

Proceedings of the 2015 IEEE Conference on Computer Communications, 2015

2014

Exact analysis of the M/M/k/setup class of Markov chains via recursive renewal reward.

[BibT_eX]

[DOI]

Queueing Syst. Theory Appl., 2014

Value driven load balancing.

[BibT_eX]

[DOI]

Sherwin Doroudi

Esa Hyytiä

Perform. Evaluation, 2014

PriorityMeister: Tail Latency QoS for Shared Networked Storage.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Cloud Computing, 2014

2013

M/G/kM/G/k with staggered setup.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2013

2012

AutoScale: Dynamic, Robust Capacity Management for Multi-Tier Data Centers.

[BibT_eX]

[DOI]

ACM Trans. Comput. Syst., 2012

Many Flows Asymptotics for SMART Scheduling Policies.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 2012

Pricing and queueing.

[BibT_eX]

[DOI]

SIGMETRICS Perform. Evaluation Rev., 2012

SOFTScale: Stealing Opportunistically for Transient Scaling.

[BibT_eX]

[DOI]

Proceedings of the Middleware 2012, 2012

Saving Cash by Using Less Cache.

[BibT_eX]

[DOI]

Proceedings of the 4th USENIX Workshop on Hot Topics in Cloud Computing, 2012

Are sleep states effective in data centers?

[BibT_eX]

[DOI]

Michael A. Kozuch

Proceedings of the 2012 International Green Computing Conference, 2012

2011

Thread Cluster Memory Scheduling.

[BibT_eX]

[DOI]

IEEE Micro, 2011

The case for sleep states in servers.

[BibT_eX]

[DOI]

Michael A. Kozuch

Proceedings of the 4th Workshop on Power-Aware Computing and Systems, 2011

How data center size impacts the effectiveness of dynamic power management.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010

Decomposition results for an m/m/k with staggered setup.

[BibT_eX]

[DOI]

Ivo J. B. F. Adan

SIGMETRICS Perform. Evaluation Rev., 2010

On the inapproximability of M/G/K: why two moments of job size distribution are not enough.

[BibT_eX]

[DOI]

Queueing Syst. Theory Appl., 2010

Analysis of scheduling policies under correlated job sizes.

[BibT_eX]

[DOI]

Varun Gupta

Michelle Burroughs

Perform. Evaluation, 2010

Server farms with setup costs.

[BibT_eX]

[DOI]

Ivo J. B. F. Adan

Perform. Evaluation, 2010

Optimality analysis of energy-performance trade-off for server farm management.

[BibT_eX]

[DOI]

Perform. Evaluation, 2010

Thread Cluster Memory Scheduling: Exploiting Differences in Memory Access Behavior.

[BibT_eX]

[DOI]

Proceedings of the 43rd Annual IEEE/ACM International Symposium on Microarchitecture, 2010

ATLAS: A scalable and high-performance scheduling algorithm for multiple memory controllers.

[BibT_eX]

[DOI]

Proceedings of the 16th International Conference on High-Performance Computer Architecture (HPCA-16 2010), 2010

2009

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

[BibT_eX]

[DOI]

Andrew R. Young

Proceedings of the Eleventh International Joint Conference on Measurement and Modeling of Computer Systems, 2009

Self-adaptive admission control policies for resource-sharing systems.

[BibT_eX]

[DOI]

Varun Gupta

Proceedings of the Eleventh International Joint Conference on Measurement and Modeling of Computer Systems, 2009

Optimal power allocation in server farms.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Joint Conference on Measurement and Modeling of Computer Systems, 2009

Why segregating short jobs from long jobs under high variability is not always a win.

[BibT_eX]

[DOI]

Andrew R. Young

Proceedings of the 47th Annual Allerton Conference on Communication, 2009

2008

An Exact and Efficient Algorithm for the Constrained Dynamic Operator Staffing Problem for Call Centers.

[BibT_eX]

[DOI]

Atul Bhandari

Manag. Sci., 2008

Scheduling for Server Farms: Approaches and Open Problems.

[BibT_eX]

[DOI]

Proceedings of the Performance Evaluation: Metrics, 2008

2007

Foreword.

[BibT_eX]

[DOI]

SIGMETRICS Perform. Evaluation Rev., 2007

Insensitivity for PS server farms with JSQ routing.

[BibT_eX]

[DOI]

SIGMETRICS Perform. Evaluation Rev., 2007

The effect of higher moments of job size distribution on the performance of an M/G/s queueing system.

[BibT_eX]

[DOI]

SIGMETRICS Perform. Evaluation Rev., 2007

Analysis of join-the-shortest-queue routing for web server farms.

[BibT_eX]

[DOI]

Perform. Evaluation, 2007

2006

Web servers under overload: How scheduling can help.

[BibT_eX]

[DOI]

Bianca Schroeder

ACM Trans. Internet Techn., 2006

Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates.

[BibT_eX]

[DOI]

Robert C. Hampshire

William A. Massey

Queueing Syst. Theory Appl., 2006

How many servers are best in a dual-priority M/PH/k system?

[BibT_eX]

[DOI]

Perform. Evaluation, 2006

Closed form solutions for mapping general distributions to quasi-minimal PH distributions.

[BibT_eX]

[DOI]

Perform. Evaluation, 2006

Tail asymptotics for policies favoring short jobs in a many-flows regime.

[BibT_eX]

[DOI]

Proceedings of the Joint International Conference on Measurement and Modeling of Computer Systems, 2006

Fundamental characteristics of queues with fluctuating load.

[BibT_eX]

[DOI]

Proceedings of the Joint International Conference on Measurement and Modeling of Computer Systems, 2006

Open Versus Closed: A Cautionary Tale.

[BibT_eX]

[DOI]

Bianca Schroeder

Proceedings of the 3rd Symposium on Networked Systems Design and Implementation (NSDI 2006), 2006

How to Determine a Good Multi-Programming Level for External Scheduling.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Conference on Data Engineering, 2006

Achieving Class-Based QoS for Transactional Workloads.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Conference on Data Engineering, 2006

2005

Robustness of threshold policies in beneficiary-donor model.

[BibT_eX]

[DOI]

SIGMETRICS Perform. Evaluation Rev., 2005

Multi-Server Queueing Systems with Multiple Priority Classes.

[BibT_eX]

[DOI]

Queueing Syst. Theory Appl., 2005

Analysis of cycle stealing with switching times and thresholds.

[BibT_eX]

[DOI]

Perform. Evaluation, 2005

Nearly insensitive bounds on SMART scheduling.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Measurements and Modeling of Computer Systems, 2005

Classifying scheduling policies with respect to higher moments of conditional response time.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Measurements and Modeling of Computer Systems, 2005

Improving Preemptive Prioritization via Statistical Characterization of OLTP Locking.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Data Engineering, 2005

2004

Formalizing SMART scheduling.

[BibT_eX]

[DOI]

SIGMETRICS Perform. Evaluation Rev., 2004

A recursive analysis technique for multi-dimensionally infinite Markov chains.

[BibT_eX]

[DOI]

SIGMETRICS Perform. Evaluation Rev., 2004

A note on comparing response times in the M/GI/1/FB and M/GI/1/PS queues.

[BibT_eX]

[DOI]

Nikhil Bansal

Oper. Res. Lett., 2004

Evaluation of Task Assignment Policies for Supercomputing Servers: The Case for Load Unbalancing and Fairness.

[BibT_eX]

[DOI]

Bianca Schroeder

Clust. Comput., 2004

Priority Mechanisms for OLTP and Transactional Web Applications.

[BibT_eX]

[DOI]

Proceedings of the 20th International Conference on Data Engineering, 2004

2003

Size-based scheduling to improve web performance.

[BibT_eX]

[DOI]

ACM Trans. Comput. Syst., 2003

Cycle stealing under immediate dispatch task assignment.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

Classifying scheduling policies with respect to unfairness in an M/GI/1.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Measurements and Modeling of Computer Systems, 2003

Analysis of cycle stealing with switching cost.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Measurements and Modeling of Computer Systems, 2003

Analysis of Task Assignment with Cycle Stealing under Central Queue.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS 2003), 2003

A Closed-Form Solution for Mapping General Distributions to Minimal PH Distributions.

[BibT_eX]

[DOI]

Proceedings of the Computer Performance Evaluations, 2003

Necessary and Sufficient Conditions for Representing General Distributions by Coxians.

[BibT_eX]

[DOI]

Proceedings of the Computer Performance Evaluations, 2003

2002

Understanding the slowdown of large jobs in an M/GI/1 system.

[BibT_eX]

[DOI]

Karl Sigman

SIGMETRICS Perform. Evaluation Rev., 2002

Asymptotic convergence of scheduling policies with respect to slowdown.

[BibT_eX]

Karl Sigman

Perform. Evaluation, 2002

Task assignment with unknown duration.

[BibT_eX]

[DOI]

J. ACM, 2002

2001

Job placement with unknown duration and no preemption.

[BibT_eX]

[DOI]

SIGMETRICS Perform. Evaluation Rev., 2001

Analysis of M/G/1/SRPT under transient overload.

[BibT_eX]

[DOI]

Nikhil Bansal

SIGMETRICS Perform. Evaluation Rev., 2001

Analysis of SRPT scheduling: investigating unfairness.

[BibT_eX]

[DOI]

Nikhil Bansal

Proceedings of the Joint International Conference on Measurements and Modeling of Computer Systems, 2001

SRPT Scheduling for Web Servers.

[BibT_eX]

[DOI]

Proceedings of the Job Scheduling Strategies for Parallel Processing, 2001

2000

General Dynamic Routing with Per-Packet Delay Guarantees of O(Distance + 1/Session Rate).

[BibT_eX]

[DOI]

Matthew Andrews

Antonio Fernández

Frank Thomson Leighton

Lisa Zhang

SIAM J. Comput., 2000

1999

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

[BibT_eX]

[DOI]

Mark Crovella

Cristina D. Murta

J. Parallel Distributed Comput., 1999

Connection Scheduling in Web Servers.

[BibT_eX]

[DOI]

Mark Crovella

Robert Frangioso

Proceedings of the 2nd USENIX Symposium on Internet Technologies and Systems, 1999

Resource Discovery in Distributed Networks.

[BibT_eX]

[DOI]

Frank Thomson Leighton

Daniel Lewin

Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999

1998

Task Assignment in a Distributed System: Improving Performance by Unbalancing Load (Extended Abstract).

[BibT_eX]

[DOI]

Mark Crovella

Cristina D. Murta

Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems, 1998

1997

Exploiting Process Lifetime Distributions for Dynamic Load Balancing.

[BibT_eX]

[DOI]

Allen B. Downey

ACM Trans. Comput. Syst., 1997

General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate).

[BibT_eX]

[DOI]

Matthew Andrews

Antonio Fernández

Frank Thomson Leighton

Lisa Zhang

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

1995

Bounding delays in packet-routing networks.

[BibT_eX]

[DOI]

David Wolfe

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

1994

Tight Bounds on Expected Time to Add Correctly and Add Mostly Correctly.

[BibT_eX]

[DOI]

Peter Gemmell

Inf. Process. Lett., 1994

Queueing Analysis of Oblivious Packet-Routing Networks.

[BibT_eX]

[DOI]