ITU

Network-Oblivious Algorithms

Research output: Journal Article or Conference Article in JournalJournal articleResearchpeer-review

Standard

Network-Oblivious Algorithms. / Bilardi, Gianfranco; Pietracaprina, Andrea; Pucci, Geppino; Scquizzato, Michele; Silvestri, Francesco.

In: Journal of the ACM, Vol. 63, No. 1, 3, 03.2016.

Research output: Journal Article or Conference Article in JournalJournal articleResearchpeer-review

Harvard

Bilardi, G, Pietracaprina, A, Pucci, G, Scquizzato, M & Silvestri, F 2016, 'Network-Oblivious Algorithms', Journal of the ACM, vol. 63, no. 1, 3. https://doi.org/10.1145/2812804

APA

Bilardi, G., Pietracaprina, A., Pucci, G., Scquizzato, M., & Silvestri, F. (2016). Network-Oblivious Algorithms. Journal of the ACM, 63(1), [3]. https://doi.org/10.1145/2812804

Vancouver

Bilardi G, Pietracaprina A, Pucci G, Scquizzato M, Silvestri F. Network-Oblivious Algorithms. Journal of the ACM. 2016 Mar;63(1). 3. https://doi.org/10.1145/2812804

Author

Bilardi, Gianfranco ; Pietracaprina, Andrea ; Pucci, Geppino ; Scquizzato, Michele ; Silvestri, Francesco. / Network-Oblivious Algorithms. In: Journal of the ACM. 2016 ; Vol. 63, No. 1.

Bibtex

@article{3a97c1269f564bba8dbd28c1ff1329b8,
title = "Network-Oblivious Algorithms",
abstract = "A framework is proposed for the design and analysis of network-oblivious algorithms, namely algorithms that can run unchanged, yet efficiently, on a variety of machines characterized by different degrees of parallelism and communication capabilities. The framework prescribes that a network-oblivious algorithm be specified on a parallel model of computation where the only parameter is the problem{\textquoteright}s input size, and then evaluated on a model with two parameters, capturing parallelism granularity and communication latency. It is shown that for a wide class of network-oblivious algorithms, optimality in the latter model implies optimality in the decomposable bulk synchronous parallel model, which is known to effectively describe a wide and significant class of parallel platforms. The proposed framework can be regarded as an attempt to port the notion of obliviousness, well established in the context of cache hierarchies, to the realm of parallel computation. Its effectiveness is illustrated by providing optimal network-oblivious algorithms for a number of key problems. Some limitations of the oblivious approach are also discussed.",
keywords = "Communication, models of computation, network locality, oblivious algorithms, parallel algorithms",
author = "Gianfranco Bilardi and Andrea Pietracaprina and Geppino Pucci and Michele Scquizzato and Francesco Silvestri",
year = "2016",
month = mar,
doi = "10.1145/2812804",
language = "English",
volume = "63",
journal = "Journal of the ACM",
issn = "0004-5411",
publisher = "Association for Computing Machinery",
number = "1",

}

RIS

TY - JOUR

T1 - Network-Oblivious Algorithms

AU - Bilardi, Gianfranco

AU - Pietracaprina, Andrea

AU - Pucci, Geppino

AU - Scquizzato, Michele

AU - Silvestri, Francesco

PY - 2016/3

Y1 - 2016/3

N2 - A framework is proposed for the design and analysis of network-oblivious algorithms, namely algorithms that can run unchanged, yet efficiently, on a variety of machines characterized by different degrees of parallelism and communication capabilities. The framework prescribes that a network-oblivious algorithm be specified on a parallel model of computation where the only parameter is the problem’s input size, and then evaluated on a model with two parameters, capturing parallelism granularity and communication latency. It is shown that for a wide class of network-oblivious algorithms, optimality in the latter model implies optimality in the decomposable bulk synchronous parallel model, which is known to effectively describe a wide and significant class of parallel platforms. The proposed framework can be regarded as an attempt to port the notion of obliviousness, well established in the context of cache hierarchies, to the realm of parallel computation. Its effectiveness is illustrated by providing optimal network-oblivious algorithms for a number of key problems. Some limitations of the oblivious approach are also discussed.

AB - A framework is proposed for the design and analysis of network-oblivious algorithms, namely algorithms that can run unchanged, yet efficiently, on a variety of machines characterized by different degrees of parallelism and communication capabilities. The framework prescribes that a network-oblivious algorithm be specified on a parallel model of computation where the only parameter is the problem’s input size, and then evaluated on a model with two parameters, capturing parallelism granularity and communication latency. It is shown that for a wide class of network-oblivious algorithms, optimality in the latter model implies optimality in the decomposable bulk synchronous parallel model, which is known to effectively describe a wide and significant class of parallel platforms. The proposed framework can be regarded as an attempt to port the notion of obliviousness, well established in the context of cache hierarchies, to the realm of parallel computation. Its effectiveness is illustrated by providing optimal network-oblivious algorithms for a number of key problems. Some limitations of the oblivious approach are also discussed.

KW - Communication

KW - models of computation

KW - network locality

KW - oblivious algorithms

KW - parallel algorithms

U2 - 10.1145/2812804

DO - 10.1145/2812804

M3 - Journal article

VL - 63

JO - Journal of the ACM

JF - Journal of the ACM

SN - 0004-5411

IS - 1

M1 - 3

ER -

ID: 81950151