Network calculus for parallel processing

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

doi:10.1145/2825236.2825256

Network calculus for parallel processing

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

Research output: Contribution to journal › Conference article › peer-review

6 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 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	https://doi.org/10.1145/2825236.2825256
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

Access to Document

10.1145/2825236.2825256

Cite this

@article{9549db1d86cb4218a1c394ddd7b40271,

title = "Network calculus for parallel processing",

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.",

author = "G. Kesidis and Y. Shan and B. Urgaonkar and J. Liebeherr",

year = "2015",

month = sep,

day = "16",

doi = "10.1145/2825236.2825256",

language = "English (US)",

volume = "43",

pages = "48--50",

journal = "Performance Evaluation Review",

issn = "0163-5999",

publisher = "Association for Computing Machinery (ACM)",

number = "2",

note = "33rd International Symposium on Computer Performance, Modeling, Measurement, and Evaluation, IFIP WG 7.3 Performance 2015 ; Conference date: 19-10-2015 Through 21-10-2015",

}

TY - JOUR

T1 - Network calculus for parallel processing

AU - Kesidis, G.

AU - Shan, Y.

AU - Urgaonkar, B.

AU - Liebeherr, J.

PY - 2015/9/16

Y1 - 2015/9/16

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84978727214&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84978727214&partnerID=8YFLogxK

U2 - 10.1145/2825236.2825256

DO - 10.1145/2825236.2825256

M3 - Conference article

AN - SCOPUS:84978727214

SN - 0163-5999

VL - 43

SP - 48

EP - 50

JO - Performance Evaluation Review

JF - Performance Evaluation Review

IS - 2

M1 - 2825256

T2 - 33rd International Symposium on Computer Performance, Modeling, Measurement, and Evaluation, IFIP WG 7.3 Performance 2015

Y2 - 19 October 2015 through 21 October 2015

ER -

Network calculus for parallel processing

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this