default search action
Isaac Grosof
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j17]Runhan Xie
, Isaac Grosof
Heavy-Traffic Optimal Size- and State-Aware Dispatching. Proc. ACM Meas. Anal. Comput. Syst. 8(1): 9:1-9:36 (2024) - [j16]Isaac Grosof:
The RESET Technique for Multiserver-Job Analysis. SIGMETRICS Perform. Evaluation Rev. 51(3): 8-9 (2024) - [j15]Isaac Grosof:
Optimal Scheduling in Multiserver Queues. SIGMETRICS Perform. Evaluation Rev. 51(3): 29-32 (2024) - [j14]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) - [c12]Runhan Xie
Heavy-Traffic Optimal Size- and State-Aware Dispatching. SIGMETRICS/Performance (Abstracts) 2024: 7-8 - [i17]Isaac Grosof, Siva Theja Maguluri, R. Srikant:
Convergence for Natural Policy Gradient on Infinite-State Average-Reward Markov Decision Processes. CoRR abs/2402.05274 (2024) - [i16]Isaac Grosof, Yige Hong, Mor Harchol-Balter:
Analysis of Markovian Arrivals and Service with Applications to Intermittent Overload. CoRR abs/2405.04102 (2024) - [i15]Yashaswini Murthy, Isaac Grosof, Siva Theja Maguluri, R. Srikant:
Performance of NPG in Countable State-Space Average-Cost RL. CoRR abs/2405.20467 (2024) - 2023
- [j13]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) - [j12]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) - [c11]Isaac Grosof
Invited Paper: ServerFilling: A better approach to packing multiserver jobs. ApPLIED@PODC 2023: 7:1-7:5 - [c10]Isaac Grosof
Optimal Scheduling in the Multiserver-job Model under Heavy Traffic. SIGMETRICS (Abstracts) 2023: 99-100 - [i14]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) - [i13]Runhan Xie, Isaac Grosof, Ziv Scully:
Heavy-Traffic Optimal Size- and State-Aware Dispatching. CoRR abs/2312.16377 (2023) - 2022
- [j11]Isaac Grosof
WCFS: a new framework for analyzing multiserver systems. Queueing Syst. Theory Appl. 102(1-2): 143-174 (2022) - [c9]Ziv Scully
Uniform Bounds for Scheduling with Job Size Estimates. ITCS 2022: 114:1-114:30 - [i12]Isaac Grosof, Michael Mitzenmacher:
Incentive Compatible Queues Without Money. CoRR abs/2202.05747 (2022) - [i11]Isaac Grosof, Naifeng Zhang
Towards the shortest DRAT proof of the Pigeonhole Principle. CoRR abs/2207.11284 (2022) - [i10]Isaac Grosof, Ziv Scully, Mor Harchol-Balter
Optimal Scheduling in the Multiserver-job Model under Heavy Traffic. CoRR abs/2211.02762 (2022) - 2021
- [j10]Ziv Scully
Optimal multiserver scheduling with unknown job sizes in heavy traffic. Perform. Evaluation 145: 102150 (2021) - [j9]Isaac Grosof
Nudge: Stochastically Improving upon FCFS. Proc. ACM Meas. Anal. Comput. Syst. 5(2): 21:1-21:29 (2021) - [j8]Isaac Grosof
Optimal Scheduling in the Multiserver-job Model under Heavy Traffic. Proc. ACM Meas. Anal. Comput. Syst. 6(3): 51:1-51:32 (2021) - [c8]Isaac Grosof, Kunhe Yang, Ziv Scully, Mor Harchol-Balter
Nudge: Stochastically Improving upon FCFS. SIGMETRICS (Abstracts) 2021: 11-12 - [c7]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 - [c6]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 - [i9]Isaac Grosof, Kunhe Yang, Ziv Scully, Mor Harchol-Balter:
Nudge: Stochastically Improving upon FCFS. CoRR abs/2106.01492 (2021) - [i8]Isaac Grosof, Mor Harchol-Balter, Alan Scheller-Wolf:
The Finite-Skip Method for Multiserver Analysis. CoRR abs/2109.12663 (2021) - [i7]Ziv Scully, Isaac Grosof, Michael Mitzenmacher:
Uniform Bounds for Scheduling with Job Size Estimates. CoRR abs/2110.00633 (2021) - 2020
- [j7]Ziv Scully
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) - [j6]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) - [j5]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) - [c5]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 - [i6]Ziv Scully, Isaac Grosof, Mor Harchol-Balter:
Optimal Multiserver Scheduling with Unknown Job Sizes in Heavy Traffic. CoRR abs/2003.13232 (2020) - [i5]Isaac Grosof, Mor Harchol-Balter, Alan Scheller-Wolf:
Stability for Two-class Multiserver-job Systems. CoRR abs/2010.00631 (2020)
2010 – 2019
- 2019
- [j4]Isaac Grosof, Ziv Scully
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) - [c4]Isaac Grosof
Load Balancing Guardrails: Keeping Your Heavy Traffic on the Road to Low Response Times. SIGMETRICS (Abstracts) 2019: 9-10 - [i4]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) - 2018
- [j3]Isaac Grosof
SRPT for multiserver systems. Perform. Evaluation 127-128: 154-175 (2018) - [j2]Isaac Grosof
SRPT for Multiserver Systems. SIGMETRICS Perform. Evaluation Rev. 46(2): 9-11 (2018) - [j1]Isaac Grosof
SRPT for Multiserver Systems. SIGMETRICS Perform. Evaluation Rev. 46(3): 8-9 (2018) - [c3]Erik D. Demaine, Isaac Grosof
Computational Complexity of Motion Planning of a Robot through Simple Gadgets. FUN 2018: 18:1-18:21 - [i3]Isaac Grosof, Ziv Scully, Mor Harchol-Balter:
SRPT for Multiserver Systems. CoRR abs/1805.07686 (2018) - [i2]Erik D. Demaine, Isaac Grosof, Jayson Lynch, Mikhail Rudoy:
Computational Complexity of Motion Planning of a Robot through Simple Gadgets. CoRR abs/1806.03539 (2018) - 2017
- [c2]Erik D. Demaine, Isaac Grosof
Push-Pull Block Puzzles are Hard. CIAC 2017: 177-195 - [i1]Erik D. Demaine, Isaac Grosof, Jayson Lynch:
Push-Pull Block Puzzles are Hard. CoRR abs/1709.01241 (2017) - 2015
- [c1]Benjamin N. Grosof, Janine Bloomfield, Paul Fodor, Michael Kifer, Isaac Grosof, Miguel Calejo, Terrance Swift:
Automated Decision Support for Financial Regulatory/Policy Compliance, using Textual Rulelog. Challenge+DC@RuleML 2015
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 2024-10-07 21:18 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: