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 routing schemes for large processor sharing systems with multiple service rates

Tools
- Tools
+ Tools

Mukhopadhyay, Arpan and Mazumdar, Ravi R. (2014) Randomized routing schemes for large processor sharing systems with multiple service rates. In: SIGMETRICS 2014 : The 2014 ACM international conference on Measurement and modeling of computer systems, Austin, Texas, USA, 16-20 Jun 2014 pp. 555-556. doi:10.1145/2591971.2592015

Research output not available from this repository.

Request-a-Copy directly from author or use local Library Get it For Me service.

Official URL: https://doi.org/10.1145/2591971.2592015

Request Changes to record.

Abstract

We consider randomized job routing techniques for a system consisting of a large number of parallel processor sharing servers with heterogeneous server speeds. In particular, a scheme, that routes an incoming job request to the server providing the highest instantaneous processing rate per job among two servers, chosen uniformly at random, is proposed. We show that, unlike the homogeneous case, in the heterogeneous case, such randomized dynamic schemes need not always perform better than the optimal static scheme (in which jobs are assigned to servers with fixed probabilities independent of server states) in terms of reducing the mean response time of jobs. Specifically, we show that the stability region under the proposed scheme is a subset of that under the optimal static routing scheme. We also obtain the stationary tail distribution of server occupancies for the proposed scheme in the limit as the system size grows to infinity. This distribution has been shown to be insensitive to job length distribution and decay super-exponentially.

Item Type: Conference Item (Poster)
Divisions: Faculty of Science, Engineering and Medicine > Science > Computer Science
Publisher: ACM
Official Date: 1 April 2014
Dates:
DateEvent
1 April 2014Accepted
Page Range: pp. 555-556
DOI: 10.1145/2591971.2592015
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Restricted or Subscription Access
Conference Paper Type: Poster
Title of Event: SIGMETRICS 2014 : The 2014 ACM international conference on Measurement and modeling of computer systems
Type of Event: Conference
Location of Event: Austin, Texas, USA
Date(s) of Event: 16-20 Jun 2014
Related URLs:
  • Organisation

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item
twitter

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