Abstract
In this paper, we present preliminary results on the use of "network calculus" for parallel processing (fork join) systems, e.g., MapReduce. We derive a probabilistic bound that the delay through a single parallel processing stage exceeds a threshold.
| Original language | English (US) |
|---|---|
| Article number | 2825256 |
| Pages (from-to) | 48-50 |
| Number of pages | 3 |
| Journal | Performance Evaluation Review |
| Volume | 43 |
| Issue number | 2 |
| DOIs | |
| State | Published - Sep 16 2015 |
| Event | 33rd International Symposium on Computer Performance, Modeling, Measurement, and Evaluation, IFIP WG 7.3 Performance 2015 - Sydney, Australia Duration: Oct 19 2015 → Oct 21 2015 |
All Science Journal Classification (ASJC) codes
- Software
- Hardware and Architecture
- Computer Networks and Communications