Mor Harchol-Balter
#160,060
Most Influential Person Now
Mor Harchol-Balter's AcademicInfluence.com Rankings
Mor Harchol-Baltercomputer-science Degrees
Computer Science
#9113
World Rank
#9576
Historical Rank
Database
#6104
World Rank
#6329
Historical Rank

Download Badge
Computer Science
Mor Harchol-Balter's Degrees
- PhD Computer Science University of California, Berkeley
- Masters Computer Science University of California, Berkeley
Similar Degrees You Can Earn
Why Is Mor Harchol-Balter Influential?
(Suggest an Edit or Addition)Mor Harchol-Balter's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Optimal power allocation in server farms (2009) (523)
- Performance Modeling and Design of Computer Systems: Queueing Theory in Action (2013) (444)
- ATLAS: A scalable and high-performance scheduling algorithm for multiple memory controllers (2010) (424)
- Thread Cluster Memory Scheduling: Exploiting Differences in Memory Access Behavior (2010) (409)
- On Choosing a Task Assignment Policy for a Distributed Server System (1998) (380)
- Analysis of SRPT scheduling: investigating unfairness (2001) (376)
- Exploiting process lifetime distributions for dynamic load balancing (1995) (374)
- Size-based scheduling to improve web performance (2003) (345)
- AutoScale: Dynamic, Robust Capacity Management for Multi-Tier Data Centers (2012) (311)
- Open Versus Closed: A Cautionary Tale (2006) (289)
- Exploiting process lifetime distributions for dynamic load balancing (1997) (286)
- Optimality analysis of energy-performance trade-off for server farm management (2010) (249)
- Task assignment with unknown duration (2000) (246)
- Connection Scheduling in Web Servers (1999) (225)
- Resource discovery in distributed networks (1999) (224)
- Analysis of join-the-shortest-queue routing for web server farms (2007) (210)
- Web servers under overload: How scheduling can help (2006) (198)
- Classifying scheduling policies with respect to unfairness in an M/GI/1 (2003) (185)
- Server farms with setup costs (2010) (164)
- TetriSched: global rescheduling with adaptive plan-ahead in dynamic heterogeneous clusters (2016) (155)
- Reducing Latency via Redundant Requests: Exact Analysis (2015) (148)
- Closed form solutions for mapping general distributions to quasi-minimal PH distributions (2006) (142)
- AdaptSize: Orchestrating the Hot Object Memory Cache in a Content Delivery Network (2017) (139)
- Borg: the next generation (2020) (136)
- Task assignment in a distributed system (extended abstract): improving performance by unbalancing load (1997) (128)
- How to Determine a Good Multi-Programming Level for External Scheduling (2006) (125)
- Evaluation of Task Assignment Policies for Supercomputing Servers: The Case for Load Unbalancing and Fairness (2000) (118)
- Exact analysis of the M/M/k/setup class of Markov chains via recursive renewal reward (2013) (116)
- Priority mechanisms for OLTP and transactional Web applications (2004) (110)
- Multi-Server Queueing Systems with Multiple Priority Classes (2005) (103)
- Are sleep states effective in data centers? (2012) (97)
- Asymptotic convergence of scheduling policies with respect to slowdown (2002) (90)
- PriorityMeister: Tail Latency QoS for Shared Networked Storage (2014) (90)
- A Better Model for Job Redundancy: Decoupling Server Slowdown and Job Size (2016) (88)
- Power Capping Via Forced Idleness (2009) (87)
- A Closed-Form Solution for Mapping General Distributions to Minimal PH Distributions (2003) (86)
- Redundancy-d: The Power of d Choices for Redundancy (2017) (85)
- The Effect of Heavy-Tailed Job Size Distributions on Computer System Design (1999) (85)
- Achieving Class-Based QoS for Transactional Workloads (2006) (82)
- Surprising results on task assignment in server farms with high-variability workloads (2009) (76)
- Performance Modeling and Design of Computer Systems: The M/G/1 Queue and the Inspection Paradox (2013) (73)
- On the inapproximability of M/G/K: why two moments of job size distribution are not enough (2010) (72)
- Implementation of SRPT Scheduling in Web Servers (2000) (68)
- Nearly insensitive bounds on SMART scheduling (2005) (65)
- Queueing with redundant requests: exact analysis (2016) (63)
- An Exact and Efficient Algorithm for the Constrained Dynamic Operator Staffing Problem for Call Centers (2008) (60)
- Self-adaptive admission control policies for resource-sharing systems (2009) (59)
- Analysis of multi-server systems via dimensionality reduction of markov chains (2005) (57)
- How data center size impacts the effectiveness of dynamic power management (2011) (53)
- Practical Bounds on Optimal Caching with Variable Object Sizes (2017) (50)
- Analysis of task assignment with cycle stealing under central queue (2003) (48)
- Analysis of cycle stealing with switching times and thresholds (2005) (47)
- Scheduling for today's computer systems: bridging theory and practice (2007) (46)
- The case for sleep states in servers (2011) (46)
- Classifying scheduling policies with respect to higher moments of conditional response time (2005) (45)
- SRPT for Multiserver Systems (2018) (45)
- RobinHood: Tail Latency Aware Caching - Dynamic Reallocation from Cache-Rich to Cache-Poor (2018) (45)
- Performance Modeling and Design of Computer Systems: Contents (2013) (44)
- Exploiting process lifetime distributions for dynamic load balancing (1996) (41)
- The CacheLib Caching Engine: Design and Experiences at Scale (2020) (40)
- SNC-Meister: Admitting More Tenants with Tail Latency SLOs (2016) (39)
- The Case for SRPT Scheduling in Web Servers (1998) (39)
- Cycle stealing under immediate dispatch task assignment (2003) (39)
- Necessary and Sufficient Conditions for Representing General Distributions by Coxians (2003) (36)
- SOAP: One Clean Analysis of All Age-Based Scheduling Policies (2017) (36)
- Bounding delays in packet-routing networks (1995) (36)
- Fundamental characteristics of queues with fluctuating load (2006) (35)
- General dynamic routing with per-packet delay guarantees of O(distance+1/session rate) (1997) (35)
- SRPT Scheduling for Web Servers (2001) (35)
- Saving Cash by Using Less Cache (2012) (35)
- Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates (2006) (33)
- WorkloadCompactor: reducing datacenter cost while providing tail latency SLO guarantees (2017) (32)
- Improving preemptive prioritization via statistical characterization of OLTP locking (2005) (32)
- A note on comparing response times in the M/GI/1/FB and M/GI/1/PS queues (2004) (32)
- Queueing analysis of oblivious packet-routing networks (1994) (31)
- Scheduling for efficiency and fairness in systems with redundancy (2017) (30)
- Analysis of cycle stealing with switching cost (2003) (29)
- SOAP (2018) (27)
- Distributed, Robust Auto-Scaling Policies for Power Management in Compute Intensive Server Farms (2011) (25)
- How many servers are best in a dual-priority M/PH/k system? (2006) (24)
- Selection in the presence of noise: the design of playoff systems (1994) (24)
- TO BALANCE OR UNBALANCE LOAD IN SIZE-INTERVAL TASK ALLOCATION (2010) (24)
- SOFTScale: Stealing Opportunistically for Transient Scaling (2012) (24)
- Open problems in queueing theory inspired by datacenter computing (2021) (24)
- Reducing Latency via Redundant Requests (2015) (23)
- Thread Cluster Memory Scheduling (2011) (23)
- Tail asymptotics for policies favoring short jobs in a many-flows regime (2006) (22)
- Exploring Threshold-based Policies for Load Sharing (2004) (21)
- M/G/k with Exponential Setup (2009) (21)
- Simulation results for JSQ Server Farms with Processor Sharing Servers (2007) (21)
- Analysis of scheduling policies under correlated job sizes (2010) (20)
- Zero Queueing for Multi-Server Jobs (2020) (20)
- THE OPTIMAL ADMISSION THRESHOLD IN OBSERVABLE QUEUES WITH STATE DEPENDENT PRICING (2013) (19)
- The Power of d Choices for Redundancy (2016) (19)
- Clearing Analysis on Phases: Exact Limiting Probabilities for Skip-Free, Unidirectional, Quasi-Birth-Death Processes (2015) (19)
- RobinHood: tail latency-aware caching—dynamically reallocating from cache-rich to cache-poor (2018) (18)
- Performance Modeling and Design of Computer Systems: Preface (2013) (17)
- Towards Optimality in Parallel Job Scheduling (2017) (17)
- Towards Optimality in Parallel Scheduling (2017) (17)
- Optimal Multiserver Scheduling with Unknown Job Sizes in Heavy Traffic (2020) (16)
- M/G/kM/G/k with staggered setup (2013) (16)
- Delay asymptotics and bounds for multitask parallel jobs (2017) (14)
- Load Balancing Guardrails: Keeping Your Heavy Traffic on the Road to Low Response Times (2019) (14)
- Optimal scheduling for jobs with progressive deadlines (2015) (14)
- Delay asymptotics and bounds for multitask parallel jobs (2019) (14)
- Practical Bounds on Optimal Caching with Variable Object Sizes (2018) (13)
- A Stochastic Analysis of Hard Disk Drives (2011) (13)
- Priority Pricing in Queues with a Continuous Distribution of Customer Valuations (CMU-CS-13-109) (2016) (13)
- The Gittins Policy is Nearly Optimal in the M/G/k under Extremely General Conditions (2020) (13)
- Stability for Two-class Multiserver-job Systems (2020) (13)
- Simple Near-Optimal Scheduling for the M/G/1 (2019) (13)
- The effect of higher moments of job size distribution on the performance of an M/G/s queueing system (2007) (12)
- Special Issue on New Perspectives in Scheduling (2007) (11)
- Understanding Response Time in the Redundancy-d System (2016) (11)
- Closed versus open system models and their impact on performance (2006) (10)
- Understanding the slowdown of large jobs in an M/GI/1 system (2002) (10)
- SOAP: One Clean Analysis of All Age-Based Scheduling Policies (2018) (10)
- Analyzing Response Time in the Redundancy-d System (2015) (10)
- Decomposition results for an m/m/k with staggered setup (2010) (10)
- How many servers are best in a dual-priority FCFS system? (2003) (10)
- Energy-Efficient Dynamic Capacity Provisioning in Server Farms (2010) (10)
- Value driven load balancing (2014) (9)
- A note on The limited performance benefits of migrating active processes for load (1995) (9)
- Optimally Scheduling Jobs with Multiple Tasks (2017) (9)
- SOAP Bubbles: Robust Scheduling Under Adversarial Noise (2018) (9)
- A recursive analysis technique for multi-dimensionally infinite Markov chains (2004) (9)
- Why segregating short jobs from long jobs under high variability is not always a win (2009) (9)
- Job placement with unknown duration and no preemption (2001) (8)
- Optimal Resource Allocation for Elastic and Inelastic Jobs (2020) (8)
- Optimal Scheduling and Exact Response Time Analysis for Multistage Jobs (2018) (7)
- Insensitivity for PS server farms with JSQ routing (2007) (7)
- Many Flows Asymptotics for SMART Scheduling Policies (2012) (7)
- Tight Bounds on Expected Time to Add Correctly and Add Mostly Correctly (1994) (7)
- Admitting More Tenants with Tail Latency SLOs (2016) (7)
- A note on \The Limited Performance Bene ts of Migrating Active Processes for Load Sharing" (1995) (7)
- Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems (2013) (7)
- Performance Modeling and Design of Computer Systems: M/M/1 and PASTA (2013) (6)
- Load Balancing Guardrails (2019) (6)
- Robustness of threshold policies in beneficiary-donor model (2005) (6)
- Simple Near-Optimal Scheduling for the M/G/1 (2019) (6)
- The Gittins Policy in the M/G/1 Queue (2021) (5)
- Process Lifetimes are Not Exponential , more like 1 T : Implications on Dynamic Load Balancing (5)
- Scheduling: Non-Preemptive, Size-Based Policies (2013) (5)
- heSRPT: Parallel Scheduling to Minimize Mean Slowdown (2020) (5)
- Inducing Optimal Scheduling with Selfish Users (2008) (5)
- Scheduling Solutions for Coping with Transient Overload (2001) (5)
- Tetrisched : Space-Time Scheduling for Heterogeneous Datacenters (2013) (4)
- WCFS: a new framework for analyzing multiserver systems (2021) (4)
- Practical Bounds on Optimal Caching with Variable Object Sizes (2019) (3)
- The Case for Phase-Aware Scheduling of Parallelizable Jobs (2021) (3)
- Pricing and queueing (2012) (3)
- Performance Evaluation Server farms with setup costs (2010) (3)
- In Network of Queues, M/M/1 Can Outperform M/D/1 (1994) (3)
- The multiserver job queueing model (2022) (3)
- Achieving high cache hit ratios for CDN memory caches with size-aware admission (2016) (3)
- Performance Modeling and Design of Computer Systems: Introduction to Queueing (2013) (3)
- An Adaptive Threshold-Based Policy for Sharing Servers with Affinities (2004) (3)
- Nudge: Stochastically Improving upon FCFS (2021) (3)
- Analysis of Task Assignment with Cycle Stealing (2002) (3)
- SOFTScale: Stealing Opportunistically For Transient Scaling (CMU-CS-12-111) (2012) (2)
- Optimal Scheduling in the Multiserver-job Model under Heavy Traffic (2022) (2)
- Exact analysis of the M/M/k/setup class of Markov chains via recursive renewal reward (2014) (2)
- Constant Beats Memoryless for Service (1994) (2)
- Load balancing guardrails: keeping your heavy traffic on the road to low response times (invited paper) (2021) (2)
- Formalizing SMART scheduling (2004) (2)
- Performance Modeling and Design of Computer Systems: Queueing Theory Terminology (2013) (2)
- Optimal Scheduling of Parallel Jobs With Unknown Service Requirements (2021) (2)
- To Queue or Not to Queue: When Queueing is Better Than Timesharing in a Distributed System (1997) (2)
- To queue or not to queue?: When FCFS is better than PS in a distributed system (1997) (2)
- To clean or not to clean: Malware removal strategies for servers under load (2020) (2)
- Analysis of M/G/1/SRPT under transient overload (2001) (2)
- Scheduling for Server Farms: Approaches and Open Problems (2008) (2)
- Load Balancing Guardrails (2019) (1)
- Simple bounds on SMART scheduling (2003) (1)
- Performance Modeling and Design of Computer Systems: Transform Analysis (2013) (1)
- heSRPT: Optimal Parallel Scheduling of Jobs With Known Sizes (2019) (1)
- Performance Modeling and Design of Computer Systems: Scheduling: Non-Preemptive, Non-Size-Based Policies (2013) (1)
- Performance Modeling and Design of Computer Systems: Scheduling: SRPT and Fairness (2013) (1)
- Simple Near-Optimal Scheduling for the M/G/1 (2020) (1)
- The Finite-Skip Method for Multiserver Analysis (2021) (1)
- How to Schedule Near-Optimally under Real-World Constraints (2021) (1)
- Sharing dbms among multiple users while providing performance isolation: analysis and implementation (2008) (1)
- Multiscale Scheduling: Integrating Competitive and Cooperative Scheduling in Theory and in Practice (2007) (1)
- Time-Reversibility and Burke's Theorem (2012) (1)
- Towards Optimality in Parallel Job Scheduling (2019) (1)
- SRPT for Multiserver Systems (2019) (1)
- Energy-Efficient Dynamic Capacity Provisioning in Server Farms (CMU-CS-10-108) (2010) (1)
- Performance Modeling and Design of Computer Systems: Little's Law and Other Operational Laws (2013) (1)
- Performance Modeling and Design of Computer Systems: Real-World Examples: Google, Aloha, and Harder Chains (2013) (1)
- Simple Near-Optimal Scheduling for the M/G/1 (2020) (1)
- Nudge: Stochastically Improving upon FCFS (2021) (1)
- Zero Queueing for Multi-Server Jobs (2021) (1)
- Optimal Multiserver Scheduling with Unknown Job Sizes in Heavy Traffic (2021) (1)
- The M/M/k with Deterministic Setup Times (2022) (1)
- Limit Properties of Probability Densities Characterized by Moment Indexes (2009) (1)
- Massive Indexed Directories in DeltaFS (2018) (0)
- A Stochastic Analysis of Hard Disk Drives Field (2015) (0)
- Performance Modeling and Design of Computer Systems: Tales of Tails: A Case Study of Real-World Workloads (2013) (0)
- Session details: Scheduling I (2018) (0)
- Scheduling Solutions for Coping with Transient Overload 1 (2001) (0)
- Performance Modeling and Design of Computer Systems: Generating Random Variables for Simulation (2013) (0)
- M / G / k with Exponential Setup Anshul Gandhi (2009) (0)
- Performance Modeling and Design of Computer Systems: Real-World Workloads: High Variability and Heavy Tails (2013) (0)
- Lecture 8: Discrete Time Markov Chains: Ergodicity Theory (2009) (0)
- Performance Modeling and Design of Computer Systems: Classed Network of Queues (2013) (0)
- Performance Modeling and Design of Computer Systems: Ergodicity Theory (2013) (0)
- Computing the Death Rate of COVID-19 (2021) (0)
- Session 4: Server and Cluster Management (2010) (0)
- Analysis of SRPT Scheduling: Investigating Unfairness (cid:3) (2007) (0)
- Session details: Session: Scheduling I (2019) (0)
- Performance Modeling and Design of Computer Systems: Task Assignment Policies for Server Farms (2013) (0)
- Performance Modeling and Design of Computer Systems: Networks with Time-Sharing (PS) Servers (BCMP) (2013) (0)
- Performance Modeling and Design of Computer Systems: Server Farms: M/M/k and M/M/k/k (2013) (0)
- The Predictive Power of Simple Operational Laws: “What-If” Questions and Answers (2012) (0)
- Greater Variance Does Not Necessarily Imply Greater Average Delay (1994) (0)
- Necessary Probability Background (2012) (0)
- Power Optimization Application (2012) (0)
- Performance Modeling and Design of Computer Systems: Smart Scheduling in the M/G/1 (2013) (0)
- Performance Modeling and Design of Computer Systems: Phase-Type Distributions and Matrix-Analytic Methods (2013) (0)
- Scheduling Policies : Single Servers (2013) (0)
- Session details: Session 4: Performance Analysis of Very Large Systems (2017) (0)
- The most common queueing theory questions asked by computer systems practitioners (2022) (0)
- Queueing with redundant requests: exact analysis (2016) (0)
- Tepper School of Business 7-2008 Inducing Optimal Scheduling with Selfish Users (2015) (0)
- Open problems in queueing theory inspired by datacenter computing (2021) (0)
- Bounding Delays in Packet-Routing Networks with Light Traffic (1995) (0)
- Asymptotic response time analysis for multi-task parallel jobs (2017) (0)
- The Exponential Distribution & Poisson Process 1 Motivation (2009) (0)
- Transition to Continuous-Time Markov Chains (2012) (0)
- The Gittins Policy is Nearly Optimal in the M/G/k under Extremely General Conditions (2021) (0)
- heSRPT (2021) (0)
- Session details: Time varying workloads (2007) (0)
- Session details: Session 4: Performance Analysis of Very Large Systems (2017) (0)
- Comparison of SRPT and PS Scheduling Under ON/OFF Load Conditions (2000) (0)
- Motivating Examples of the Power of Analytical Modeling (2012) (0)
- Exponential Distribution and the Poisson Process (2012) (0)
- A Better Model for Task Assignment in Server Farms: How Replication can Help (2016) (0)
- Closed Networks of Queues (2012) (0)
- Bounding Delays in Packet-routing Networks with Light Traac Bounding Delays in Packet-routing Networks with Light T Raac (1995) (0)
- From Markov Chains to Simple Queues (2012) (0)
- Modification Analysis: “What-If” for Closed Systems (2012) (0)
- Performance Modeling and Design of Computer Systems: Sample Paths, Convergence, and Averages (2013) (0)
- Performance Modeling and Design of Computer Systems: Server Farms and Networks: Multi-server, Multi-queue Systems (2013) (0)
- Power Management in Data Centers (2010) (0)
- M/G/1 Transform Analysis (2012) (0)
- 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 (2007) (0)
- SCALING PROPERTIES OF QUEUES WITH TIME-VARYING LOAD PROCESSES: EXTENSIONS AND APPLICATIONS (2021) (0)
- 1 “ All Can Win ” Theorems – Why Biased Scheduling is Fair (2007) (0)
- Correction to: Multi-server queueing systems with multiple priority classes (2021) (0)
- Capacity Provisioning for Server Farms (2012) (0)
- Performance Modeling and Design of Computer Systems: Discrete-Time Markov Chains (2013) (0)
- Networks of Queues and Jackson Product Form (2012) (0)
- S & X : Decoupling Server Slowdown ( S ) and Job Size ( X ) in Modeling Job Redundancy (2016) (0)
This paper list is powered by the following services: