Zobrazeno 1 - 10
of 55
pro vyhledávání: '"Scully, Ziv"'
Autor:
Scully, Ziv, Doval, Laura
We consider search problems with nonobligatory inspection and single-item or combinatorial selection. A decision maker is presented with a number of items, each of which contains an unknown price, and can pay an inspection cost to observe the item's
Externí odkaz:
http://arxiv.org/abs/2410.19011
Autor:
Braverman, Anton, Scully, Ziv
We begin developing the theory of the generator comparison approach of Stein's method for continuous-time Markov processes where jumps are driven by clocks having general distributions, as opposed to exponential distributions. This paper handles mode
Externí odkaz:
http://arxiv.org/abs/2407.12716
Publikováno v:
Advances in Neural Information Processing Systems, 2024
Bayesian optimization is a technique for efficiently optimizing unknown functions in a black-box manner. To handle practical settings where gathering data requires use of finite resources, it is desirable to explicitly incorporate function evaluation
Externí odkaz:
http://arxiv.org/abs/2406.20062
Autor:
Yu, George, Scully, Ziv
We study the problem of scheduling jobs in a queueing system, specifically an M/G/1 with light-tailed job sizes, to asymptotically optimize the response time tail. This means scheduling to make $\mathbf{P}[T > t]$, the chance a job's response time ex
Externí odkaz:
http://arxiv.org/abs/2404.08826
Dispatching systems, where arriving jobs are immediately assigned to one of multiple queues, are ubiquitous in computer systems and service systems. A natural and practically relevant model is one in which each queue serves jobs in FCFS (First-Come F
Externí odkaz:
http://arxiv.org/abs/2312.16377
Autor:
Hong, Yige, Scully, Ziv
Publikováno v:
Performance Evaluation 163 (2024), 102377
How should we schedule jobs to minimize mean queue length? In the preemptive M/G/1 queue, we know the optimal policy is the Gittins policy, which uses any available information about jobs' remaining service times to dynamically prioritize jobs. For m
Externí odkaz:
http://arxiv.org/abs/2304.13231
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:
http://arxiv.org/abs/2211.02762
Autor:
Scully, Ziv, Harchol-Balter, Mor
The Gittins policy is a highly general scheduling policy that minimizes a wide variety of mean holding cost metrics in the M/G/1 queue. Perhaps most famously, Gittins minimizes mean response time in the M/G/1 when jobs' service times are unknown to t
Externí odkaz:
http://arxiv.org/abs/2111.10703
Autor:
Scully, Ziv, Harchol-Balter, Mor
Scheduling is a critical part of practical computer systems, and scheduling has also been extensively studied from a theoretical perspective. Unfortunately, there is a gap between theory and practice, as the optimal scheduling policies presented by t
Externí odkaz:
http://arxiv.org/abs/2110.11579
Autor:
Scully, Ziv, van Kreveld, Lucas
We consider scheduling in the M/G/1 queue with unknown job sizes. It is known that the Gittins policy minimizes mean response time in this setting. However, the behavior of the tail of response time under Gittins is poorly understood, even in the lar
Externí odkaz:
http://arxiv.org/abs/2110.06326