Zobrazeno 1 - 10
of 159
pro vyhledávání: '"Mor Harchol-Balter"'
Publikováno v:
Stochastic Systems, Vol 6, Iss 2, Pp 420-458 (2016)
A variety of problems in computing, service, and manufacturing systems can be modeled via infinite repeating Markov chains with an infinite number of levels and a finite number of phases. Many such chains are quasi-birth-death processes with transiti
Externí odkaz:
https://doaj.org/article/93885b57ce3c451da9fef973f0ce8ec1
Autor:
Mor Harchol-Balter
Tackling the questions that systems designers care about, this book brings queueing theory decisively back to computer science. The book is written with computer scientists and engineers in mind and is full of examples from computer systems, as well
Publikováno v:
Proceedings of the ACM on Measurement and Analysis of Computing Systems. 6:1-45
Capacity management, whether it involves servers in a data center, or human staff in a call center, or doctors in a hospital, is largely about balancing a resource-delay tradeoff. On the one hand, one would like to turn off servers when not in use (o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::57d7d1daa11d2065900dc2812727964c
https://doi.org/10.1145/3570617
https://doi.org/10.1145/3570617
Autor:
Mor Harchol-Balter, Ziv Scully
Publikováno v:
ACM SIGMETRICS Performance Evaluation Review. 49:3-7
This document examines five performance questions which are repeatedly asked by practitioners in industry: (i) My system utilization is very low, so why are job delays so high? (ii) What should I do to lower job delays? (iii) How can I favor short jo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4c6e772b3e5ec643b4b3b2b09e0a7b39
https://doi.org/10.1145/3543146.3543148
https://doi.org/10.1145/3543146.3543148
Publikováno v:
European Journal of Operational Research. 292:596-609
We consider how to best schedule reparative downtime for a customer-facing online service that is vulnerable to cyber attacks such as malware infections. These infections can cause performance degradation (i.e., a slower service rate) and facilitate
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4f1e91d9dde3e5d966c9e761e85cd842
https://doi.org/10.1016/j.ejor.2020.10.036
https://doi.org/10.1016/j.ejor.2020.10.036
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
Autor:
Mor Harchol-Balter
Publikováno v:
Queueing Systems. 97:3-37
Datacenter operations today provide a plethora of new queueing and scheduling problems. The notion of a “job” has become more general and multi-dimensional. The ways in which jobs and servers can interact have grown in complexity, involving paral
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ee3df0190cc82af8799385dd6d021f9d
https://doi.org/10.1007/s11134-020-09684-6
https://doi.org/10.1007/s11134-020-09684-6
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
Autor:
Mor Harchol-Balter, Ziv Scully
Publikováno v:
WiOpt
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::225a1fd4adfe592a3cfd241129b88ec5
https://doi.org/10.23919/wiopt52861.2021.9589051
https://doi.org/10.23919/wiopt52861.2021.9589051
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