default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMor Harchol-Balter
- > Home > Persons > Mor Harchol-Balter
Publications
- 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)- 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) - 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) - [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 - [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 - 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) - [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
- [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) - 2003
- [c16]Adam Wierman, Mor Harchol-Balter:
Classifying scheduling policies with respect to unfairness in an M/GI/1. SIGMETRICS 2003: 238-249 - 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)
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-08-16 03:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
