Randomized Assignment of Jobs to Servers in Heterogeneous Clusters of Shared Servers for Low Delay
Arpan Mukhopadhyay, A. Karthik, Ravi R. Mazumdar

TL;DR
This paper introduces two job assignment schemes in heterogeneous multi-server systems that achieve maximal stability and significantly reduce mean sojourn time, with proven asymptotic independence and doubly exponential tail decay.
Contribution
The paper proposes two novel job assignment schemes for heterogeneous server clusters that achieve optimal stability and analyze their performance in the mean field limit.
Findings
Both schemes achieve maximal stability region.
Server occupancy tail decays doubly exponentially.
Schemes perform well even without precise arrival rate estimates.
Abstract
We consider the job assignment problem in a multi-server system consisting of parallel processor sharing servers, categorized into () different types according to their processing capacity or speed. Jobs of random sizes arrive at the system according to a Poisson process with rate . Upon each arrival, a small number of servers from each type is sampled uniformly at random. The job is then assigned to one of the sampled servers based on a selection rule. We propose two schemes, each corresponding to a specific selection rule that aims at reducing the mean sojourn time of jobs in the system. We first show that both methods achieve the maximal stability region. We then analyze the system operating under the proposed schemes as which corresponds to the mean field. Our results show that asymptotic independence among servers holds even when is…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Queuing Theory Analysis · Optimization and Search Problems · Cloud Computing and Resource Management
