Stochastic bounds in fork-join queueing systems under full and partial mapping
- Submitting institution
-
The University of Warwick
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 12722
- Type
- D - Journal article
- DOI
-
10.1007/s11134-016-9486-x
- Title of journal
- Queueing Systems
- Article number
- -
- First page
- 261
- Volume
- 83
- Issue
- 3
- ISSN
- 0257-0130
- Open access status
- Compliant
- Month of publication
- June
- Year of publication
- 2016
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
D - Data Science, Systems and Security
- Citation count
- 10
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The preliminary version appeared in the flagship ACM SIGMETRICS'15 conference, followed by this full paper in the premier journal on queueing theory. It provides the first explicit analysis of general fork-join queues, which are at the core of large-scale data processing systems. This research has impacted applied work in areas including data storage systems (Huang, Tsinghua), scheduling in parallel systems (Koeppl, Darmstadt), evaluation of software architectures (Buchholz, Dortmund), and energy storage systems (Liebeherr, Toronto), as well as theoretical work by top queueing researchers (e.g. Boxma, Eindhoven; Kesidis, Penn State; Xia, Ohio State). It also underpins a new EPSRC project (EP/T031115/1).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -