Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Isaac Grosof"'
Publikováno v:
SIGMETRICS (Abstracts)
The First-Come First-Served (FCFS) scheduling policy is the most popular scheduling algorithm used in practice. Furthermore, its usage is theoretically validated: for light-tailed job size distributions, FCFS has weakly optimal asymptotic tail of res
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::33bb14b028d6ec395c91283f8cf32d1c
https://doi.org/10.1145/3460088
https://doi.org/10.1145/3460088
Multiserver-job systems, where jobs require concurrent service at many servers, occur widely in practice. Essentially all of the theoretical work on multiserver-job systems focuses on maximizing utilization, with almost nothing known about mean respo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4985d470d19b966d4aca8785fb2be33e
Publikováno v:
STOC
This talk is about scheduling and load balancing in a multi-server system, with the goal of minimizing mean response time in a general stochastic setting. We will specifically concentrate on the common case of a load balancing system, where a front-e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::85582bd406b6aebe572677ba063102cd
https://doi.org/10.1145/3406325.3465359
https://doi.org/10.1145/3406325.3465359
Multiserver queueing systems are found at the core of a wide variety of practical systems. Many important multiserver models have a previously-unexplained similarity: identical mean response time behavior is empirically observed in the heavy traffic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::83c931f263831acbd11496231dbfe190
Publikováno v:
SIGMETRICS (Abstracts)
Load balancing systems, comprising a central dispatcher and a scheduling policy at each server, are widely used in practice, and their response time has been extensively studied in the theoretical literature. While much is known about the scenario wh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::93bea04567141cb926e3525e39e9b7a9
Publikováno v:
Performance Evaluation. 145:102150
We consider scheduling to minimize mean response time of the M/G/k queue with unknown job sizes. In the single-server k = 1 case, the optimal policy is the Gittins policy, but it is not known whether Gittins or any other policy is optimal in the mult
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b818d673c8dc60136f64b4481789c8cf
https://doi.org/10.1016/j.peva.2020.102150
https://doi.org/10.1016/j.peva.2020.102150
The Shortest Remaining Processing Time (SRPT) scheduling policy and its variants have been extensively studied in both theoretical and practical settings. While beautiful results are known for single-server SRPT, much less is known for multiserver SR
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::251bdd73a5da34eecdeeda8a523203e0
http://arxiv.org/abs/1805.07686
http://arxiv.org/abs/1805.07686
Autor:
Isaac Grosof
Publikováno v:
Stochastic Systems. 9:297-298
The shortest remaining processing time (SRPT) scheduling policy has been deployed in many computer systems, such as web servers ( Harchol-Balter et al. 2003 ), networks ( Montazeri et al. 2018 ), databases ( Guirguis et al. 2009 ), and operating syst
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::82d9c0409e736475280f0bbd2cbca416
https://doi.org/10.1287/stsy.2019.0042
https://doi.org/10.1287/stsy.2019.0042
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319575858
CIAC
CIAC
This paper proves that push-pull block puzzles in 3D are PSPACE-complete to solve, and push-pull block puzzles in 2D with thin walls are NP-hard to solve, settling an open question [19]. Push-pull block puzzles are a type of recreational motion plann
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0134506cca390793f2a20a3aa150e49a
https://doi.org/10.1007/978-3-319-57586-5_16
https://doi.org/10.1007/978-3-319-57586-5_16