Network calculus for parallel processing

G. Kesidis, Y. Shan, B. Urgaonkar, J. Liebeherr

Research output: Contribution to journalConference articlepeer-review

5 Scopus citations

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 languageEnglish (US)
Article number2825256
Pages (from-to)48-50
Number of pages3
JournalPerformance Evaluation Review
Volume43
Issue number2
DOIs
StatePublished - Sep 16 2015
Event33rd International Symposium on Computer Performance, Modeling, Measurement, and Evaluation, IFIP WG 7.3 Performance 2015 - Sydney, Australia
Duration: Oct 19 2015Oct 21 2015

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this