


default search action
Mor Harchol-Balter
Person information
- affiliation: Carnegie Mellon University, Pittsburgh, USA
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j77]Isaac Grosof, Yige Hong, Mor Harchol-Balter, Alan Scheller-Wolf:
The RESET and MARC Techniques, with Application to Multiserver-Job Analysis. SIGMETRICS Perform. Evaluation Rev. 51(4): 6-7 (2024) - [i25]Benjamin Berg, Benjamin Moseley, Weina Wang, Mor Harchol-Balter:
Asymptotically Optimal Scheduling of Multiple Parallelizable Job Classes. CoRR abs/2404.00346 (2024) - [i24]Ziyue Qiu, Juncheng Yang, Mor Harchol-Balter:
Can Increasing the Hit Ratio Hurt Cache Throughput? CoRR abs/2404.16219 (2024) - [i23]Isaac Grosof, Yige Hong, Mor Harchol-Balter:
Analysis of Markovian Arrivals and Service with Applications to Intermittent Overload. CoRR abs/2405.04102 (2024) - [i22]Zhouzi Li, Benjamin Berg, Arpan Mukhopadhyay, Mor Harchol-Balter:
How to Rent GPUs on a Budget. CoRR abs/2406.15560 (2024) - 2023
- [j76]Isaac Grosof, Yige Hong, Mor Harchol-Balter, Alan Scheller-Wolf:
The RESET and MARC techniques, with application to multiserver-job analysis. Perform. Evaluation 162: 102378 (2023) - [j75]Isaac Grosof, Mor Harchol-Balter, Alan Scheller-Wolf:
New Stability Results for Multiserver-job Models via Product-form Saturated Systems. SIGMETRICS Perform. Evaluation Rev. 51(2): 6-8 (2023) - [c71]Isaac Grosof
, Mor Harchol-Balter
:
Invited Paper: ServerFilling: A better approach to packing multiserver jobs. ApPLIED@PODC 2023: 7:1-7:5 - [c70]Jalani K. Williams
, Mor Harchol-Balter
, Weina Wang
:
The M/M/k with Deterministic Setup Times. SIGMETRICS (Abstracts) 2023: 75-76 - [c69]Isaac Grosof
, Ziv Scully
, Mor Harchol-Balter
, Alan Scheller-Wolf
:
Optimal Scheduling in the Multiserver-job Model under Heavy Traffic. SIGMETRICS (Abstracts) 2023: 99-100 - [i21]Isaac Grosof, Yige Hong, Mor Harchol-Balter, Alan Scheller-Wolf:
The RESET and MARC Techniques, with Application to Multiserver-Job Analysis. CoRR abs/2310.01621 (2023) - 2022
- [j74]Benjamin Berg, Justin Whitehouse, Benjamin Moseley
, Weina Wang, Mor Harchol-Balter
:
The case for phase-aware scheduling of parallelizable jobs. Perform. Evaluation 153: 102246 (2022) - [j73]Mor Harchol-Balter
:
The multiserver job queueing model. Queueing Syst. Theory Appl. 100(3-4): 201-203 (2022) - [j72]Isaac Grosof
, Mor Harchol-Balter
, Alan Scheller-Wolf:
WCFS: a new framework for analyzing multiserver systems. Queueing Syst. Theory Appl. 102(1-2): 143-174 (2022) - [j71]Benjamin Berg, Justin Whitehouse, Benjamin Moseley, Weina Wang, Mor Harchol-Balter
:
The Case for Phase-Aware Scheduling of Parallelizable Jobs. SIGMETRICS Perform. Evaluation Rev. 49(3): 65-66 (2022) - [j70]Mor Harchol-Balter
, Ziv Scully:
The most common queueing theory questions asked by computer systems practitioners. SIGMETRICS Perform. Evaluation Rev. 49(4): 3-7 (2022) - [i20]Isaac Grosof, Ziv Scully, Mor Harchol-Balter
, Alan Scheller-Wolf:
Optimal Scheduling in the Multiserver-job Model under Heavy Traffic. CoRR abs/2211.02762 (2022) - 2021
- [j69]Sherwin Doroudi, Thanassis Avgerinos, Mor Harchol-Balter
:
To clean or not to clean: Malware removal strategies for servers under load. Eur. J. Oper. Res. 292(2): 596-609 (2021) - [j68]Ziv Scully
, Isaac Grosof
, Mor Harchol-Balter
:
Optimal multiserver scheduling with unknown job sizes in heavy traffic. Perform. Evaluation 145: 102150 (2021) - [j67]Weina Wang, Qiaomin Xie, Mor Harchol-Balter:
Zero Queueing for Multi-Server Jobs. Proc. ACM Meas. Anal. Comput. Syst. 5(1): 07:1-07:25 (2021) - [j66]Isaac Grosof
, Kunhe Yang, Ziv Scully
, Mor Harchol-Balter
:
Nudge: Stochastically Improving upon FCFS. Proc. ACM Meas. Anal. Comput. Syst. 5(2): 21:1-21:29 (2021) - [j65]Isaac Grosof
, Ziv Scully
, Mor Harchol-Balter
, Alan Scheller-Wolf
:
Optimal Scheduling in the Multiserver-job Model under Heavy Traffic. Proc. ACM Meas. Anal. Comput. Syst. 6(3): 51:1-51:32 (2021) - [j64]Jalani Williams
, Mor Harchol-Balter
, Weina Wang
:
The M/M/k with Deterministic Setup Times. Proc. ACM Meas. Anal. Comput. Syst. 6(3): 56:1-56:45 (2021) - [j63]Mor Harchol-Balter
:
Open problems in queueing theory inspired by datacenter computing. Queueing Syst. Theory Appl. 97(1-2): 3-37 (2021) - [j62]Mor Harchol-Balter
, Takayuki Osogami
, Alan Scheller-Wolf, Adam Wierman:
Correction to: Multi-server queueing systems with multiple priority classes. Queueing Syst. Theory Appl. 99(3-4): 397-398 (2021) - [c68]Naveen Pai
, Sean Zhang
, Mor Harchol-Balter
:
Computing the Death Rate of COVID-19. ANTICOVID 2021: 77-94 - [c67]Isaac Grosof, Kunhe Yang, Ziv Scully, Mor Harchol-Balter
:
Nudge: Stochastically Improving upon FCFS. SIGMETRICS (Abstracts) 2021: 11-12 - [c66]Weina Wang, Qiaomin Xie, Mor Harchol-Balter
:
Zero Queueing for Multi-Server Jobs. SIGMETRICS (Abstracts) 2021: 13-14 - [c65]Ziv Scully, Isaac Grosof, Mor Harchol-Balter
:
The Gittins Policy is Nearly Optimal in the M/G/k under Extremely General Conditions. SIGMETRICS (Abstracts) 2021: 15-16 - [c64]Isaac Grosof, Ziv Scully, Mor Harchol-Balter:
Load balancing guardrails: keeping your heavy traffic on the road to low response times (invited paper). STOC 2021: 10 - [c63]Ziv Scully
, Mor Harchol-Balter
:
The Gittins Policy in the M/G/1 Queue. WiOpt 2021: 248-255 - [i19]Isaac Grosof, Kunhe Yang, Ziv Scully, Mor Harchol-Balter:
Nudge: Stochastically Improving upon FCFS. CoRR abs/2106.01492 (2021) - [i18]Isaac Grosof, Mor Harchol-Balter, Alan Scheller-Wolf:
The Finite-Skip Method for Multiserver Analysis. CoRR abs/2109.12663 (2021) - [i17]Naveen Pai, Sean Zhang, Mor Harchol-Balter:
Computing the Death Rate of COVID-19. CoRR abs/2109.13733 (2021) - [i16]Ziv Scully, Mor Harchol-Balter:
How to Schedule Near-Optimally under Real-World Constraints. CoRR abs/2110.11579 (2021) - [i15]Ziv Scully, Mor Harchol-Balter:
The Gittins Policy in the M/G/1 Queue. CoRR abs/2111.10703 (2021) - 2020
- [j61]Benjamin Berg, Rein Vesilo, Mor Harchol-Balter
:
heSRPT: Parallel scheduling to minimize mean slowdown. Perform. Evaluation 144: 102147 (2020) - [j60]Ziv Scully
, Mor Harchol-Balter, Alan Scheller-Wolf:
Simple Near-Optimal Scheduling for the M/G/1. Proc. ACM Meas. Anal. Comput. Syst. 4(1): 11:1-11:29 (2020) - [j59]Ziv Scully
, Isaac Grosof
, Mor Harchol-Balter:
The Gittins Policy is Nearly Optimal in the M/G/k under Extremely General Conditions. Proc. ACM Meas. Anal. Comput. Syst. 4(3): 43:1-43:29 (2020) - [j58]Ziv Scully, Isaac Grosof, Mor Harchol-Balter
:
Optimal Multiserver Scheduling with Unknown Job Sizes in Heavy Traffic. SIGMETRICS Perform. Evaluation Rev. 48(2): 33-35 (2020) - [j57]Benjamin Berg, Rein Vesilo, Mor Harchol-Balter
:
heSRPT: Parallel Scheduling to Minimize Mean Slowdown. SIGMETRICS Perform. Evaluation Rev. 48(3): 35-36 (2020) - [j56]Ziv Scully, Isaac Grosof, Mor Harchol-Balter
:
Optimal Multiserver Scheduling with Unknown Job Sizes in Heavy Traffic. SIGMETRICS Perform. Evaluation Rev. 48(3): 136-137 (2020) - [c62]Muhammad Tirmazi, Adam Barker, Nan Deng, Md E. Haque, Zhijing Gene Qin, Steven Hand, Mor Harchol-Balter
, John Wilkes:
Borg: the next generation. EuroSys 2020: 30:1-30:14 - [c61]Benjamin Berg, Daniel S. Berger, Sara McAllister, Isaac Grosof, Sathya Gunasekar, Jimmy Lu, Michael Uhlar, Jim Carrig, Nathan Beckmann, Mor Harchol-Balter, Gregory R. Ganger:
The CacheLib Caching Engine: Design and Experiences at Scale. OSDI 2020: 753-768 - [c60]Ziv Scully, Mor Harchol-Balter
, Alan Scheller-Wolf:
Simple Near-Optimal Scheduling for the M/G/1. SIGMETRICS (Abstracts) 2020: 37-38 - [c59]Benjamin Berg, Mor Harchol-Balter
, Benjamin Moseley, Weina Wang, Justin Whitehouse:
Optimal Resource Allocation for Elastic and Inelastic Jobs. SPAA 2020: 75-87 - [i14]Ziv Scully, Isaac Grosof, Mor Harchol-Balter:
Optimal Multiserver Scheduling with Unknown Job Sizes in Heavy Traffic. CoRR abs/2003.13232 (2020) - [i13]Benjamin Berg, Mor Harchol-Balter, Benjamin Moseley, Weina Wang, Justin Whitehouse:
Optimal Resource Allocation for Elastic and Inelastic Jobs. CoRR abs/2005.09745 (2020) - [i12]Isaac Grosof, Mor Harchol-Balter, Alan Scheller-Wolf:
Stability for Two-class Multiserver-job Systems. CoRR abs/2010.00631 (2020) - [i11]Benjamin Berg, Rein Vesilo, Mor Harchol-Balter:
heSRPT: Parallel Scheduling to Minimize Mean Slowdown. CoRR abs/2011.09676 (2020) - [i10]Weina Wang, Qiaomin Xie, Mor Harchol-Balter:
Zero Queueing for Multi-Server Jobs. CoRR abs/2011.10521 (2020)
2010 – 2019
- 2019
- [j55]Isaac Grosof, Ziv Scully
, Mor Harchol-Balter:
Load Balancing Guardrails: Keeping Your Heavy Traffic on the Road to Low Response Times. Proc. ACM Meas. Anal. Comput. Syst. 3(2): 42:1-42:31 (2019) - [j54]Weina Wang, Mor Harchol-Balter
, Haotian Jiang, Alan Scheller-Wolf, R. Srikant:
Delay asymptotics and bounds for multitask parallel jobs. Queueing Syst. Theory Appl. 91(3-4): 207-239 (2019) - [j53]Benjamin Berg, Rein Vesilo, Mor Harchol-Balter
:
heSRPT: Optimal Scheduling of Parallel Jobs with Known Sizes. SIGMETRICS Perform. Evaluation Rev. 47(2): 18-20 (2019) - [j52]Ziv Scully, Mor Harchol-Balter
, Alan Scheller-Wolf:
Simple Near-Optimal Scheduling for the M/G/1. SIGMETRICS Perform. Evaluation Rev. 47(2): 24-26 (2019) - [c58]Isaac Grosof
, Ziv Scully, Mor Harchol-Balter
:
Load Balancing Guardrails: Keeping Your Heavy Traffic on the Road to Low Response Times. SIGMETRICS (Abstracts) 2019: 9-10 - [i9]Benjamin Berg, Rein Vesilo, Mor Harchol-Balter:
heSRPT: Optimal Parallel Scheduling of Jobs With Known Sizes. CoRR abs/1903.09346 (2019) - [i8]Isaac Grosof, Ziv Scully, Mor Harchol-Balter:
Load Balancing Guardrails: Keeping Your Heavy Traffic on the Road to Low Response Times. CoRR abs/1905.03439 (2019) - [i7]Ziv Scully, Mor Harchol-Balter, Alan Scheller-Wolf:
Simple Near-Optimal Scheduling for the M/G/1. CoRR abs/1907.10792 (2019) - 2018
- [j51]Isaac Grosof
, Ziv Scully
, Mor Harchol-Balter
:
SRPT for multiserver systems. Perform. Evaluation 127-128: 154-175 (2018) - [j50]Ziv Scully
, Mor Harchol-Balter, Alan Scheller-Wolf:
SOAP: One Clean Analysis of All Age-Based Scheduling Policies. Proc. ACM Meas. Anal. Comput. Syst. 2(1): 16:1-16:30 (2018) - [j49]Daniel S. Berger, Nathan Beckmann, Mor Harchol-Balter:
Practical Bounds on Optimal Caching with Variable Object Sizes. Proc. ACM Meas. Anal. Comput. Syst. 2(2): 32:1-32:38 (2018) - [j48]Isaac Grosof
, Ziv Scully, Mor Harchol-Balter
:
SRPT for Multiserver Systems. SIGMETRICS Perform. Evaluation Rev. 46(2): 9-11 (2018) - [j47]Weina Wang, Mor Harchol-Balter
, Haotian Jiang, Alan Scheller-Wolf, R. Srikant:
Delay Asymptotics and Bounds for Multi-Task Parallel Jobs. SIGMETRICS Perform. Evaluation Rev. 46(3): 2-7 (2018) - [j46]Isaac Grosof
, Ziv Scully, Mor Harchol-Balter
:
SRPT for Multiserver Systems. SIGMETRICS Perform. Evaluation Rev. 46(3): 8-9 (2018) - [c57]Ziv Scully
, Mor Harchol-Balter
:
SOAP Bubbles: Robust Scheduling Under Adversarial Noise. Allerton 2018: 144-154 - [c56]Daniel S. Berger, Benjamin Berg, Timothy Zhu, Siddhartha Sen, Mor Harchol-Balter:
RobinHood: Tail Latency Aware Caching - Dynamic Reallocation from Cache-Rich to Cache-Poor. OSDI 2018: 195-212 - [c55]Daniel S. Berger, Nathan Beckmann, Mor Harchol-Balter
:
Practical Bounds on Optimal Caching with Variable Object Sizes. SIGMETRICS (Abstracts) 2018: 24-26 - [c54]Ziv Scully
, Mor Harchol-Balter
, Alan Scheller-Wolf:
SOAP: One Clean Analysis of All Age-Based Scheduling Policies. SIGMETRICS (Abstracts) 2018: 36-38 - [c53]Benjamin Berg, Jan-Pieter L. Dorsman, Mor Harchol-Balter
:
Towards Optimality in Parallel Job Scheduling. SIGMETRICS (Abstracts) 2018: 116-118 - [i6]Ziv Scully, Mor Harchol-Balter, Alan Scheller-Wolf:
Optimal Scheduling and Exact Response Time Analysis for Multistage Jobs. CoRR abs/1805.06865 (2018) - [i5]Isaac Grosof, Ziv Scully, Mor Harchol-Balter:
SRPT for Multiserver Systems. CoRR abs/1805.07686 (2018) - 2017
- [j45]Kristen Gardner, Mor Harchol-Balter
, Alan Scheller-Wolf, Mark Velednitsky
, Samuel Zbarsky:
Redundancy-d: The Power of d Choices for Redundancy. Oper. Res. 65(4): 1078-1094 (2017) - [j44]Kristen Gardner, Mor Harchol-Balter
, Esa Hyytiä
, Rhonda Righter:
Scheduling for efficiency and fairness in systems with redundancy. Perform. Evaluation 116: 1-25 (2017) - [j43]Benjamin Berg, Jan-Pieter L. Dorsman, Mor Harchol-Balter:
Towards Optimality in Parallel Scheduling. Proc. ACM Meas. Anal. Comput. Syst. 1(2): 40:1-40:30 (2017) - [j42]Ziv Scully
, Guy E. Blelloch, Mor Harchol-Balter
, Alan Scheller-Wolf:
Optimally Scheduling Jobs with Multiple Tasks. SIGMETRICS Perform. Evaluation Rev. 45(2): 36-38 (2017) - [j41]Kristen Gardner
, Mor Harchol-Balter
, Alan Scheller-Wolf, Benny Van Houdt
:
A Better Model for Job Redundancy: Decoupling Server Slowdown and Job Size. IEEE/ACM Trans. Netw. 25(6): 3353-3367 (2017) - [c52]Timothy Zhu
, Michael A. Kozuch, Mor Harchol-Balter
:
WorkloadCompactor: reducing datacenter cost while providing tail latency SLO guarantees. SoCC 2017: 598-610 - [c51]Daniel S. Berger, Ramesh K. Sitaraman
, Mor Harchol-Balter:
AdaptSize: Orchestrating the Hot Object Memory Cache in a Content Delivery Network. NSDI 2017: 483-498 - [i4]Benjamin Berg, Jan-Pieter L. Dorsman, Mor Harchol-Balter:
Towards Optimality in Parallel Scheduling. CoRR abs/1707.07097 (2017) - [i3]Weina Wang, Mor Harchol-Balter, Haotian Jiang, Alan Scheller-Wolf, R. Srikant:
Asymptotic response time analysis for multi-task parallel jobs. CoRR abs/1710.00296 (2017) - [i2]Daniel S. Berger, Nathan Beckmann, Mor Harchol-Balter:
Practical Bounds on Optimal Caching with Variable Object Sizes. CoRR abs/1711.03709 (2017) - [i1]Ziv Scully, Mor Harchol-Balter, Alan Scheller-Wolf:
SOAP: One Clean Analysis of All Age-Based Scheduling Policies. CoRR abs/1712.00790 (2017) - 2016
- [j40]Kristen Gardner, Samuel Zbarsky, Sherwin Doroudi
, Mor Harchol-Balter
, Esa Hyytiä
, Alan Scheller-Wolf:
Queueing with redundant requests: exact analysis. Queueing Syst. Theory Appl. 83(3-4): 227-259 (2016) - [j39]Kristen Gardner, Samuel Zbarsky, Mark Velednitsky
, Mor Harchol-Balter
, Alan Scheller-Wolf:
Understanding Response Time in the Redundancy-d System. SIGMETRICS Perform. Evaluation Rev. 44(2): 33-35 (2016) - [c50]Timothy Zhu
, Daniel S. Berger, Mor Harchol-Balter
:
SNC-Meister: Admitting More Tenants with Tail Latency SLOs. SoCC 2016: 374-387 - [c49]Alexey Tumanov, Timothy Zhu
, Jun Woo Park
, Michael A. Kozuch, Mor Harchol-Balter
, Gregory R. Ganger:
TetriSched: global rescheduling with adaptive plan-ahead in dynamic heterogeneous clusters. EuroSys 2016: 35:1-35:16 - [c48]Kristen Gardner, Mor Harchol-Balter
, Alan Scheller-Wolf:
A Better Model for Job Redundancy: Decoupling Server Slowdown and Job Size. MASCOTS 2016: 1-10 - [c47]Mor Harchol-Balter:
A Better Model for Task Assignment in Server Farms: How Replication can Help. SIGMETRICS 2016: 73 - [c46]Kristen Gardner, Samuel Zbarsky, Mor Harchol-Balter
, Alan Scheller-Wolf:
The Power of d Choices for Redundancy. SIGMETRICS 2016: 409-410 - 2015
- [c45]Kristen Gardner, Sem C. Borst, Mor Harchol-Balter
:
Optimal scheduling for jobs with progressive deadlines. INFOCOM 2015: 1113-1121 - [c44]Kristen Gardner, Samuel Zbarsky, Sherwin Doroudi
, Mor Harchol-Balter
, Esa Hyytiä
:
Reducing Latency via Redundant Requests: Exact Analysis. SIGMETRICS 2015: 347-360 - 2014
- [j38]Sherwin Doroudi
, Esa Hyytiä
, Mor Harchol-Balter
:
Value driven load balancing. Perform. Evaluation 79: 306-327 (2014) - [j37]Anshul Gandhi, Sherwin Doroudi
, Mor Harchol-Balter
, Alan Scheller-Wolf:
Exact analysis of the M/M/k/setup class of Markov chains via recursive renewal reward. Queueing Syst. Theory Appl. 77(2): 177-209 (2014) - [c43]Timothy Zhu
, Alexey Tumanov, Michael A. Kozuch, Mor Harchol-Balter
, Gregory R. Ganger:
PriorityMeister: Tail Latency QoS for Shared Networked Storage. SoCC 2014: 29:1-29:14 - 2013
- [j36]Anshul Gandhi, Mor Harchol-Balter
:
M/G/kM/G/k with staggered setup. Oper. Res. Lett. 41(4): 317-320 (2013) - [c42]Anshul Gandhi, Sherwin Doroudi
, Mor Harchol-Balter
, Alan Scheller-Wolf:
Exact analysis of the M/M/k/setup class of Markov chains via recursive renewal reward. SIGMETRICS 2013: 153-166 - [e2]Mor Harchol-Balter, John R. Douceur, Jun Xu:
ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS '13, Pittsburgh, PA, USA, June 17-21, 2013. ACM 2013, ISBN 978-1-4503-1900-3 [contents] - 2012
- [j35]Christian Borgs
, Jennifer T. Chayes
, Sherwin Doroudi
, Mor Harchol-Balter
, Kuang Xu:
Pricing and queueing. SIGMETRICS Perform. Evaluation Rev. 40(3): 71-73 (2012) - [j34]Chang-Woo Yang, Adam Wierman, Sanjay Shakkottai, Mor Harchol-Balter
:
Many Flows Asymptotics for SMART Scheduling Policies. IEEE Trans. Autom. Control. 57(2): 376-391 (2012) - [j33]Anshul Gandhi, Mor Harchol-Balter
, Ram Raghunathan, Michael A. Kozuch:
AutoScale: Dynamic, Robust Capacity Management for Multi-Tier Data Centers. ACM Trans. Comput. Syst. 30(4): 14:1-14:26 (2012) - [c41]Anshul Gandhi, Mor Harchol-Balter
, Michael A. Kozuch:
Are sleep states effective in data centers? IGCC 2012: 1-10 - [c40]Timothy Zhu, Anshul Gandhi, Mor Harchol-Balter, Michael A. Kozuch:
Saving Cash by Using Less Cache. HotCloud 2012 - [c39]Anshul Gandhi, Timothy Zhu, Mor Harchol-Balter
, Michael A. Kozuch:
SOFTScale: Stealing Opportunistically for Transient Scaling. Middleware 2012: 142-163 - 2011
- [j32]Yoongu Kim, Michael Papamichael, Onur Mutlu, Mor Harchol-Balter
:
Thread Cluster Memory Scheduling. IEEE Micro 31(1): 78-89 (2011) - [c38]Anshul Gandhi, Mor Harchol-Balter
:
How data center size impacts the effectiveness of dynamic power management. Allerton 2011: 1164-1169 - [c37]Anshul Gandhi, Mor Harchol-Balter
, Michael A. Kozuch:
The case for sleep states in servers. HotPower@SOSP 2011: 2:1-2:5 - 2010
- [j31]Varun Gupta, Michelle Burroughs, Mor Harchol-Balter
:
Analysis of scheduling policies under correlated job sizes. Perform. Evaluation 67(11): 996-1013 (2010) - [j30]Anshul Gandhi, Mor Harchol-Balter
, Ivo J. B. F. Adan:
Server farms with setup costs. Perform. Evaluation 67(11): 1123-1138 (2010) - [j29]Anshul Gandhi, Varun Gupta, Mor Harchol-Balter
, Michael A. Kozuch:
Optimality analysis of energy-performance trade-off for server farm management. Perform. Evaluation 67(11): 1155-1171 (2010) - [j28]Varun Gupta, Mor Harchol-Balter
, Jim G. Dai
, Bert Zwart:
On the inapproximability of M/G/K: why two moments of job size distribution are not enough. Queueing Syst. Theory Appl. 64(1): 5-48 (2010) - [j27]Anshul Gandhi, Mor Harchol-Balter, Ivo J. B. F. Adan:
Decomposition results for an m/m/k with staggered setup. SIGMETRICS Perform. Evaluation Rev. 38(2): 48-50 (2010) - [c36]Yoongu Kim, Dongsu Han, Onur Mutlu, Mor Harchol-Balter:
ATLAS: A scalable and high-performance scheduling algorithm for multiple memory controllers. HPCA 2010: 1-12 - [c35]Yoongu Kim, Michael Papamichael, Onur Mutlu, Mor Harchol-Balter
:
Thread Cluster Memory Scheduling: Exploiting Differences in Memory Access Behavior. MICRO 2010: 65-76
2000 – 2009
- 2009
- [c34]Mor Harchol-Balter
, Alan Scheller-Wolf, Andrew R. Young:
Why segregating short jobs from long jobs under high variability is not always a win. Allerton 2009: 121-127 - [c33]Anshul Gandhi, Mor Harchol-Balter
, Rajarshi Das, Charles Lefurgy:
Optimal power allocation in server farms. SIGMETRICS/Performance 2009: 157-168 - [c32]Mor Harchol-Balter
, Alan Scheller-Wolf, Andrew R. Young:
Surprising results on task assignment in server farms with high-variability workloads. SIGMETRICS/Performance 2009: 287-298 - [c31]Varun Gupta, Mor Harchol-Balter
:
Self-adaptive admission control policies for resource-sharing systems. SIGMETRICS/Performance 2009: 311-322 - 2008
- [j26]Atul Bhandari, Alan Scheller-Wolf, Mor Harchol-Balter
:
An Exact and Efficient Algorithm for the Constrained Dynamic Operator Staffing Problem for Call Centers. Manag. Sci. 54(2): 339-353 (2008) - [c30]Mor Harchol-Balter
:
Scheduling for Server Farms: Approaches and Open Problems. SIPEW 2008: 1-3 - 2007
- [j25]Varun Gupta, Mor Harchol-Balter
, Karl Sigman, Ward Whitt:
Analysis of join-the-shortest-queue routing for web server farms. Perform. Evaluation 64(9-12): 1062-1081 (2007) - [j24]Mor Harchol-Balter:
Foreword. SIGMETRICS Perform. Evaluation Rev. 34(4): 2-3 (2007) - [j23]Varun Gupta, Jim G. Dai, Mor Harchol-Balter, Bert Zwart:
The effect of higher moments of job size distribution on the performance of an M/G/s queueing system. SIGMETRICS Perform. Evaluation Rev. 35(2): 12-14 (2007) - [j22]Varun Gupta, Karl Sigman, Mor Harchol-Balter, Ward Whitt:
Insensitivity for PS server farms with JSQ routing. SIGMETRICS Perform. Evaluation Rev. 35(2): 24-26 (2007) - [e1]Leana Golubchik, Mostafa H. Ammar, Mor Harchol-Balter:
Proceedings of the 2007 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS 2007, San Diego, California, USA, June 12-16, 2007. ACM 2007, ISBN 978-1-59593-639-4 [contents] - 2006
- [j21]Takayuki Osogami, Mor Harchol-Balter
:
Closed form solutions for mapping general distributions to quasi-minimal PH distributions. Perform. Evaluation 63(6): 524-552 (2006) - [j20]Adam Wierman, Takayuki Osogami, Mor Harchol-Balter
, Alan Scheller-Wolf:
How many servers are best in a dual-priority M/PH/k system? Perform. Evaluation 63(12): 1253-1272 (2006) - [j19]Robert C. Hampshire, Mor Harchol-Balter
, William A. Massey:
Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates. Queueing Syst. Theory Appl. 53(1-2): 19-30 (2006) - [j18]Bianca Schroeder, Mor Harchol-Balter
:
Web servers under overload: How scheduling can help. ACM Trans. Internet Techn. 6(1): 20-52 (2006) - [c29]Bianca Schroeder, Mor Harchol-Balter
, Arun Iyengar, Erich M. Nahum, Adam Wierman:
How to Determine a Good Multi-Programming Level for External Scheduling. ICDE 2006: 60 - [c28]Bianca Schroeder, Mor Harchol-Balter
, Arun Iyengar, Erich M. Nahum:
Achieving Class-Based QoS for Transactional Workloads. ICDE 2006: 153 - [c27]Bianca Schroeder, Adam Wierman, Mor Harchol-Balter:
Open Versus Closed: A Cautionary Tale. NSDI 2006 - [c26]Chang-Woo Yang, Adam Wierman, Sanjay Shakkottai, Mor Harchol-Balter
:
Tail asymptotics for policies favoring short jobs in a many-flows regime. SIGMETRICS/Performance 2006: 97-108 - [c25]Varun Gupta, Mor Harchol-Balter
, Alan Scheller-Wolf, Uri Yechiali:
Fundamental characteristics of queues with fluctuating load. SIGMETRICS/Performance 2006: 203-215 - 2005
- [j17]Takayuki Osogami, Mor Harchol-Balter
, Alan Scheller-Wolf:
Analysis of cycle stealing with switching times and thresholds. Perform. Evaluation 61(4): 347-369 (2005) - [j16]Mor Harchol-Balter
, Takayuki Osogami, Alan Scheller-Wolf, Adam Wierman:
Multi-Server Queueing Systems with Multiple Priority Classes. Queueing Syst. Theory Appl. 51(3-4): 331-360 (2005) - [j15]Mor Harchol-Balter
, Takayuki Osogami, Alan Scheller-Wolf:
Robustness of threshold policies in beneficiary-donor model. SIGMETRICS Perform. Evaluation Rev. 33(2): 36-38 (2005) - [c24]David T. McWherter, Bianca Schroeder, Anastassia Ailamaki, Mor Harchol-Balter
:
Improving Preemptive Prioritization via Statistical Characterization of OLTP Locking. ICDE 2005: 446-457 - [c23]Adam Wierman, Mor Harchol-Balter
, Takayuki Osogami:
Nearly insensitive bounds on SMART scheduling. SIGMETRICS 2005: 205-216 - [c22]Adam Wierman, Mor Harchol-Balter
:
Classifying scheduling policies with respect to higher moments of conditional response time. SIGMETRICS 2005: 229-240 - 2004
- [j14]Bianca Schroeder, Mor Harchol-Balter:
Evaluation of Task Assignment Policies for Supercomputing Servers: The Case for Load Unbalancing and Fairness. Clust. Comput. 7(2): 151-161 (2004) - [j13]Adam Wierman, Nikhil Bansal, Mor Harchol-Balter
:
A note on comparing response times in the M/GI/1/FB and M/GI/1/PS queues. Oper. Res. Lett. 32(1): 73-76 (2004) - [j12]Takayuki Osogami, Adam Wierman, Mor Harchol-Balter, Alan Scheller-Wolf:
A recursive analysis technique for multi-dimensionally infinite Markov chains. SIGMETRICS Perform. Evaluation Rev. 32(2): 3-5 (2004) - [j11]Adam Wierman, Mor Harchol-Balter:
Formalizing SMART scheduling. SIGMETRICS Perform. Evaluation Rev. 32(2): 12-13 (2004) - [c21]David T. McWherter, Bianca Schroeder, Anastassia Ailamaki, Mor Harchol-Balter
:
Priority Mechanisms for OLTP and Transactional Web Applications. ICDE 2004: 535-546 - 2003
- [j10]Mor Harchol-Balter
, Bianca Schroeder, Nikhil Bansal, Mukesh Agrawal:
Size-based scheduling to improve web performance. ACM Trans. Comput. Syst. 21(2): 207-233 (2003) - [c20]Takayuki Osogami, Mor Harchol-Balter
:
Necessary and Sufficient Conditions for Representing General Distributions by Coxians. Computer Performance Evaluation / TOOLS 2003: 182-199 - [c19]Takayuki Osogami, Mor Harchol-Balter
:
A Closed-Form Solution for Mapping General Distributions to Minimal PH Distributions. Computer Performance Evaluation / TOOLS 2003: 200-217 - [c18]Mor Harchol-Balter, Cuihong Li, Takayuki Osogami, Alan Scheller-Wolf, Mark S. Squillante:
Analysis of Task Assignment with Cycle Stealing under Central Queue. ICDCS 2003: 628- - [c17]Takayuki Osogami, Mor Harchol-Balter
, Alan Scheller-Wolf:
Analysis of cycle stealing with switching cost. SIGMETRICS 2003: 184-195 - [c16]Adam Wierman, Mor Harchol-Balter
:
Classifying scheduling policies with respect to unfairness in an M/GI/1. SIGMETRICS 2003: 238-249 - [c15]Mor Harchol-Balter
, Cuihong Li, Takayuki Osogami, Alan Scheller-Wolf, Mark S. Squillante:
Cycle stealing under immediate dispatch task assignment. SPAA 2003: 274-285 - 2002
- [j9]Mor Harchol-Balter
:
Task assignment with unknown duration. J. ACM 49(2): 260-288 (2002) - [j8]Mor Harchol-Balter, Karl Sigman, Adam Wierman:
Asymptotic convergence of scheduling policies with respect to slowdown. Perform. Evaluation 49(1/4): 241-256 (2002) - [j7]Mor Harchol-Balter, Karl Sigman, Adam Wierman:
Understanding the slowdown of large jobs in an M/GI/1 system. SIGMETRICS Perform. Evaluation Rev. 30(3): 9-11 (2002) - 2001
- [j6]Mor Harchol-Balter:
Job placement with unknown duration and no preemption. SIGMETRICS Perform. Evaluation Rev. 28(4): 3-5 (2001) - [j5]Nikhil Bansal, Mor Harchol-Balter:
Analysis of M/G/1/SRPT under transient overload. SIGMETRICS Perform. Evaluation Rev. 29(3): 12-14 (2001) - [c14]Mor Harchol-Balter
, Nikhil Bansal, Bianca Schroeder, Mukesh Agrawal:
SRPT Scheduling for Web Servers. JSSPP 2001: 11-20 - [c13]Nikhil Bansal, Mor Harchol-Balter
:
Analysis of SRPT scheduling: investigating unfairness. SIGMETRICS/Performance 2001: 279-290 - 2000
- [j4]Matthew Andrews, Antonio Fernández, Mor Harchol-Balter
, Frank Thomson Leighton, Lisa Zhang:
General Dynamic Routing with Per-Packet Delay Guarantees of O(Distance + 1/Session Rate). SIAM J. Comput. 30(5): 1594-1623 (2000) - [c12]Bianca Schroeder, Mor Harchol-Balter
:
Evaluation of Task Assignment Policies for Supercomputing Servers: The Case for Load Unbalancing and Fairness. HPDC 2000: 211-220 - [c11]Mor Harchol-Balter:
Task Assignment with Unknown Duration. ICDCS 2000: 214-224
1990 – 1999
- 1999
- [j3]Mor Harchol-Balter
, Mark Crovella, Cristina D. Murta:
On Choosing a Task Assignment Policy for a Distributed Server System. J. Parallel Distributed Comput. 59(2): 204-228 (1999) - [c10]Mor Harchol-Balter
, Frank Thomson Leighton, Daniel Lewin:
Resource Discovery in Distributed Networks. PODC 1999: 229-237 - [c9]Mark Crovella, Robert Frangioso, Mor Harchol-Balter:
Connection Scheduling in Web Servers. USENIX Symposium on Internet Technologies and Systems 1999 - 1998
- [c8]Mor Harchol-Balter
, Mark Crovella, Cristina D. Murta:
On Choosing a Task Assignment Policy for a Distributed Server System. Computer Performance Evaluation (Tools) 1998: 231-242 - [c7]Mark Crovella, Mor Harchol-Balter
, Cristina D. Murta:
Task Assignment in a Distributed System: Improving Performance by Unbalancing Load (Extended Abstract). SIGMETRICS 1998: 268-269 - 1997
- [j2]Mor Harchol-Balter
, Allen B. Downey
:
Exploiting Process Lifetime Distributions for Dynamic Load Balancing. ACM Trans. Comput. Syst. 15(3): 253-285 (1997) - [c6]Matthew Andrews, Antonio Fernández, Mor Harchol-Balter, Frank Thomson Leighton, Lisa Zhang:
General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate). FOCS 1997: 294-302 - 1996
- [c5]Mor Harchol-Balter
, Allen B. Downey
:
Exploiting Process Lifetime Distributions for Dynamic Load Balancing. SIGMETRICS 1996: 13-24 - 1995
- [c4]Mor Harchol-Balter
, Allen B. Downey
:
Exploiting Process Lifetime Distributions for Dynamic Load Balancing. SOSP 1995: 236 - [c3]Mor Harchol-Balter, David Wolfe:
Bounding delays in packet-routing networks. STOC 1995: 248-257 - 1994
- [j1]Peter Gemmell, Mor Harchol-Balter:
Tight Bounds on Expected Time to Add Correctly and Add Mostly Correctly. Inf. Process. Lett. 49(2): 77-83 (1994) - [c2]Micah Adler, Peter Gemmell, Mor Harchol-Balter, Richard M. Karp, Claire Kenyon:
Selection in the Presence of Noise: The Design of Playoff Systems. SODA 1994: 564-572 - [c1]Mor Harchol-Balter, Paul E. Black:
Queueing Analysis of Oblivious Packet-Routing Networks. SODA 1994: 583-592
Coauthor Index

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:54 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint