Zobrazeno 1 - 10
of 243
pro vyhledávání: '"Mazumdar, Ravi R."'
A large proportion of jobs submitted to modern computing clusters and data centers are parallelizable and capable of running on a flexible number of computing cores or servers. Although allocating more servers to such a job results in a higher speed-
Externí odkaz:
http://arxiv.org/abs/2406.09427
In this paper, we study systems where each job or request can be split into a flexible number of sub-jobs up to a maximum limit. The number of sub-jobs a job is split into depends on the number of available servers found upon its arrival. All sub-job
Externí odkaz:
http://arxiv.org/abs/2309.00060
We study problems arising in real-time auction markets, common in e-commerce and computational advertising, where bidders face the problem of calculating optimal bids. We focus upon a contract management problem where a demand aggregator is subject t
Externí odkaz:
http://arxiv.org/abs/2206.12408
We study the optimal behavior of a bidder in a real-time auction subject to the requirement that a specified collections of heterogeneous items be acquired within given time constraints. The problem facing this bidder is cast as a continuous time opt
Externí odkaz:
http://arxiv.org/abs/2111.08621
In this paper, we study a large system of $N$ servers each with capacity to process at most $C$ simultaneous jobs and an incoming job is routed to a server if it has the lowest occupancy amongst $d$ (out of N) randomly selected servers. A job that is
Externí odkaz:
http://arxiv.org/abs/2101.06529
Publikováno v:
Journal of Statistical Physics 2020
We study binary opinion dynamics in a fully connected network of interacting agents. The agents are assumed to interact according to one of the following rules: (1) Voter rule: An updating agent simply copies the opinion of another randomly sampled a
Externí odkaz:
http://arxiv.org/abs/2003.02885
Autor:
Eisen, Jonah1 (AUTHOR) jseisen@uwaterloo.ca, Mazumdar, Ravi R.1 (AUTHOR), Mitran, Patrick1 (AUTHOR)
Publikováno v:
Entropy. Aug2023, Vol. 25 Issue 8, p1180. 29p.
In this paper, we study large multi-server loss models under power-of-$d$ routing scheme when service time distributions are general with finite mean. Previous works have addressed the exponential service time case when the number of servers goes to
Externí odkaz:
http://arxiv.org/abs/1708.09328
Autor:
Ghanbarian, Samira1, Mazumdar, Ravi R.1 mazum@uwaterloo.ca
Publikováno v:
Stochastic Models. 2024, Vol. 40 Issue 2, p296-339. 44p.