Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Randomized assignment of jobs to servers in heterogeneous clusters of shared servers for low delay

Tools
- Tools
+ Tools

Mukhopadhyay, Arpan, Karthik, A and Mazumdar, Ravi R. (2016) Randomized assignment of jobs to servers in heterogeneous clusters of shared servers for low delay. Stochastic Systems, 6 (1). pp. 90-131. doi:10.1214/15-SSY179 ISSN 1946-5238.

[img]
Preview
PDF
WRAP-randomized-assignment-jobs-servers-heterogeneous-delay-Mukhopadhyay-2016.pdf - Published Version - Requires a PDF viewer.

Download (434Kb) | Preview
Official URL: https://doi.org/10.1287/15-SSY179

Request Changes to record.

Abstract

We consider the problem of assignning jobs to servers in a multi-server system consisting of N parallel processor sharing servers, categorized into M (≪ N) different types according to their processing capacities or speeds. Jobs of random sizes arrive at the system according to a Poisson process with rate Nλ. Upon each arrival, some servers of each type are sampled uniformly at random. The job is then assigned to one of the sampled servers based on their states. We propose two schemes, which differ in the metric for choosing the destination server for each arriving job. Our aim is to reduce the mean sojourn time of the jobs in the system.

It is shown that the proposed schemes achieve the maximal stability region, without requiring the knowledge of the system parameters. The performance of the system operating under the proposed schemes is analyzed in the limit as N → ∞. This gives rise to a mean field limit. The mean field is shown to have a unique, globally asymptotically stable equilibrium point which approximates the stationary distribution of load at each server. Asymptotic independence among the servers is established using a notion of intra-type exchangeability which generalizes the usual notion of exchangeability. It is further shown that the tail distribution of server occupancies decays doubly exponentially for each server type. Numerical evidence shows that at high load the proposed schemes perform at least as well as other schemes that require more knowledge of the system parameters.

Item Type: Journal Article
Divisions: Faculty of Science, Engineering and Medicine > Science > Computer Science
Journal or Publication Title: Stochastic Systems
Publisher: Institute for Operations Research and the Management Sciences (I N F O R M S)
ISSN: 1946-5238
Official Date: June 2016
Dates:
DateEvent
June 2016Published
17 October 2016Available
15 September 2016Accepted
Volume: 6
Number: 1
Page Range: pp. 90-131
DOI: 10.1214/15-SSY179
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Open Access (Creative Commons)
Copyright Holders: Copyright © 2016, The author(s)
Date of first compliant deposit: 12 April 2019
Date of first compliant Open Access: 5 August 2019

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us