Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMor Harchol-Balter
- > Home > Persons > Mor Harchol-Balter
Publications
- 2023
[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- 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
- [j68]Ziv Scully, Isaac Grosof, Mor Harchol-Balter:
Optimal multiserver scheduling with unknown job sizes in heavy traffic. Perform. Evaluation 145: 102150 (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) - [c67]Isaac Grosof, Kunhe Yang, Ziv Scully, Mor Harchol-Balter:
Nudge: Stochastically Improving upon FCFS. SIGMETRICS (Abstracts) 2021: 11-12 - [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) - [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
- [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) - [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) - [c60]Ziv Scully, Mor Harchol-Balter, Alan Scheller-Wolf:
Simple Near-Optimal Scheduling for the M/G/1. SIGMETRICS (Abstracts) 2020: 37-38 - [i14]Ziv Scully, Isaac Grosof, Mor Harchol-Balter:
Optimal Multiserver Scheduling with Unknown Job Sizes in Heavy Traffic. CoRR abs/2003.13232 (2020) - 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) - [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 - [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) - [j48]Isaac Grosof, Ziv Scully, Mor Harchol-Balter:
SRPT for Multiserver Systems. SIGMETRICS Perform. Evaluation Rev. 46(2): 9-11 (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 - [c54]Ziv Scully, Mor Harchol-Balter, Alan Scheller-Wolf:
SOAP: One Clean Analysis of All Age-Based Scheduling Policies. SIGMETRICS (Abstracts) 2018: 36-38 - [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
- [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) - [i1]Ziv Scully, Mor Harchol-Balter, Alan Scheller-Wolf:
SOAP: One Clean Analysis of All Age-Based Scheduling Policies. CoRR abs/1712.00790 (2017)
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 2024-03-21 20:25 CET 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:
