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

Computable bounds in fork-join queueing systems

Tools
- Tools
+ Tools

Rizk, Amr, Poloczek, Felix and Ciucu, Florin (2015) Computable bounds in fork-join queueing systems. ACM SIGMETRICS Performance Evaluation Review, Volume 43 (Number 1). pp. 335-346. doi:10.1145/2796314.2745859

[img]
Preview
PDF
WRAP_1270279-cs-070715-sigmet15.pdf - Accepted Version - Requires a PDF viewer.

Download (1313Kb) | Preview
Official URL: http://dx.doi.org/10.1145/2796314.2745859

Request Changes to record.

Abstract

In a Fork-Join (FJ) queueing system an upstream fork station splits incoming jobs into N tasks to be further processed by N parallel servers, each with its own queue; the response time of one job is determined, at a downstream join station, by the maximum of the corresponding tasks' response times. This queueing system is useful to the modelling of multi-service systems subject to synchronization constraints, such as MapReduce clusters or multipath routing. Despite their apparent simplicity, FJ systems are hard to analyze.

This paper provides the first computable stochastic bounds on the waiting and response time distributions in FJ systems. We consider four practical scenarios by combining 1a) renewal and 1b) non-renewal arrivals, and 2a) non-blocking and 2b) blocking servers. In the case of non blocking servers we prove that delays scale as O(logN), a law which is known for first moments under renewal input only. In the case of blocking servers, we prove that the same factor of log N dictates the stability region of the system. Simulation results indicate that our bounds are tight, especially at high utilizations, in all four scenarios. A remarkable insight gained from our results is that, at moderate to high utilizations, multipath routing 'makes sense' from a queueing perspective for two paths only, i.e., response times drop the most when N = 2; the technical explanation is that the resequencing (delay) price starts to quickly dominate the tempting gain due to multipath transmissions.

Item Type: Journal Article
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions: Faculty of Science > Computer Science
Library of Congress Subject Headings (LCSH): Queuing networks (Data transmission)
Journal or Publication Title: ACM SIGMETRICS Performance Evaluation Review
Publisher: ACM
ISSN: 0163-5999
Official Date: June 2015
Dates:
DateEvent
June 2015Published
15 April 2015Accepted
Volume: Volume 43
Number: Number 1
Number of Pages: 12
Page Range: pp. 335-346
DOI: 10.1145/2796314.2745859
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Restricted or Subscription Access
Funder: Deutsche Forschungsgemeinschaft (DFG)
Grant number: Ci 195/1- 1 (DFG)

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