Network calculus for parallel processing

@article{Kesidis2015NetworkCF,
  title={Network calculus for parallel processing},
  author={George Kesidis and Bhuvan Urgaonkar and Yuquan Shan and S. Kamarava and J{\"o}rg Liebeherr},
  journal={SIGMETRICS Performance Evaluation Review},
  year={2015},
  volume={43},
  pages={48-50}
}
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. 

From This Paper

Figures, tables, and topics from this paper.