Mor Harchol‐Balter

11.2k total citations · 5 hit papers
189 papers, 7.1k citations indexed

About

Mor Harchol‐Balter is a scholar working on Computer Networks and Communications, Management Information Systems and Information Systems. According to data from OpenAlex, Mor Harchol‐Balter has authored 189 papers receiving a total of 7.1k indexed citations (citations by other indexed papers that have themselves been cited), including 143 papers in Computer Networks and Communications, 112 papers in Management Information Systems and 64 papers in Information Systems. Recurrent topics in Mor Harchol‐Balter's work include Advanced Queuing Theory Analysis (112 papers), Cloud Computing and Resource Management (64 papers) and Advanced Wireless Network Optimization (50 papers). Mor Harchol‐Balter is often cited by papers focused on Advanced Queuing Theory Analysis (112 papers), Cloud Computing and Resource Management (64 papers) and Advanced Wireless Network Optimization (50 papers). Mor Harchol‐Balter collaborates with scholars based in United States, Netherlands and United Kingdom. Mor Harchol‐Balter's co-authors include Anshul Gandhi, Allen B. Downey, Adam Wierman, Mark Crovella, Nikhil Bansal, Bianca Schroeder, Alan Scheller‐Wolf, Michael A. Kozuch, Onur Mutlu and Yoongu Kim and has published in prestigious journals such as IEEE Transactions on Automatic Control, Management Science and European Journal of Operational Research.

In The Last Decade

Mor Harchol‐Balter

179 papers receiving 6.6k citations

Hit Papers

5 papers align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

Optimal power allocation in server farms

2009 347 citations Anshul Gandhi, Mor Harchol‐Balter et al. profile →
Performance Modeling and Design of Computer Systems: Queueing Theory in Action

2013 336 citations Mor Harchol‐Balter profile →
Performance Modeling and Design of Computer Systems

2013 327 citations Mor Harchol‐Balter profile →
Thread Cluster Memory Scheduling: Exploiting Differences in Memory Access Behavior

2010 312 citations Mor Harchol‐Balter et al. profile →
ATLAS: A scalable and high-performance scheduling algorithm for multiple memory controllers

2010 307 citations Mor Harchol‐Balter et al. profile →

Peers

Countries citing papers authored by Mor Harchol‐Balter

Since Specialization

Citations

This map shows the geographic impact of Mor Harchol‐Balter's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Mor Harchol‐Balter with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Mor Harchol‐Balter more than expected).

Fields of papers citing papers by Mor Harchol‐Balter

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Mor Harchol‐Balter. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Mor Harchol‐Balter. The network helps show where Mor Harchol‐Balter may publish in the future.

Co-authorship network of co-authors of Mor Harchol‐Balter

This figure shows the co-authorship network connecting the top 25 collaborators of Mor Harchol‐Balter. A scholar is included among the top collaborators of Mor Harchol‐Balter based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Mor Harchol‐Balter. Mor Harchol‐Balter is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

#	Work	Indexed citations
1	The RESET and MARC techniques, with application to multiserver-job analysis 2023 ·Performance Evaluation ·(unknown), (unknown), Mor Harchol‐Balter, Alan Scheller‐Wolf	9
2	The case for phase-aware scheduling of parallelizable jobs 2021 ·Performance Evaluation ·(unknown), Justin Whitehouse, Benjamin Moseley, Weina Wang, Mor Harchol‐Balter	1
3	Zero Queueing for Multi-Server Jobs 2021 ·Proceedings of the ACM on Measurement and Analysis of Computing Systems ·Weina Wang, Qiaomin Xie, Mor Harchol‐Balter	13
4	Zero Queueing for Multi-Server Jobs 2021 ·ACM SIGMETRICS Performance Evaluation Review ·Weina Wang, Qiaomin Xie, Mor Harchol‐Balter	1
5	The CacheLib Caching Engine: Design and Experiences at Scale 2020 ·Operating Systems Design and Implementation ·(unknown), Daniel S. Berger, Sara McAllister, (unknown), (unknown), (unknown), (unknown), (unknown), Nathan Beckmann, Mor Harchol‐Balter, Gregory R. Ganger	28
6	RobinHood: tail latency-aware caching—dynamically reallocating from cache-rich to cache-poor 2018 ·Operating Systems Design and Implementation ·Daniel S. Berger, (unknown), Timothy Zhu, Mor Harchol‐Balter, Siddhartha Sen	20
7	Implementation of SRPT Scheduling in Web Servers 2018 ·Research Showcase @ Carnegie Mellon University (Carnegie Mellon University) ·Mor Harchol‐Balter, Nikhil Bansal, Bianca Schroeder, (unknown)	5
8	Analysis of Task Assignment with Cycle Stealing 2018 ·Research Showcase @ Carnegie Mellon University (Carnegie Mellon University) ·Mor Harchol‐Balter, Chun‐Zhu Li, Takayuki Osogami, Alan Scheller‐Wolf, Mark S. Squillante	0
9	Exploring Threshold-based Policies for Load Sharing 2018 ·Figshare ·Takayuki Osogami, Mor Harchol‐Balter, Alan Scheller‐Wolf, Li Zhang	0
10	Power Capping Via Forced Idleness 2018 ·Figshare ·Anshul Gandhi, Mor Harchol‐Balter, Rajarshi Das, Jeffrey O. Kephart, Charles Lefurgy	11
11	Simple bounds on SMART scheduling 2018 ·Research Showcase @ Carnegie Mellon University (Carnegie Mellon University) ·Adam Wierman, Mor Harchol‐Balter	0
12	Saving Cash by Using Less Cache 2018 ·Figshare ·Timothy Zhu, Anshul Gandhi, Mor Harchol‐Balter, Michael A. Kozuch	5
13	Adaptsize: orchestrating the hot object memory cache in a content delivery network 2017 ·Networked Systems Design and Implementation ·Daniel S. Berger, Ramesh K. Sitaraman, Mor Harchol‐Balter	86
14	Clearing analysis on phases: Exact limiting probabilities for skip-free, unidirectional, quasi-birth-death processes 2016 ·Stochastic Systems ·Sherwin Doroudi, (unknown), Mor Harchol‐Balter	4
15	Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems 2013 ·Mor Harchol‐Balter, John R. Douceur, Jun Xu	14
16	Achieving Class-Based QoS for Transactional Workloads 2006 ·Bianca Schroeder, Mor Harchol‐Balter, Arun Iyengar, Erich Nahum	48
17	General dynamic routing with per-packet delay guarantees of O(distance+1/session rate) 2002 ·Matthew Andrews, Antonio Fernández Anta, Mor Harchol‐Balter, T. Leighton, (unknown)	6
18	Connection Scheduling in Web Servers 1999 ·OpenBU/Boston University Institutional Repository (Boston University) ·Mark Crovella, (unknown), Mor Harchol‐Balter	141
19	On Choosing a Task Assignment Policy for a Distributed Server System 1999 ·Journal of Parallel and Distributed Computing ·Mor Harchol‐Balter, Mark Crovella, Cristina D. Murta	232
20	Queueing analysis of oblivious packet-routing networks 1994 ·Symposium on Discrete Algorithms ·Mor Harchol‐Balter, Paul E. Black	19

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact